Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
ASCENT: Adaptive Self-Configuring sEnsor Network Topologies
ACM SIGCOMM Computer Communication Review
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Intelligent fluid infrastructure for embedded networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
ASFALT: A Simple Fault-Tolerant Signature-based Localization Technique for Emergency Sensor Networks
SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
A fault tolerant and energy efficient routing protocol for urban sensor networks
Proceedings of the 2nd international conference on Scalable information systems
Coverage and latency aware actor placement mechanisms in WSANs
International Journal of Sensor Networks
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Relay node placement in large scale wireless sensor networks
Computer Communications
IEEE Transactions on Computers
Coverage-aware connectivity restoration in mobile sensor networks
Journal of Network and Computer Applications
An Efficient Algorithm for Cut Vertex Detection in Wireless Sensor Networks
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Simple movement control algorithm for bi-connectivity in robotic sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
RAGOBOT: a new platform for wireless mobile sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Connectivity restoration in delay-tolerant sensor networks using game theory
International Journal of Ad Hoc and Ubiquitous Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In Wireless Sensor Networks (WSNs), maintaining connectivity with the sink node is a crucial issue to collect data from sensors without any interruption. While sensors are typically deployed in abundance to tolerate possible node failures, a large number of simultaneous node failures within the same region may result in partitioning the network which may disrupt the network operation significantly. Given that WSNs are deployed in inhospitable environments, such node failures are very likely due to storms, fires, floods, etc. The self-recovery of the network from these large-scale node failures is challenging since the nodes will not have any information about the location and span of the damage. In this paper, we first present a distributed partition detection algorithm which quickly makes the sensors aware of the partitioning in the network. This process is led by the sensors whose upstream nodes fail due to damages. Upon partition detection, sensors federate the partitions and restore data communication by utilizing the former routing information stored at each sensor to the sink node and exploiting sensor mobility. Specifically, the locations of failed sensors on former routes are used to assess the span of the damage and some of the sensors are relocated to such locations to re-establish the routes with the sink node. Relocation on such former routes is performed in such a way that the movement overhead on sensors is also minimized. Our proposed approach solely depends on the local information to ensure autonomicity, timeliness and scalability. The effectiveness of the proposed federation approach is validated through realistic simulation experiments and has been shown to provide the mentioned features.