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

Wireless sensor networks (WSNs) have many applications which operate in hostile environments. Due to the harsh surroundings, WSNs may suffer from a large scale damage that causes many nodes to fail simultaneously and the network to get partitioned into multiple disjoint segments. In such a case, restoring the network connectivity is very important in order to avoid negative effects on the applications. In this paper, we pursue the placement of the least number of relay nodes to re-establish a strongly connected network topology. The problem of finding the minimum count and the position of relay nodes is NP-hard and hence we pursue heuristics. We present a novel three-step algorithm called FeSTA which is based on steinerizing appropriate triangles. Each segment is represented by a terminal. Each subset of 3 terminals forms a triangle. Finding the optimal solution for a triangle (i.e. connecting 3 segments) is a relatively easier problem. In the first step, FeSTA finds the best triangles and form islands of segments by establishing intra-triangle connectivity. Then in the second, disjoint islands of segment are federated. In the final step, the steinerized edges are optimized. The performance of FeSTA is validated through simulation.

[1]  Y.T. Hou,et al.  On energy provisioning and relay node placement for wireless sensor networks , 2005, IEEE Transactions on Wireless Communications.

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

[3]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[4]  Hossam S. Hassanein,et al.  Locally optimal relay node placement in heterogeneous wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[5]  Guoliang Xue,et al.  Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[6]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[7]  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.

[8]  Samir Khuller,et al.  Relay Placement for Higher Order Connectivity in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Mohamed F. Younis,et al.  Optimized relay placement to federate segments in wireless sensor networks , 2010, IEEE Journal on Selected Areas in Communications.

[10]  Hossam S. Hassanein,et al.  On relay node placement and locally optimal traffic allocation in heterogeneous wireless sensor networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[11]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[12]  Samir Khuller,et al.  Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.

[13]  Hai Liu,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks , 2005, COCOON.

[14]  Mohamed F. Younis,et al.  An Efficient Mechanism for Establishing Connectivity in Wireless Sensor and Actor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[15]  Hossam S. Hassanein,et al.  Minimum cost guaranteed lifetime design for heterogeneous wireless sensor networks (WSNs) , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

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

[17]  Xiang Cao,et al.  Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[19]  Wei Ding,et al.  Relay Node Placement in Heterogeneous Wireless Sensor Networks with Basestations , 2009, 2009 WRI International Conference on Communications and Mobile Computing.

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

[21]  Arunabha Sen,et al.  Relay node placement in large scale wireless sensor networks , 2006, Comput. Commun..

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

[23]  Hossam S. Hassanein,et al.  Optimal wireless sensor networks (WSNs) deployment: minimum cost with lifetime constraint , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[24]  Xi Fang,et al.  Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[25]  Hai Liu,et al.  Localized Movement Control for Fault Tolerance of Mobile Robot Networks , 2007, WSAN.

[26]  Krishna M. Sivalingam,et al.  On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks , 2009, Mob. Networks Appl..

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

[28]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[29]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[30]  Mohamed Younis,et al.  A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks , 2007 .

[31]  Joseph S. B. Mitchell,et al.  Improved Approximation Algorithms for Relay Placement , 2008, ESA.

[32]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[34]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[35]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

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

[37]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.