A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks

In two-tiered wireless sensor networks (WSNs), relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation algorithm for relay node placement in the WSNs is proposed to offer a major step forward in saving system overhead. In particular, a unique local search approximation algorithm (LSAA) is introduced to solve the relay node single cover (RNSC) problem. In this proposed LSAA approach, the sensor nodes are allocated into groups and then a local set cover (SC) for each group is achieved by a local search algorithm. The union set of all the local SCs constitutes a SC of the RNSC problem. The approximation ratio and the time complexity of the LSAA are analyzed by rigorous proof. In addition, the LSAA approach has been extended to solve the relay node double cover problem. Then, a relay location selection algorithm (RLSA) is proposed to utilize the resulting SC from the LSAA in combining RLSA with the minimum spanning tree heuristic to build the high-tier connectivity. As the RLSA searches for a nearest location to the sink node for each relay node, the high-tier network built by the RLSA becomes denser than that by existing works. As a result, the number of added relay nodes for building the connectivity of the high-tier WSN can be significantly saved. Simulation results clearly demonstrate that the proposed LSAA outperforms the approaches reported in literature and the RLSA-based algorithm can noticeably save relay nodes newly deployed for the high-tier connectivity.

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

[2]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[3]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

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

[5]  Hossam S. Hassanein,et al.  Set-Cover Approximation Algorithms for Load-Aware Readers Placement in RFID Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

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

[7]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[8]  Hossam S. Hassanein,et al.  Transactions Papers - Device Placement for Heterogeneous Wireless Sensor Networks: Minimum Cost with Lifetime Constraints , 2007, IEEE Transactions on Wireless Communications.

[9]  Eytan Modiano,et al.  Construction and Maintenance of Wireless Mobile Backbone Networks , 2009, IEEE/ACM Transactions on Networking.

[10]  Hamid Sharif,et al.  A novel local search approximation algorithm for relay node placement in Wireless Sensor Networks , 2015, 2015 IEEE Wireless Communications and Networking Conference (WCNC).

[11]  Teofilo F. Gonzalez,et al.  Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..

[12]  Jiming Chen,et al.  On Optimal Information Capture by Energy-Constrained Mobile Sensors , 2010, IEEE Transactions on Vehicular Technology.

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

[14]  Erik D. Demaine,et al.  Deploying sensor networks with guaranteed capacity and fault tolerance , 2005, MobiHoc '05.

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

[16]  XueGuoliang,et al.  Relay Node Placement in Wireless Sensor Networks , 2007 .

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

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

[19]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations , 2010, IEEE/ACM Transactions on Networking.

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

[21]  Mohamed F. Younis,et al.  Load-balanced clustering of wireless sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[22]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[23]  Jiming Chen,et al.  Energy-Efficient Capture of Stochastic Events under Periodic Network Coverage and Coordinated Sleep , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

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

[26]  Xi Fang,et al.  Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations , 2012, IEEE Transactions on Mobile Computing.

[27]  Jehoshua Bruck,et al.  A Geometric Theorem for Approximate Disk Covering Algorithms , 2001 .

[28]  P. R. Deshmukh,et al.  Fault-Tolerant Relay Placement in Wireless Sensor Networks Using Particle Swarm Optimization , 2011, SocProS.

[29]  Massimo Franceschetti,et al.  A geometric theorem for network design , 2004, IEEE Transactions on Computers.

[30]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[31]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

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

[33]  Jiming Chen,et al.  Energy-efficient capture of stochastic events by global- and local-periodic network coverage , 2009, MobiHoc '09.

[34]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, J. Glob. Optim..

[35]  Arunita Jaekel,et al.  Design of fault tolerant wireless sensor networks satisfying survivability and lifetime requirements , 2012, Comput. Commun..

[36]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..