Connectivity Restoration in Wireless Sensor Networks Using Steiner Tree Approximations

Wireless sensor nodes are symbiotic when deployed in an activity region and heavily rely on each other for successful transmission of data. Therefore, failure of some nodes can possibly partition the network. Since these networks often operate unattended, nodes need to collectively maintain connectivity and resolve any reachability problem. Most published approaches for restoring connectivity are based on a single underlying principle of replacing the failed node without considering the possible fact that the location of the failed node could have been the reason for its failure. These approaches also tend to trigger a cascaded relocation of many nodes resulting in increased overhead. This paper presents a novel solution that pursues rearrangement of nodes while limiting the scope of the recovery to the vicinity of the failed node. The connectivity restoration is modeled as a variant of the Steiner tree formation problem and solved using novel heuristics. The proposed approach is validated through simulation.

[1]  Thomas F. La Porta,et al.  Sensor relocation in mobile sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Mohamed F. Younis,et al.  Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.

[4]  Ameer Ahmed Abbasi,et al.  Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[5]  Kemal Akkaya,et al.  Distributed Recovery of Actor Failures in Wireless Sensor and Actor Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[6]  Alex Zelikovsky,et al.  Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[7]  Kemal Akkaya,et al.  Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility , 2010, IEEE Transactions on Computers.

[8]  Mohamed F. Younis,et al.  A Localized Self-Healing Algorithm for Networks of Moveable Sensor Nodes , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[9]  Lusheng Wang,et al.  An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane , 2002, Inf. Process. Lett..

[10]  Prithwish Basu,et al.  Movement control algorithms for realization of fault-tolerant ad hoc robot networks , 2004, IEEE Network.

[11]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.