Finding Best and Worst k-Coverage Paths in Multihop Wireless Sensor Networks

Coverage is a fundamental problem in wireless sensor networks (WSNs). From both economic and applicable concerns, designers always would like to provide guaranteed QoS of coverage of WSNs. In this paper, we address two path-coverage problems in WSNs, maximum k-support path coverage (a.k.a. best case coverage) and minimum k-breach path coverage (a.k.a. worst case coverage), in which every point on the desired resultant path is covered by at least k sensors simultaneously while optimizing certain objectives. We present two polynomial-time approaches to find optimal solutions for both maximum k-support coverage problem and minimum k-breach coverage problem. The time complexity of both algorithms are O(k2n log n), where n is the number of deployed sensor nodes and k is the coverage degree. In addition, a number of properties of kth-nearest point Voronoi diagram are presented, which is new to the literature.

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

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

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

[4]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[5]  Shaojie Tang,et al.  Evaluating coverage quality through best covered pathes in wireless sensor networks , 2011, 2011 IEEE Nineteenth IEEE International Workshop on Quality of Service.

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

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

[8]  Peng-Jun Wan,et al.  Coverage by randomly deployed wireless sensor networks , 2005, IEEE Transactions on Information Theory.

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

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

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

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

[13]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[14]  Shan Zhu,et al.  A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks , 1998, IEEE Trans. Parallel Distributed Syst..

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

[16]  M. Satyanarayanan,et al.  Mobile computing , 1993, Computer.

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

[18]  Yu-Chee Tseng,et al.  The coverage problem in three-dimensional wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..