By Topic

Distributed roadmap aided routing in sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zizhan Zheng ; Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH ; Kai-Wei Fan ; Sinha, P. ; Yusu Wang

Communication between arbitrary pairs of nodes has become critical to support in emerging sensor networking applications. Traditional routing techniques for multi-hop wireless networks either require high control overhead in computing and maintaining routes, or may lead to unbounded route-stretch. In order to bound the route-stretch, we propose a distributed shortest-path roadmap based routing paradigm that embodies two ideas: routing hole approximation that summaries the critical information about hole boundaries and controlled advertisement that advertises the boundary information of each hole within limited neighborhoods. We show that our approach makes a desired tradeoff between the worst case route-stretch and the message overhead through both analysis and simulations.

Published in:

Mobile Ad Hoc and Sensor Systems, 2008. MASS 2008. 5th IEEE International Conference on

Date of Conference:

Sept. 29 2008-Oct. 2 2008