GWRR: Greedy Weighted Region Routing in Wireless Sensor Networks
Euhanna Ghadimi, Nasser Yazdani, Ahmad Khonsari · 2008
Wireless sensor networks (WSNs) consist of large number of sensor nodes with limited sensing, processing and communication capabilities that cooperatively fulfill environmental sensing and monitoring tasks. WSNs are meant to be deployed in large numbers in various environments, including remote and more importantly harsh environments ensuing potential hardware or software faults which consequently may cause temporal unavailability of some sensor nodes. Geographic routing algorithms owing to low overhead of message passing and state preserving are very promising candidate for such environments. In this paper, we propose greedy weighted region routing (GWRR) algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to harsher regions and then we present a nearly-optimal routing in dense WSNs. Moreover, we demonstrate that GWRR has low computational overhead. Simulation experiments confirm the validity of proposed algorithm with high degree of accuracy.