Sanjay Kumar Dhurandher

Routing in Opportunistic Networks

Routing in Opportunistic Networks focuses on the basics of opportunistic networks, modeling and communication in opportunistic networks, routing in opportunistic networks, and collaboration and cooperation in opportunistic networks. The editors will cover such topics as mobility characterization and discovery in opportunistic networks, scheduling and medium access control in opportunistic networks as well as testbed, tools, and measurements for opportunistic networks.

An ant colony optimization approach for reputation and quality-of-service-based security in wireless sensor networks

In wireless sensor networks (WSN), message security is an important concern. The protection of integrity and confidentiality of information and the protection from unauthorized access are important issues. However, due to factors such as resource limitations, absence of centralized access points, open wireless medium and small size of the sensor nodes, the implementation of security in WSN is a challenging task. In this paper, we propose a protocol, quality-based distance vector routing (QDV), for securing WSN using concepts based on Ant colony optimization ACO [1]. Two fundamental parameters—quality-of-service (QoS) and reputation [2]—are used. The high value of reputation of a node signifies that the node is trusted and is more reliable for data communication purposes. As a node shows signs of misbehavior, its reputation decreases, which, in turn, affects its quality-of-security QSec [2], thereby disabling the malicious nodes from gaining access to the network. By incorporating these two factors, we are able to distinguish the nodes present in the network. We, then, present a method to achieve “equilibrium” where the node is able to guarantee that its neighbors are secure. Copyright

FACES: Friend-Based Ad Hoc Routing Using Challenges to Establish Security in MANETs Systems

Friend based Ad hoc routing using Challenges to Establish Security (FACES) is an algorithm to provide secure routing in ad hoc mobile networks. We propose this scheme that has been drawn from a network of friends in real life scenarios. The algorithm works by sending challenges and sharing friend Lists to provide a list of trusted nodes to the source node through which data transmission finally takes place. The nodes in the friend list are rated on the basis of the amount of data transmission they accomplish and their friendship with other nodes in the network. The account of friendship of a node with other nodes in the network is obtained through the Share Your Friends process which is a periodic event in the network. As a result of this scheme of operation, the network is able to effectively isolate the malicious nodes which are left with no role to play in the ad hoc network. One major benefit of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbors. The information about the malicious nodes is gathered effectively by using Challenges. This reduces the overhead on the network significantly. Through extensive simulation analysis it was inferred that this scheme provides an efficient approach towards security and easier detection of malicious nodes in the mobile ad hoc network.

HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks

In Opportunistic Networks (OppNets), the existence of an end-to-end connected path between the sender and the receiver is not possible. Thus routing in this type of networks is different from the traditional Mobile Adhoc Networks (MANETs). MANETs assume the existence of a fixed route between the sender and the receiver before the start of the communication and till its completion. Routes are constructed dynamically as the source node or an intermediate node can choose any node as next hop from a group of neighbors assuming that it will take the message closer to the destination node or deliver to the destination itself. In this paper, we proposed a novel History Based Prediction Routing (HBPR) protocol for infrastructure-less OppNets which utilizes the behavioral information of the nodes to find the best next node for routing. The proposed protocol was compared with the Epidemic routing protocol. Through simulations it was found that the HBPR performs better in terms of number of messages delivered and the overhead ratio than the Epidemic protocol.

Using honeynodes for defense against jamming attacks in wireless infrastructure-based networks

The advent of wireless networks has brought a new set of security issues with it. One of the most feared of these is the jamming-based attacks. In this paper, we propose a pre-emptive detection strategy using honeynodes and a response mechanism based on the existing Channel Surfing Algorithm [Xu W, Trappe W, Zhang Y, Wood T. Channel surfing and spatial retreats: defenses against wireless denial of service. ACM Wireless Security 2004;80-9] to protect wireless nodes from a jammer. Honeynodes generate dummy communication at a frequency close to the actual frequency of operation, and pre-emptively alert authentic nodes of imminent attacks, so that the authentic nodes can jump to another frequency even before a jammer starts scanning that frequency. The next frequency is selected using a novel approach which uses a hybrid of reactive and proactive channel selection procedures. We have simulated the proposed approach using NS-2. The experimental results further prove a marked improvement in the performance of the proposed system over the Channel Surfing Algorithm in terms of the packet delivery ratio, the jammed duration, control message overhead and the number of channel re-configurations.

Performance evaluation of various routing protocols in Opportunistic Networks

In Opportunistic Networks (Oppnets), the end-to-end path between the source and the destination never exists or may exist only for a very short and unpredictable period of time. Therefore, routing in these type of networks is different from that in Mobile Ad hoc Networks (MANETs) which first establish a source to destination path before the delivery of a message occurs. The nodes in Oppnets do not have or acquire the knowledge about the network topology which is necessary in case of MANETs. Here, the construction of routes is not static, but dynamic since the source can choose any node from a group of neighbors as a next hop assuming that it will deliver the message closer to the destination. In this paper, we have simulated, investigated and compared the performance of various routing protocols for Oppnets. Six existing routing protocols in Oppnets have been compared with each other by using various performance evaluating factors.

A LOW-OVERHEAD FAULT-TOLERANT ROUTING ALGORITHM FOR MOBILE AD HOC NETWORKS: A SCHEME AND ITS SIMULATION ANALYSIS

Abstract The fault-prone nodes in a mobile ad hoc network (MANET) degrade the performance of any routing protocol. Using greedy routing mechanisms that tend to choose a single path every time, may cause major data losses, if there is a breakdown of such a path in a fault-prone environment. On the other hand, using all the available paths causes an undesirable amount of overhead on the system. Designing an effective and efficient fault-tolerant routing protocol is inherently hard, since the problem is NP-complete because of the unavailability of precise path information in adversarial environments [1] . To address the above mentioned problem, we present a fault-tolerant routing algorithm (FTAR), which bases on the ideas of foraging in natural ants [2] . The algorithm is divided into six stages, namely, initialization, path selection, pheromone deposition, confidence calculation, evaporation and negative reinforcement. Simulation results show that FTAR achieves high packet delivery ratio and throughput as compared to some of the key protocols which do not address fault-tolerance at all. Most importantly, FTAR is established to supersede the performance of one of the best fault-tolerant MANET routing schemes [1] known currently, with respect to the amount of routing overhead incurred – it is an important achievement for ad hoc networks.

UWSim: A Simulator for Underwater Sensor Networks

We present a new simulator for Underwater Sensor Networks (UWSN), named UWSim. Most of the currently available simulators focus greatly on ground-based sensor and ad hoc networks; they do not consider the factors that affect the underwater communication. UWSim, on the other hand, has its focus on handling scenarios specific to UWSN environments. For example, communication between nodes in UWSN must take place at very low frequencies, which a UWSN simulator can achieve. The actual software development was carried out in a purely object-oriented fashion using C# capabilities. The development was highly modularized and was based on object-oriented design methodologies. An illustrative example is provided to show how this simulator can be used to generate useful data characteristic of UWSN environments. Currently, UWSim has support for limited number of functionalities and it calls for further extensions to support a wide range of UWSN simulation exercises.

GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks

In infrastructure-less opportunistic networks (Oppnets), the routing of messages is a challenging task since nodes are not aware of the network topology and they look for an opportunity to send the message by finding or predicting a best temporary path at each hop towards the destination. As nodes perform various computations for next hop selection, a lot of battery power gets consumed, which in turn reduces the network lifetime. Thus, there is a clear demand for routing protocols for such networks which are energy-efficient and consume lesser power of nodes in forwarding a message. In this paper, a novel routing protocol named genetic algorithm-based energy-efficient routing (GAER) protocol for infrastructure-less Oppnets is proposed. This protocol uses a node’s personal information, and then applies the genetic algorithm (GA) to select a better next hop among a group of neighbour nodes for the message to be routed to the destination. With the application of GA, optimal results are obtained that help in the selection of the best possible node as the next hop, which in turn, leads to prolonged battery life. Simulation results show that GAER outperforms the Epidemic, PROPHET, and Spray and Wait protocols in terms of messages delivered, overhead ratio, average residual energy, and number of dead nodes. The results obtained for average latency and average buffer time using GAER are comparable to those obtained for the aforementioned protocols.

Vehicular Security Through Reputation and Plausibility Checks

Vehicular ad hoc networks (VANETs) are essentially used to communicate real-time traffic and safety information. In this paper, we present vehicular security through reputation and plausibility checks to address the most important issue of security in VANETs. The algorithm provides security against the attacks of event modification, false event generation, data aggregation and data dropping. It performs not only detection but also the isolation of malicious nodes in the network. It employs sensors in a reputation-based system and presents a very robust yet cost efficient approach as it utilizes just vehicle to vehicle communication, thereby reducing the security issues and cost associated with the roadside infrastructure. The algorithm has been simulated and tested on various scenarios and has been observed to be very effective and efficient in terms of the percentage of malicious nodes detected, number of control packets sent after detection of malicious nodes, average time taken to detect nodes which are generating false information, number of packets dropped, and the number of packets received by malicious nodes.