Sciweavers

Share
MOBIHOC
2005
ACM

Localization and routing in sensor networks by local angle information

9 years 11 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measurements in a sensor network. We prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance 1 away. Despite the negative results, however, one can find a planar spanner of a unit disk graph by using only local angles. The planar spanner can be used to generate a set of virtual coordinates that enable efficient and local routing schemes such as geographical routing or approximate shortest path routing. We also proposed a practical anchor-free embedding scheme by solving a linear program. We show by simulation that not only does it give very good local embedding, i.e., neighboring nodes are close and non-neighboring nodes are far away, b...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2005
Where MOBIHOC
Authors Jehoshua Bruck, Jie Gao, Anxiao Jiang
Comments (0)
books