Abstract

Several geographic (or position-based) routing protocols have been proposed for data dissemination in wireless sensor networks. In these protocols, routing is based on the positions of neighboring nodes. In particular, the next-hop node is selected according to either a distance-based strategy, which favors a neighbor with the largest distance progress toward the sink, or a direction-based strategy, which favors a neighbor with the lowest angle deviation toward the sink. In this paper, we propose a novel hybrid geographic routing (HGR) scheme that combines both distance- and direction-based strategies in a flexible manner. To further facilitate a tradeoff between energy consumption and end-to-end delay, we propose two dynamic HGR (DHGR) mechanisms based on the basic HGR scheme, which are designed to satisfy constraints on the average end-to-end delay of specific applications while minimizing energy consumption. Packet-delivery decisions are locally made, and the state at a node is independent of the number of nodes in the network; thus, DHGR has the inherent scaling property of geographic routing. The effectiveness of the proposed schemes is evaluated by analysis and extensive simulations.

Full Text
Paper version not known

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

Disclaimer: 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.