ACM Home Page
Please provide us with feedback. Feedback
Error characteristics of ad hoc positioning systems (aps)
Full text PdfPdf (279 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing table of contents
Roppongi Hills, Tokyo, Japan
SESSION: Geometry and positioning table of contents
Pages: 20 - 30  
Year of Publication: 2004
ISBN:1-58113-849-0
Authors
Dragoş Niculescu  Rutgers University, Piscataway, NJ
Badri Nath  Rutgers University, Piscataway, NJ
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/989459.989463
What is a DOI?

ABSTRACT

APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the nodes in the network are assumed to have the possibility of measuring: range, angle of arrival (AOA), orientation, or a combination of them. We give a lower bound for positioning error in a multihop network for a range/angle free algorithm, and examine the error characteristic of four classes of multihop APS algorithms under various condition, using theoretical analysis and simulations. Analysis of range/angle free, range based, angle based, and multimodal algorithms show a complex tradeoff between the capabilities used, the density of the network, ratio of landmarks, and the quality of the position obtained.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
G. Finn. Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI Research Report ISI/RR-87-180, University of Southern California, March 1987.
2
3
4
5
 
6
Nirupama Bulusu, John Heidemann, and Deborah Estrin. GPS-less low cost outdoor localization for very small devices. In IEEE Personal Communications Magazine, Special Issue on Smart Spaces and Environments. October 2000.
 
7
Paramvir Bahl and Venkata N. Padmanabhan. RADAR: An in-building RF-based user location and tracking system. In INFOCOM, Tel Aviv, Israel, March 2000.
8
9
 
10
Dragoş Niculescu and Badri Nath. DV based positioning in ad hoc networks. Telecommunication Systems, Kluwer, 22(1-4):267--280, January-April 2003.
 
11
Dragoş Niculescu and Badri Nath. Ad hoc positioning system (APS) using AoA. In INFOCOM, San Francisco, CA, April 2003.
 
12
Dragoş Niculescu and Badri Nath. Position and orientation in ad hoc networks. Elsevier Ad Hoc Networks, 2003. to appear.
 
13
Radhika Nagpal. Organizing a global coordinate system from local information on an amorphous computer. Technical Report 1666, MIT AI Lab, 1999.
14
 
15
Koen Langendoen and Niels Reijers. Distributed localization in wireless sensor networks a quantitative comparison. Technical Report PDS-2002-3, Delft University of Technology, The Netherlands, 2002.
 
16
B.W. Parkinson and J.J. Spilker. Global Positioning System: Theory and Application. American Institute of Astronautics and Aeronautics, 1996.
17
 
18
Leonard Kleinrock and John Silvester. Optimum transmission radii for packet radio networks or why six is a magic number. In IEEE National Telecommunications Conference, pages 4.3.1--4.3.5, Birmingham, Alabama, 1978.
 
19
T.K. Philips, S.S. Panwar, and A.N. Tantawi. Connectivity properties of a packet radio network model. In IEEE Transactions on Information Theory, volume 35, pages 1044--1047, September 1989.
 
20
L. Doherty, L. E. Ghaoui, and K. S. J. Pister. Convex position estimation in wireless sensor networks. In IEEE INFOCOM, Anchorage, AK, April 2001.
21
 
22
Slobodan Simić and Shankar Sastry. A distributed algorithm for localization in random wireless networks. Technical report, UC Berkeley, EECS, 2002.
 
23
A. Savvides, W. Garber, S. Adlakha, R. Moses, and M. B. Srivastava. On the error characteristics of multihop node localization in ad-hoc sensor networks. In IPSN03, International Workshop on Information Processing in Sensor Networks, PARC, Palo Alto, CA, April 22-23 2003.
 
24
R. Moses, D. Krishnamurthy, and R. Patterson. A self-localization method for wireless sensor networks. Eurasip Journal on Applied Signal Processing, Special Issue on Sensor Networks, 2002.
 
25
 
26
Y. T. Chan and K. C. Ho. A simple and efficient estimator for hyperbolic location. IEEE Transactions on Signal Processing, 42(8):1905--1915, August 1994.

CITED BY  24
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Dragoş Niculescu: colleagues
Badri Nath: colleagues

Peer to Peer - Readers of this Article have also read: