Component-Based Localization in Sparse Wireless Networks教程.pdfVIP

540 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 2, APRIL 2011 Component-Based Localization in Sparse Wireless Networks Xiaoping Wang, Jun Luo, Yunhao Liu, Senior Member, IEEE, Shanshan Li, and Dezun Dong Abstract—Localization is crucial for wireless ad hoc and sensor denoted as RRT-3B [5]. For a partially localizable network, networks. As the distance-measurement ranges are often less than RRT-3B can identify most localizable nodes by recursively par- the communication ranges for many ranging systems, most com- titioning the network into globally rigid parts [5]. Thus, the munication-dense wireless networks are localization-sparse. Con- RRT-3B becomes a criterion to evaluate the performance of lo- sequently, existing algorithms fail to provide accurate localization supports. In order to address this issue, by introducing the con- calization algorithms. To the best of our knowledge, there is cept of component, we group nodes into components so that nodes no scheme that can explicitly achieve the amount of localizable are able to better share ranging and anchor knowledge. Operating nodes under RRT-3B conditions. on the granularity of components, our design, CALL, relaxes two The state-of-the-art algorithm of approaching to the capacity essential restrictions in localization: the node ordering and the an- of RRT-3B is Sweeps [2]. Sweeps utilizes the concept of finite chor distribution. Compared to previous designs, CALL is proven localization to relax the node participating conditions from tri- to be able to locate the same number of nodes using the least