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 language | English (US) |
|---|---|
| Pages | 20-30 |
| Number of pages | 11 |
| DOIs | |
| State | Published - 2004 |
| Event | Proceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004 - Tokyo, Japan Duration: May 24 2004 → May 26 2004 |
Other
| Other | Proceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004 |
|---|---|
| Country/Territory | Japan |
| City | Tokyo |
| Period | 5/24/04 → 5/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