Connected K-target coverage problem in wireless sensor networks with different observation scenarios

In this paper, we consider the problem of scheduling sensor activities to maximize network lifetime while maintaining both discrete K-target coverage and network connectivity. In K-target coverage, it is required that each target should be simultaneously observed by at least K sensors. The data generated by the sensors will be transmitted to the sink node via single or multiple hop communications. As maintaining discrete target coverage cannot guarantee the network connectivity, we consider both target coverage and connectivity issues. Further, by adopting a more realistic energy consumption model, we consider the sensor activity scheduling problem and routing problem jointly. We study the problem with two observation scenarios depending on whether a sensor can distinguish the targets in its sensing area or not. For the first scenario, a more general scenario where each sensor can simultaneously observe multiple targets is considered and we develop a polynomial-time algorithm which can achieve optimal solution based on linear programming and integer theorem. For the second scenario, we show that the problem is NP-complete and develop an approximation algorithm for solving it. As the protocol cost of the optimal solution and the approximation algorithm may be high in practice, we develop a low-cost heuristic algorithm which can be implemented in a distributed fashion for both scenarios. We demonstrate the effectiveness of the heuristic algorithm through extensive simulations.

[1]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[2]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[3]  Piotr Berman,et al.  Power efficient monitoring management in sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[4]  James Llinas,et al.  Handbook of Multisensor Data Fusion , 2001 .

[5]  Sandeep S. Kulkarni,et al.  pCover: Partial Coverage for Long-Lived Surveillance Sensor Networks , 2005 .

[6]  Hai Liu,et al.  Maximal lifetime scheduling for K to 1 sensor-target surveillance networks , 2006, Comput. Networks.

[7]  Joongseok Park,et al.  Maximum Lifetime Routing In Wireless Sensor Networks ∗ , 2005 .

[8]  Jie Wu,et al.  Energy-efficient connected coverage of discrete targets in wireless sensor networks , 2009, Int. J. Ad Hoc Ubiquitous Comput..

[9]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[10]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Jie Wu,et al.  Energy-efficient coverage problems in wireless ad-hoc sensor networks , 2006, Comput. Commun..

[12]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[13]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[15]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[16]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[19]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[20]  Bhaskar Krishnamachari,et al.  Maximizing Data Extraction in Energy-Limited Sensor Networks , 2005, Int. J. Distributed Sens. Networks.

[21]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[22]  Weifa Liang,et al.  Approximate coverage in wireless sensor networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[23]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[24]  M. Gurusamy,et al.  Lifetime maximization using observation time scheduling in multi-hop sensor networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[25]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[26]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[27]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

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

[29]  Hai Liu,et al.  Maximal lifetime scheduling in sensor surveillance networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[30]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[31]  Jie Wu,et al.  Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[32]  Anantha Chandrakasan,et al.  Bounding the lifetime of sensor networks via optimal role assignments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.