GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless integrated network sensors
Communications of the ACM
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A Bidding Protocol for Deploying Mobile Sensors
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
IEEE Communications Magazine
Node reclamation and replacement for long-lived sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Efficient robot-based energy maintenance in wireless sensor networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
A Comprehensive Review of Sensor Relocation
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Swarm behavior control of mobile multi-robots with wireless sensor networks
Journal of Network and Computer Applications
Mobility-assisted minimum connected cover in a wireless sensor network
Journal of Parallel and Distributed Computing
Energy-aware sensor node relocation in mobile sensor networks
Ad Hoc Networks
Hi-index | 0.24 |
Sensor replacement is important for sensor networks to provide continuous sensing services. Upon sensor node failures, holes (uncovered areas) may appear in the sensing coverage. Existing approaches relocate redundant nodes to fill the holes and require all or most sensor nodes to have mobility. However, mobility equipment is expensive while technology trends are scaling sensors to be smaller and cheaper. In this paper, we propose to use a small number of mobile robots to replace failed sensors for a large-scale static sensor network. We study algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile robots and the messaging overhead incurred to the sensor network. A manager receives failure reports and determines which robot to handle a failure. We study three algorithms: a centralized manager algorithm, a fixed distributed manager algorithm, and a dynamic distributed manager algorithm. Our analysis and simulations show that: (a) the centralized and the dynamic distributed algorithms have lower motion overhead than the fixed distributed algorithm; (b) the centralized algorithm is less scalable than the two distributed manager algorithms, and (c) the two distributed algorithms have higher messaging cost than the centralized algorithm. Hence, the optimal choice of the coordination algorithm depends on the specific scenarios and objectives being optimized.