Abstract
Cooperative localization can enhance the accuracy of wireless network localization by incorporating range information among agent nodes in addition to those between agents and anchors. In this paper, we investigate the optimal allocation of the restricted resources, namely, power and bandwidth, to different nodes. We formulate the optimization problems for both synchronous networks and asynchronous networks, where one way and round trip measurements are applied for range estimation, respectively. Since the optimization problems are nonconvex, we develop an iterative linearization-based technique, and show by comparison with brute-force search that it provides near-optimal performance in the investigated cases. We also show that especially in the case of inefficient anchor placement and/or severe shadowing, cooperation among agents is important and more resources should be allocated to the agents correspondingly.
| Original language | English |
|---|---|
| Article number | 7491311 |
| Pages (from-to) | 6527-6540 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Wireless Communications |
| Volume | 15 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 2016 |
| Externally published | Yes |
Keywords
- Cooperative localization
- optimization
- ranging
- resource allocation
Fingerprint
Dive into the research topics of 'Joint Power and Bandwidth Allocation in Wireless Cooperative Localization Networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver