Localization in sparse networks using sweeps

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. Categories and Subject Descriptors: C.2.1 [Computer Communication Networks]: Network Architecture and Design – Wireless communication; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms: Algorithms, Performance, Design.

• Type: Conference
• Year: 2006
• Where: MOBICOM
• Authors: David Kiyoshi Goldenberg, Pascal Bihler, Yang Richard Yang, Ming Cao, Jia Fang, A. Stephen Morse, Brian D. O. Anderson
• Keywords: Algorithms, Algorithms Lack Correctness, Localization Called Sweeps, MOBICOM 2006