Rama Shankar Yadav

Geographical routing is an area of interest for wireless sensor networks because of its scalability and local decision making capability. Usually, geographical routing protocols rely on greedy approach and suffer from the void node problem (VNP). This paper presents an angular three-dimensional routing protocol (A3DR) for wireless sensor networks. In A3DR, the next hop is selected from nodes available in solid angle decided dynamically based on network density, i.e. , larger solid angle for sparse networks while a smaller angle for dense one. The delay based contention mechanism has been proposed to select a suitable forwarding node among nodes lying in a particular solid angle. A3DR has a provision to adaptively tune the solid angle to resolve the void node problem. Further, the proposed protocol A3DR will take care of traffic congestion problem suffered by beaconless routing protocol. The A3DR tackle the concave void problem by allowing conditional backtracking to find another suitable path and prevent looping. Additionally, A3DR address overhear problem by utilizing the concept of request-to-forward and clear-to-forward for the nodes lying outside the solid angle 60°. The performance of proposed A3DR is compared with existing protocols by implementing it on the INET framework under OMNET++ simulator. The simulation results indicate that A3DR achieves a high packet reception rate while maximizing the residual energy and minimizing traffic overhead.

The safety event information sharing among the vehicles in motion is the primary goal to design the vehicular ad hoc network (VANET). The shared safety event information assists vehicles to avoid road accidents and driving inconvenience. The advantages of safety event information sharing in VANET has become blunt due to the misbehavior of vehicles. The vehicle’s misbehavior like dissemination of false information, reply of bogus messages, etc., can create traffic hazards on the road and may result in the loss of property and human lives. In VANET, the detection of such misbehaving vehicles along with minimum time delay in flooding safety event information (i.e., incident delay) to others is challenging due to the high speed of vehicles. The formation of stable VANET topology is a feasible solution among many to improve the performance of misbehavior detection and reducing incident delay even with high speed of vehicles. In this paper, we propose an information based misbehavior detection algorithm (IBMDA) that effectively works in stable cluster based VANET. Our proposed IBMDA algorithm that runs on the selected cluster head vehicles is used to verify the content of received safety event messages. The identification of vehicles as malicious or non malicious depends on the result of verification at cluster heads. An illustrative example is given to explore our proposed algorithm easily and effectively. The highway scenario is considered to test the performance of our proposed IBMDA algorithm. The simulation is performed with a detailed comparative analysis using ns-3 simulator. It is observed that under the considered scenario, our proposed algorithm improves the misbehavior detection accuracy up to 6.46% and reduces average incident delay approximately up to 14.78% as compared to existing algorithms.