An adaptive hole-bypassing algorithm for wireless sensor networks
Khaled Hadi · 2016
In this paper, we propose an adaptive, local hole-bypassing algorithm for geographic routing in Wireless Sensor Networks (WSNs). Void areas exist in WSNs mainly because of low-density sensor-node distribution or the drain of a sensor node's energy supply. In geographic forwarding and routing protocol, when a receiving node of a packet is nearest to the packet's destination, the node declares itself a hole node and drops the packet. We therefore propose adding a mechanism in the forward-routing process, wherein the hole node forwards the packet backward, in the hopes of finding a path to the destination node. The number of times a packet can be backward-forwarded is limited to a maximum value. Herein, an adaptive mechanism is proposed to set this maximum value. We also show, through simulation, that our algorithm outperforms the baseline geographic-forwarding algorithm, as well as some fixed, maximum values over a sensor network's lifetime in terms of its packet-delivery ratio.