Connectivity-based and anchor-free localization in large-scale 2D/3D sensor networks

Authors:
Guang Tan;Hongbo Jiang;Shengkai Zhang;Zhimeng Yin;Anne-Marie Kermarrec
Affiliations:
SIAT, Chinese Academy of Sciences, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;INRIA/IRISA, Rennes, France
Venue:
ACM Transactions on Sensor Networks (TOSN)
Year:
2013

Citing 8
Cited 0

Localization from mere connectivity

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
MAP: medial axis based geometric routing in sensor networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Boundary recognition in sensor networks by topological methods

Proceedings of the 12th annual international conference on Mobile computing and networking
Beacon vector routing: scalable point-to-point routing in wireless sensornets

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Rendered path: range-free localization in anisotropic sensor networks with holes

IEEE/ACM Transactions on Networking (TON)
Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks

ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A connectivity-based and anchor-free three-dimensional localization (CATL) scheme is presented for large-scale sensor networks with concave regions. It distinguishes itself from previous work with a combination of three features: (1) it works for networks in both 2D and 3D spaces, possibly containing holes or concave regions; (2) it is anchor-free and uses only connectivity information to faithfully recover the original network topology, up to scaling and rotation; (3) it does not depend on the knowledge of network boundaries, which suits it well to situations where boundaries are difficult to identify. The key idea of CATL is to discover the notch nodes, where shortest paths bend and hop-count-based distance starts to significantly deviate from the true Euclidean distance. An iterative protocol is developed that uses a notch-avoiding multilateration mechanism to localize the network. Simulations show that CATL achieves accurate localization results with a moderate per-node message cost.