Achieving optimal data storage position in wireless sensor networks
Computer Communications
Mobile element assisted cooperative localization for wireless sensor networks with obstacles
IEEE Transactions on Wireless Communications
Four-mobile-beacon assisted localization in three-dimensional wireless sensor networks
Computers and Electrical Engineering
Toward collinearity-aware and conflict-friendly localization for wireless sensor networks
Computer Communications
Wireless Communications & Mobile Computing
Robust localization against outliers in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
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.