Thumbnail
Access Restriction
Subscribed

Author Zizhan Zheng ♦ Kai-Wei Fan ♦ Sinha, P. ♦ Yusu Wang
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science ♦ Natural sciences & mathematics ♦ Physics ♦ Electricity & electronics ♦ Technology ♦ Engineering & allied operations
Subject Keyword Protocols ♦ Routing ♦ Approximation algorithms ♦ Routing protocols ♦ Approximation methods ♦ Helium ♦ Floods
Abstract 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.
Description Author affiliation: Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH (Zizhan Zheng; Kai-Wei Fan; Sinha, P.; Yusu Wang)
ISBN 9781424425747
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-09-29
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 1.99 MB
Page Count 6
Starting Page 347
Ending Page 352


Source: IEEE Xplore Digital Library