Abstract
We present an algorithm for achieving robust and reasonably accurate localization in a randomly placed wireless sensor network, without the use of global control, globally-accessible beacon signals, or accurate estimates of inter-sensor distances. We present theoretical analysis, simulation results and recent experimental results. The theoretical analysis shows that there is a critical minimum average neighborhood size of 15 for good accuracy, and simulation results show that position accuracy to within 20% of the local radio range can be achieved, even with upto 10% variation in the radio ranges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Bahl and V.N. Padmanabhan, RADAR: An in-building RF-based user location and tracking system, in: Proc. INFOCOM 2000, 2000, pp. 775–784.
W. Butera, Programming a paintable computer, Ph.D. thesis, MIT Media Lab. (2002).
U.W. Corporation, http://www.uswcorp.com/USWCMainPages/our.htm.
L. Doherty, L.E. Ghaoui and K.S.J. Pister, Convex position estimation in wireless sensor networks, in: Proc. INFOCOM2001, 2001.
J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler and K. Pister, System architecture directions for networked sensors, in: Proc. of Conf. on Architectural Support for Programming Languages and Operating Systems IX (ASPLOS-IX), 2000.
B. Hofmann-Wellenhoff, H. Lichtennegger and J. Collins, Global Positioning System: Theory and Practice, 4th ed. (Springer, Berlin, 1997).
L. Kleinrock and J. Silvester, Optimum tranmission radii for packet radio networks or why six is a magic number, in: Proc. of National Telecommunication Conf., 1978, pp. 4.3.1–4.3.5.
N. Lynch, Distributed Algorithms (Morgan Kaufmann, Wonderland, 1996).
M. Maroti, Acoustic ranging on MICA2's, Private communication (2003).
J.D. McLurkin, Algorithms for distributed sensor networks, Master's thesis, UCB (1999).
W. Mendenhall, D. Wackerly and R. Scheaffer, Mathematical Statistics with Applications (PWS, Boston/Kent, 1989).
R. Nagpal, Organizing a global coordinate system from local information on an amorphous computer, AI Memo 1666, MIT (1999).
D. Niculescu and B. Nath, DV based positioning in ad hoc networks, Telecommunication Systems 22(1) (2003) 267–280.
Philips, Shivendra, Panwar and Tatami, Connectivity properties of a packet radio network model, IEEE Transactions on Information Theory 35(5) (1998) 1044–1047.
N.B. Priyantha, A. Chakraborty and H. Balakrishnan, The cricket location-support system, in: Proc. of MOBICOM 2000, 2000, pp. 32–43.
A. Savvides, C. Han and M. Strivastava, Dynamic fine-grained localization in ad-hoc networks of sensors, in: Proceedings of ACM SIGMOBILE, 2001, pp. 166–179.
C. Whitehouse, The design of Calamari: An ad-hoc localization system for sensor networks, Master's thesis, University of California at Berkeley (2002).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bachrach, J., Nagpal, R., Salib, M. et al. Experimental Results for and Theoretical Analysis of a Self-Organizing Global Coordinate System for Ad Hoc Sensor Networks. Telecommunication Systems 26, 213–233 (2004). https://doi.org/10.1023/B:TELS.0000029040.85449.7b
Issue Date:
DOI: https://doi.org/10.1023/B:TELS.0000029040.85449.7b