Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility

Authors:
Kemal Akkaya;Fatih Senel;Aravind Thimmapuram;Suleyman Uludag
Affiliations:
Southern Illinois University Carbondale, Carbondale;University of Maryland, Baltimore;Southern Illinois University Carbondale, Carbondale;University of Michigan-Flint, Flint
Venue:
IEEE Transactions on Computers
Year:
2010

Citing 0
Cited 9

Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation

Computer Communications
Localized motion-based connectivity restoration algorithms for wireless sensor and actor networks

Journal of Network and Computer Applications
A least-movement topology repair algorithm for partitioned wireless sensor-actor networks

International Journal of Sensor Networks
An effective approach for tolerating simultaneous failures in wireless sensor and actor networks

Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking
Connectivity restoration in delay-tolerant sensor networks using game theory

International Journal of Ad Hoc and Ubiquitous Computing
Handling large-scale node failures in mobile sensor/robot networks

Journal of Network and Computer Applications
An adaptive connectivity restoration algorithm for wireless sensor and actor networks

International Journal of Autonomous and Adaptive Communications Systems
Network Partitioning Recovery Mechanisms in WSANs: a Survey

Wireless Personal Communications: An International Journal
Survey Topology management techniques for tolerating node failures in wireless sensor networks: A survey

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	14.98

Visualization

Abstract

Mobility has been introduced to sensor networks through the deployment of movable nodes. In movable wireless networks, network connectivity among the nodes is a crucial factor in order to relay data to the sink node, exchange data for collaboration, and perform data aggregation. However, such connectivity can be lost due to a failure of one or more nodes. Even a single node failure may partition the network, and thus, eventually reduce the quality and efficiency of the network operation. To handle this connectivity problem, we present PADRA to detect possible partitions, and then, restore the network connectivity through controlled relocation of movable nodes. The idea is to identify whether or not the failure of a node will cause partitioning in advance in a distributed manner. If a partitioning is to occur, PADRA designates a failure handler to initiate the connectivity restoration process. The overall goal in this process is to localize the scope of the recovery and minimize the overhead imposed on the nodes. We further extend PADRA to handle multiple node failures. The approach, namely, MDAPRA strives to provide a mutual exclusion mechanism in repositioning the nodes to restore connectivity. The effectiveness of the proposed approaches is validated through simulation experiments.