Geometric Buildup Algorithms for Sensor Network Localization

Mathematical Problems in Engineering. 2012;2012 DOI 10.1155/2012/927031


Journal Homepage

Journal Title: Mathematical Problems in Engineering

ISSN: 1024-123X (Print); 1563-5147 (Online)

Publisher: Hindawi Limited

LCC Subject Category: Technology: Engineering (General). Civil engineering (General) | Science: Mathematics

Country of publisher: United Kingdom

Language of fulltext: English

Full-text formats available: PDF, HTML, ePUB, XML



Zhenzhen Zheng (Department of Mathematics, University of California, Irvine, CA 92697, USA)
Xinlong Luo (School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
Zhijun Wu (Department of Mathematics, Iowa State University, Ames, IA 50011, USA)


Blind peer review

Editorial Board

Instructions for authors

Time From Submission to Publication: 26 weeks


Abstract | Full Text

We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed in n steps if n sensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.