![](/images/graphics-bg.png)
Geometric Buildup Algorithms for Sensor Network Localization
Joint Authors
Zheng, Zhenzhen
Wu, Zhijun
Luo, Xin-long
Source
Mathematical Problems in Engineering
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-18, 18 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-08-28
Country of Publication
Egypt
No. of Pages
18
Main Subjects
Abstract EN
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 alsoimplemented 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.
American Psychological Association (APA)
Zheng, Zhenzhen& Luo, Xin-long& Wu, Zhijun. 2011. Geometric Buildup Algorithms for Sensor Network Localization. Mathematical Problems in Engineering،Vol. 2012, no. 2012, pp.1-18.
https://search.emarefa.net/detail/BIM-1029846
Modern Language Association (MLA)
Zheng, Zhenzhen…[et al.]. Geometric Buildup Algorithms for Sensor Network Localization. Mathematical Problems in Engineering No. 2012 (2012), pp.1-18.
https://search.emarefa.net/detail/BIM-1029846
American Medical Association (AMA)
Zheng, Zhenzhen& Luo, Xin-long& Wu, Zhijun. Geometric Buildup Algorithms for Sensor Network Localization. Mathematical Problems in Engineering. 2011. Vol. 2012, no. 2012, pp.1-18.
https://search.emarefa.net/detail/BIM-1029846
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1029846