A New Greedy Geographical Routing in Wireless Sensor Networks

Wireless sensor network includes a large number of nodes which are distributed in a geographical location. The essential fact about WSN is that energy of nodes is limited. Therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. In this paper we propose a method which performs routing in WSNs using greedy approach. It is able to choose optimum rout based on energy level and distance. Since our method tries to equally utilize energy of different nodes, it will eventually result in lifetime increase. In addition to modifying energy consumption, simulation results show that proposed algorithm achieves considerable improvement in reduction of end-to-end delay and increase in packet delivery rate.

Keywords:

Wireless Sensor Networks , Greedy Geographical Routing , Node , Set Approach