Socially-Aware Adaptive Delay Tolerant Network (DTN) routing protocol.

Network partitioning and node disconnectivity results in high latency and frequent link disruption in DTNs. Therefore, routing a message toward a destined node is a challenge in such environment. Several DTN routing schemes have been introduced in this regard. Some, recently proposed DTN routing protocols either use a single or combination of multiple social metrics to identify the suitable forwarder node(s). However, these DTN routing protocols produced results at the expense of community formation cost and over utilization of network resources. To address these issues, we propose Socially-Aware Adaptive DTN (SAAD) routing scheme which exploits a social attribute known as Degree Centrality (DC). In this scheme, each node calculates and shares its DC with other nodes at regular intervals. A forwarder node disseminates message to the most influential node possessing highest DC. The proposed routing scheme works great in situations where someone want to improve the energy efficiency and want to involve only relevant nodes. The simulation results show that SAAD has improved to select the best node and has reduced the hop-count, overhead on the expense of delay as compared to Epidemic, PRoPHET and PRoPHETv2.

Detection of malicious consumer interest packet with dynamic threshold values.

As a promising next-generation network architecture, named data networking (NDN) supports name-based routing and in-network caching to retrieve content in an efficient, fast, and reliable manner. Most of the studies on NDN have proposed innovative and efficient caching mechanisms and retrieval of content via efficient routing. However, very few studies have targeted addressing the vulnerabilities in NDN architecture, which a malicious node can exploit to perform a content poisoning attack (CPA). This potentially results in polluting the in-network caches, the routing of content, and consequently isolates the legitimate content in the network. In the past, several efforts have been made to propose the mitigation strategies for the content poisoning attack, but to the best of our knowledge, no specific work has been done to address an emerging attack-surface in NDN, which we call an interest flooding attack. Handling this attack-surface can potentially make content poisoning attack mitigation schemes more effective, secure, and robust. Hence, in this article, we propose the addition of a security mechanism in the CPA mitigation scheme that is, Name-Key Based Forwarding and Multipath Forwarding Based Inband Probe, in which we block the malicious face of compromised consumers by monitoring the Cache-Miss Ratio values and the Queue Capacity at the Edge Routers. The malicious face is blocked when the cache-miss ratio hits the threshold value, which is adjusted dynamically through monitoring the cache-miss ratio and queue capacity values. The experimental results show that we are successful in mitigating the vulnerability of the CPA mitigation scheme by detecting and blocking the flooding interface, at the cost of very little verification overhead at the NDN Routers.

An Emergency Response System: Construction, Validation, and Experiments for Disaster Management in a Vehicular Environment.

Natural disasters and catastrophes not only cost the loss of human lives, but adversely affect the progress toward sustainable development of the country. As soon as disaster strikes, the first and foremost challenge for the concerned authorities is to make an expeditious response. Consequently, they need to be highly-organized, properly-trained, and sufficiently-equipped to effectively respond and limit the destructive effects of a disaster. In such circumstances, communication plays a vital role, whereby the consequences of tasks assigned to the workers for rescue and relief services may be streamlined by relaying necessary information among themselves. Moreover, most of the infrastructure is either severely damaged or completely destroyed in post-disaster scenarios; therefore, a Vehicular Ad Hoc Network (VANET) is used to carry out the rescue operation, as it does not require any pre-existing infrastructure. In this context, the current work proposes and validates an effective way to relay the crucial information through the development of an application and the deployment of an experimental TestBed in a vehicular environment. The TestBed may able to provide a way to design and validate the algorithms. It provides a number of vehicles with onboard units embedded with a credit-card-size microcomputer called Raspberry Pi and a Global Positioning System (GPS) module. Additionally, it dispatches one of the pre-defined codes of emergency messages based on the level of urgency through multiple hops to a central control room. Depending on the message code received from a client, the server takes appropriate action. Furthermore, the solution also provides a graphical interface that is easy to interpret and to understand at the control room to visualize the rescue operation on the fly.

Protocol independent adaptive route update for VANET.

High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route.