Issue No. 08 - Aug. (2012 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.122
Yunhao Liu , Hong Kong University of Science and Technology, Hong Kong
Zheng Yang , Hong Kong University of Science and Technology, Hong Kong
Location awareness is highly critical for wireless ad-hoc and sensor networks. Many efforts have been made to solve the problem of whether or not a network can be localized. Nevertheless, based on the data collected from a working sensor network, it is observed that the network is not always entirely localizable. Theoretical analyses also suggest that, in most cases, it is unlikely that all nodes in a network are localizable, although a (large) portion of the nodes can be uniquely located. Existing studies merely examine whether or not a network is localizable as a whole; yet two fundamental questions remain unaddressed: First, given a network configuration, whether or not a specific node is localizable? Second, how many nodes in a network can be located and which are them? In this study, we analyze the limitation of previous works and propose a novel concept of node localizability. By deriving the necessary and sufficient conditions for node localizability, for the first time, it is possible to analyze how many nodes one can expect to locate in sparsely or moderately connected networks. To validate this design, we implement our solution on a real-world system and the experimental results show that node localizability provides useful guidelines for network deployment and other location-based services.
Sufficient conditions, Ad hoc networks, Wireless communication, Wireless sensor networks, Mobile radio mobility management, ad hoc networks., Localization, localizability, graph rigidity, wireless sensor networks
Yunhao Liu, Zheng Yang, "Understanding Node Localizability of Wireless Ad Hoc and Sensor Networks", IEEE Transactions on Mobile Computing, vol. 11, no. , pp. 1249-1260, Aug. 2012, doi:10.1109/TMC.2011.122