Node placement for target coverage and network connectivity in WSNs with multiple sinks

Target coverage and connectivity are two main challenging and important issues in wireless sensor networks. The former is for providing sufficient monitoring quality where all points of interest in the network are covered by sensor nodes and the latter is for guaranteeing satisfactory communicating capability where all sensors can connect to at least one sink via relay nodes. In this paper, we focus on minimizing the number of nodes (i.e., sensor nodes and relay nodes) to provide target coverage and connectivity in wireless sensor networks with multiple sinks. We formulate the problem as two sub-problems. The first one (named as TC) is for placing sensor nodes to cover all targets and the second one (named as NC) is for placing relay nodes to connect sensor nodes to the sinks. We then propose a heuristic algorithm for the TC problem that exploits clustering technique. We also propose two heuristic algorithms for the NC problem that base on greedy approach and spanning tree. The experiment results show that our protocols can significantly reduce the number of required nodes in comparison with existing protocols.

[1]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[2]  Mihaela Cardei,et al.  Improved sensor network lifetime with multiple mobile sinks , 2009, Pervasive Mob. Comput..

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

[4]  Mihaela Cardei,et al.  Improving network lifetime with mobile wireless sensor networks , 2010, Comput. Commun..

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

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

[7]  Guihai Chen,et al.  A PTAS to minimize mobile sensor movement for target coverage problem , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[8]  José D. P. Rolim,et al.  Biased Sink Mobility with Adaptive Stop Times for Low Latency Data Collection in Sensor Networks , 2009, GLOBECOM.

[9]  Emanuel Melachrinoudis,et al.  Controlled sink mobility for prolonging wireless sensor networks lifetime , 2008, Wirel. Networks.

[10]  Mohamed F. Younis,et al.  Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation , 2011, Comput. Commun..

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

[12]  Fazel Naghdy,et al.  An Energy-Efficient Mobile-Sink Path Selection Strategy for Wireless Sensor Networks , 2014, IEEE Transactions on Vehicular Technology.

[13]  Mubashir Husain Rehmani,et al.  An efficient trajectory design for mobile sink in a wireless sensor network , 2014, Comput. Electr. Eng..