Optimal k-support coverage paths in wireless sensor networks

Coverage is a fundamental problem in wireless sensor networks since sensors may be spread in arbitrary manner. In this paper, we addressed the k-support coverage problem. Most of the existing works assume that the coverage degree is 1, i.e. every point in a certain path falls within the sensing range of at least one sensor node. In this work, we focus on the case when we require that every point on the path is covered by at least k sensors, while optimizing certain objectives. We give an optimal polynomial-time algorithm and prove that the time complexity of our algorithm is O(k2n2). To the best of our knowledge, this is the first polynomial time algorithm finding an optimum k-coverage path in sensor networks with general sensing radius and general k.

[1]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[2]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[3]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[4]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[5]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Sven Skyum,et al.  A Sweepline Algorithm for Generalized Delaunay Triangulations , 1991 .

[7]  WanPeng-Jun,et al.  Coverage by randomly deployed wireless sensor networks , 2006 .

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

[9]  Chor Ping Low,et al.  Redundant Coverage in Wireless Sensor Networks , 2007, 2007 IEEE International Conference on Communications.

[10]  TsengYu-Chee,et al.  The coverage problem in a wireless sensor network , 2005 .

[11]  Yu-Chee Tseng,et al.  The Coverage Problem in Three-Dimensional Wireless Sensor Networks , 2007, J. Interconnect. Networks.

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

[13]  Hong Li,et al.  Coverage and Exposure Paths in Wireless Sensor Networks , 2006, Journal of Computer Science and Technology.

[14]  Lan Lin,et al.  Optimal coverage paths in ad-hoc sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[15]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[16]  József Balogh,et al.  On k−coverage in a mostly sleeping sensor network , 2008, Wirel. Networks.

[17]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[18]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.

[19]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.