Sciweavers

Share
INFOCOM
2012
IEEE

Approximate convex decomposition based localization in wireless sensor networks

7 years 23 days ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research direction for localization is to develop schemes using connectivity information only. These schemes primary apply hop counts to distance estimation. Not surprisingly, they work well only when the network topology has a convex shape. In this paper, we develop a new Localization protocol based on Approximate Convex Decomposition (ACDL). It can calculate the node virtual locations for a large-scale sensor network with arbitrary shapes. The basic idea is to decompose the network into convex subregions. It is not straight-forward, however. We first examine the influential factors on the localization accuracy when the network is concave such as the sharpness of concave angle and the depth of the concave valley. We show that after decomposition, the depth of the concave valley becomes irrelevant. We thus define co...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where INFOCOM
Authors Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Chonggang Wang
Comments (0)
books