Abstract
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire their position knowledge either from GPS devices or by virtue of being manually placed. In this paper, we propose a distributed method to localization of sensor nodes using a single moving beacon where sensor nodes compute their position estimate based on the range-free technique. Critical to the location accuracy of sensor nodes are two parameters, the radio transmission range of the beacon, and how often the beacon broadcasts its position. Theoretical analysis shows that these two parameters determine the upper bound of the estimation error when the traverse route of the beacon is a straight line. We extend the position estimate when the traverse route of the beacon is randomly chosen in the real-world situation. To minimize estimation errors, sensor nodes can carry out a variety of algorithms in accordance with the movement of the beacon. Simulation results compare variants of the distributed method in a variety of testing environments. Real experiments show that the proposed method is feasible and can estimate the location of sensor nodes accurately given a single moving beacon.
Original language | English |
---|---|
Pages (from-to) | 587-600 |
Number of pages | 14 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Volume | 19 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 May 2008 |
Keywords
- Distributed localization
- Moving beacon
- Radio irregularity
- Range-free
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics