@inproceedings{816753fdfbad4ba0b2a433b694069cfe,
title = "Localization in sparse networks using Sweeps",
abstract = "Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density higher than required for unique localizability. In this paper, we describe a class of algorithms for fine-grained localization called Sweeps. Sweeps correctly finitely localizes all nodes in bilateration networks. Sweeps also handles angle measurements and noisy measurements. We demonstrate the practicality of our algorithm through extensive simulations on a large number of networks, upon which it consistently localizes one-thousand-node networks of average degree less than five in less than two minutes on a consumer PC.",
keywords = "Controlled mobility, Global rigidity, Localization, Sweeps",
author = "Goldenberg, {David K.} and Pascal Bihler and Ming Cao and Jia Fang and Anderson, {Brian D.O.} and Morse, {A. Stephen} and Yang, {Y. Richard}",
year = "2006",
doi = "10.1145/1161089.1161103",
language = "English",
isbn = "1595932860",
series = "Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM",
publisher = "Association for Computing Machinery",
pages = "110--121",
booktitle = "Proceedings of the Twelfth Annual International Conference on Mobile Computing and Networking, MOBICOM 2006",
note = "12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006 ; Conference date: 24-09-2006 Through 29-09-2006",
}