On relay node placement problem for survivable wireless sensor networks

Wireless sensor networks are widely applied to many fields such as animal habitat monitoring, air traffic control, and health monitoring. One of the current problems with wireless sensor networks is the ability to overcome communication failures due to hardware failure, distributing sensors in an uneven geographic area, or unexpected obstacles between sensors. One common solution to overcome this problem is to place a minimum number of relay nodes among sensors so that the communication among sensors is guaranteed. This is called Relay Node Placement Problem (RNP). This problem has been proved as NP-hard for a simple connected graph. Therefore, many algorithms have been developed based on Steiner graphs. Since RNP for a connected graph is NP-hard, the RNP for a survivable network has been conjectured as NP-hard and the algorithms for a survivable network have also been developed based on Steiner graphs. In this study, we show the new approximation bound for the survivable wireless sensor networks using the Steiner graphs based algorithm. We prove that the approximation bound is guaranteed in an environment where some obstacles are laid, and also propose the newly developed algorithm which places fewer relay nodes than the existing algorithms. Consequently, the main purpose of this study is to find the minimum number of relay nodes in order to meet the survivability requirements of wireless sensor networks.

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

[2]  Yinghua Zhou,et al.  Node Placement in Wireless Sensor Network to Achieve Biconnectivity , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

[3]  Samir Khuller,et al.  Biconnectivity approximations and graph carvings , 1992, STOC '92.

[4]  Suyoung Yoon,et al.  Power Aware Routing Algorithms for Wireless Sensor Networks , 2007, 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07).

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

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

[7]  Dharma P. Agrawal,et al.  Monitoring ambient air quality with carbon monoxide sensor-based wireless network , 2010, Commun. ACM.

[8]  Yacine Challal,et al.  Wireless sensor networks for rehabilitation applications: Challenges and opportunities , 2013, J. Netw. Comput. Appl..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Curt Schurgers,et al.  Sensor platforms for multimodal underwater monitoring , 2012, 2012 International Green Computing Conference (IGCC).

[11]  Chao Wang,et al.  Design and Implementation of Survivable Network Systems , 2005, ICIC.

[12]  Matt Welsh,et al.  Sensor networks for the sciences , 2010, Commun. ACM.

[13]  Nancy R. Mead,et al.  Requirements definition for survivable network systems , 1998, Proceedings of IEEE International Symposium on Requirements Engineering: RE '98.

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

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

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

[17]  Jameela Al-Jaroodi,et al.  Monitoring Underwater PIpelines Using Sensor Networks , 2010, 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC).

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

[19]  Cem Ersoy,et al.  Wireless sensor networks for healthcare: A survey , 2010, Comput. Networks.

[20]  A.-H. Jahangir,et al.  Survivability modeling of wireless sensor networks , 2008, 2008 IEEE International Symposium on Wireless Communication Systems.

[21]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

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

[23]  V. S. Anil Kumar,et al.  Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

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

[25]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[26]  Xiuzhen Cheng,et al.  Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics , 2003, IEEE Trans. Mob. Comput..

[27]  Harold N. Gabow.  A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[28]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

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