Abstract
The dead end problem in greedy forwarding is an important issue of location based routing in sensor networks. It occurs when a message falls into a local minimum using greedy forwarding. Current solutions to this problem are insufficient in either eliminating traffic/path memorization or finding satisfactory short paths. In this paper, we propose a novel algorithm, called partial-partition avoiding geographic routing (PAGER), to solve the problem. The basic idea of PAGER is to divide a sensor network graph into functional subgraphs and provide each sensor node with message forwarding directions based on these subgraphs. PAGER results in loop free short paths without memorization of traffics/paths in sensor nodes. It does not require planarization of the underlying network graph. Further, the mobility adaptability of PAGER makes it suitable for use in mobile sensor networks with frequent topology changes. We implement the PAGER algorithm in two protocols and evaluate them in sensor networks with different parameters. Experimental results show the advantage of PAGER in the context of sensor networks.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
