Abstract
Geographic routing protocols for wireless sensor networks (WSNs) have received more attentions in recent years and greedy forwarding algorithm is a main component in geographic routing. In this paper, we investigate the forwarding criterions in greedy forwarding algorithms and present a greedy routing algorithm using a new criterion combining the characteristics of both distance-based criterion and direction-based criterion. Simulation is provided to compare the performance of our algorithm with those of the algorithm with distance-based criterion and the algorithm with direction-based criterion. The results show that our proposed algorithm is a preferred option in terms of the trade-off between transformation delay and energy consumption in the routing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
