Dead-end free geographic routing protocol for WSN

Abstract

The routing of data packets in Wireless Sensor Networks(WSNs) is treated as one of the important aspects. The deadend phenomenon (also known as the "local maximum" problem) poses major difficulties when performing geographic forwarding in wireless sensor network since whenever a packet encounters a dead-end, additional overheads must be paid to forward the packet to the destination via alternative route. In this paper, the proposed algorithm route the data packets around the connectivity holes region. The proposed algorithm consists of two phases; the detection of dead node is performed in first phase, avoidance of connectivity holes and selection of forwarding nodes are performed in second phase of algorithm. The residual energy, packet delivery ratio and distance are considered while selecting forwarding nodes. The proposed algorithm ensures that the data packets are forwarded in an energy efficient manner and improves PDR. Through extensive experiments shows that our algorithm performs better than the existing Protocol [10] in terms of energy consumption, network life time, packet delivery ratio and energy consumed per packet.