Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Sink mobility protocols for data collection in wireless sensor networks
Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Data delivery in fragmented wireless sensor networks using mobile agents
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Relay sensor placement in wireless sensor networks
Wireless Networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Relay node placement in large scale wireless sensor networks
Computer Communications
Sink repositioning for enhanced performance in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Localized Algorithm for Restoring Internode Connectivity in Networks of Moveable Sensors
IEEE Transactions on Computers
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
Localized motion-based connectivity restoration algorithms for wireless sensor and actor networks
Journal of Network and Computer Applications
Connectivity restoration in delay-tolerant sensor networks using game theory
International Journal of Ad Hoc and Ubiquitous Computing
On optimal connectivity restoration in segmented sensor networks
EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
Establishing connectivity among disjoint terminals using a mix of stationary and mobile relays
Computer Communications
Network Partitioning Recovery Mechanisms in WSANs: a Survey
Wireless Personal Communications: An International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In some applications, wireless sensor networks (WSNs) operate in very harsh environments and nodes become subject to increased risk of damage. Sometimes a WSN suffers from the simultaneous failure of multiple sensors and gets partitioned into disjoint segments. Restoring network connectivity in such a case is crucial in order to avoid negative effects on the application. Given that WSNs often operate unattended in remote areas, the recovery should be autonomous. This paper promotes an effective strategy for restoring the connectivity among these segments by populating the least number of relay nodes. Finding the optimal count and position of relay nodes is NP-hard and heuristics are thus pursued. We propose a Distributed algorithm for Optimized Relay node placement using Minimum Steiner tree (DORMS). Since in autonomously operating WSNs it is infeasible to perform a network-wide analysis to diagnose where segments are located, DORMS moves relay nodes from each segment toward the center of the deployment area. As soon as those relays become in range of each other, the partitioned segments resume operation. DORMS further model such initial inter-segment topology as Steiner tree in order to minimize the count of required relays. Disengaged relays can return to their respective segments to resume their pre-failure duties. We analyze DORMS mathematically and explain the beneficial aspects of the resulting topology with respect to connectivity, and traffic balance. The performance of DORMS is validated through extensive simulation experiments.