Document Type

Technical Report

Publication Date

2003-07-08

Filename

wucse-2003-50.pdf

Technical Report Number

WUCSE-2003-50

Abstract

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 (e.g., surveillance or object tracking systems) that provide sensing coverage over a geographic area. 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 For-warding (BVGF) which allows sensing-covered networks to achieve an asymptotic network dilation lower than 4.62 as long as the communication range is at least twice the sensing range. Our results show that simple greedy geographic routing is an effective routing scheme in many sensing-covered networks.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7NC5ZH4

Download

Share

COinS