An efficient bypassing void routing protocol based on virtual coordinate mapping for WSN
Dejing Zhang, Enqing Dong, Zhulou Cao, Peng Qian, Juan Xu · 2014
Greedy forwarding fails when a routing void is encountered in geographic routing. To solving the routing void problem, high control packet overhead and transmission delay are usually taken in wireless sensor networks. Inspired by the edge topology without routing void, an efficient bypassing void routing protocol based on virtual coordinate mapping is proposed in the paper. The basic idea of this protocol is to transform random topology with void edge into regular one by mapping edge nodes coordinates to a virtual circle. The virtual coordinates can prevent greedy forwarding from failing, so that there is no routing void in forwarding process from source to destination and control overhead can be reduced. Furthermore, the mapped edge topology without routing void is benefit for reducing average length of routing paths and decreasing transmission delay. Compared with AODV and GPSR, simulation shows the proposed protocol has higher delivery ratio, shorter path length, less control packet overhead and energy consumption.