Sciweavers

Share
MOBIHOC
2004
ACM

On greedy geographic routing algorithms in sensing-covered networks

10 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even fail due to routing voids on random network topologies. We study greedy geographic routing in an important class of wireless sensor networks that provide sensing coverage over a geographic area (e.g., surveillance or object tracking systems). Our geometric analysis and simulation results demonstrate that existing greedy geographic routing algorithms can successfully find short routing paths based on local states in sensing-covered networks. In particular, we derive theoretical upper bounds on the network dilation of sensing-covered networks under greedy geographic routing algorithms. Furthermore, we propose a new greedy geographic routing algorithm called Bounded Voronoi Greedy Forwarding (BVGF) that allows sensing-covered networks to achieve an asymptotic network dilation lower than 4.62 as long as the commu...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng
Added 25 Dec 2009
Updated 25 Dec 2009
Type Conference
Year 2004
Where MOBIHOC
Authors Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng Huang
Comments (0)
books