Error characteristics of ad hoc positioning systems (APS)

Dragoş Niculescu, Badri Nath

Research output: Contribution to conferencePaperpeer-review

105 Scopus citations

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 characteristics of four classes of multihop APS algorithms under various conditions, using theoretical analysis and simulations. Analysis of range/angle free, range based, angle based, and multimodal algorithms shows a complex tradeoff between the capabilities used, the density of the network, ratio of landmarks, and the quality of the positions obtained.

Original languageEnglish (US)
Pages20-30
Number of pages11
DOIs
StatePublished - 2004
EventProceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004 - Tokyo, Japan
Duration: May 24 2004May 26 2004

Other

OtherProceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004
Country/TerritoryJapan
CityTokyo
Period5/24/045/26/04

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Keywords

  • APS
  • Ad hoc networks
  • Ad hoc positioning system
  • Cramér-Rao lower bound
  • Error analysis
  • Multihop positioning

Fingerprint

Dive into the research topics of 'Error characteristics of ad hoc positioning systems (APS)'. Together they form a unique fingerprint.

Cite this