VAGR — Void aware in geographic routing for wireless sensor networks
Adhvikaa Ambikapathi Revathi, N. Malathy · 2016
Geographical routing protocols have many advantageous features for use in adhoc and sensor networks but are inclined to voids and localization errors. In wireless sensor network the sensor node's distribution is irregular, geographic routing protocols can always use the greedy algorithm which cause local minima problem. These problems occur mainly due to routing voids and this may lead to failure of data transmission. For efficient data delivery, nodes need to reconstruct their path toward the latest location of the destination. When a node wants to forward a packet to one of the neighbor node that node is closer to the destination node than itself but that node doesn't exist. Then the routing void is encountered. To solve the routing void problem, the Bypassing Void Routing based on Virtual Coordinate Mapping (BVR-VCM) is used. The main aim is to form a virtual circle with the help of edge node coordinates. To convert a random structure into a regular one by mapping the edge nodes coordinates to a virtual circle. By utilizing the virtual circle the greedy forwarding can also be prevented from failing, so that there is no routing void in forwarding process from source to destination and thereby control overhead can be reduced. BVR-VCM is beneficial to reduce average length of routing paths and decrease transmission delay. Simulations show that the proposed protocol has higher delivery ratio, shorter path length, less control packet, and energy consumption.