Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
SeRLoc: secure range-independent localization for wireless sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Efficient Localization in Mobile Wireless Sensor Networks
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
StarDust: a flexible architecture for passive localization in wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Rendered path: range-free localization in anisotropic sensor networks with holes
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
MSP: multi-sequence positioning of wireless sensor nodes
Proceedings of the 5th international conference on Embedded networked sensor systems
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
| Hi-index | 0.00 |
In wireless sensor networks (WSNs) localization systems are required to provide position information of sensor nodes. Position information of sensor nodes with unknown physical positions is acquired with the help of beacons or anchors. Beacon placement is one of the prominent factors that shape the localization performance in sensor networks. Placing more beacons in a network is generally not a cost-effective idea. However, a carefully designed technique can increase the accuracy by placing a limited number of beacons. This paper presents a requirement based beacon placement algorithm to optimize number of beacons to cover the entire WSN. A novel algorithm for routing towards the mobile sink is also proposed, which utilizes the beacon nodes more than sensor nodes to route data towards a mobile sink. This strategy helps to reduce the energy consumption of the WSN and increase the network lifetime. Simulation result shows that the proposed beacon placement scheme is effective in a sensor network with high node density and also evaluates the proposed routing algorithm.