Two-Hop Geographic Multipath Routing in Duty-cycled Wireless Sensor Networks

As an extension of our previous designed Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm in wireless sensor networks (WSNs), this paper proposes a new 2-hop geographic greedy forwarding algorithm called TPGFPlus, which uses 2-hop neighborhood information for geographic routing. In our TPGFPlus, a forwarding node selects its next-hop node which is closest to the based station among all its 1-hop and 2-hop neighbor nodes. Moreover, to prolong network lifetime, not all the nodes are awake for working in our work since the EC-CKN algorithm is applied to make the network be duty-cycled. We evaluate the performance of our algorithm versus running existing TPGF algorithm on the same duty-cycled WSNs. Simulations show that our proposed algorithm outperforms previous work TPGF on finding more average paths and shorter average length of paths, yet without causing additional energy consumption.