Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to Algorithms
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks
IEEE Transactions on Computers
K-connected target coverage problem in wireless sensor networks
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Coverage-aware connectivity restoration in mobile sensor networks
Journal of Network and Computer Applications
Optimized relay placement to federate segments in wireless sensor networks
IEEE Journal on Selected Areas in Communications
A k-connected energy-saving topology control algorithm for wireless sensor networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Error analysis of range-based localisation algorithms in wireless sensor networks
International Journal of Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In Wireless Sensor-Actor Networks (WSANs), sensors probe their surroundings and send their data to more capable actor nodes. The actors' response requires them to coordinate their operation. Therefore, a strongly connected inter-actor topology is necessary and tolerance of an actor failure becomes a design requirement. Autonomous repositioning of actors has been deemed as an effective recovery strategy. In this paper, we present a distributed network recovery scheme called Least-Movement Topology Repair (LeMoToR). To restore connectivity, LeMoToR relies on the local view of a node about the network and strives to relocate the least number of nodes. It also reduces the total travelled distance and overall inter-node communication complexity. LeMoToR does not impose pre-failure communication overhead and utilises existing path discovery activities in the network to know the structure of the topology. The performance of LeMoToR is validated analytically and through simulation. The validation results demonstrate the effectiveness of LeMoToR.