Evaluating coverage quality through best covered pathes in wireless sensor networks

Coverage quality is one critical metric to evaluate the Quality of Service (QoS) provided by wireless sensor net works. In this paper, we address maximum support coverage problem (a.k.a. best case coverage) in wireless sensor networks. Most of the existing work assume that the coverage degree is 1, i.e. every point on the resultant path should fall within the sensing range of at least one sensor node. Here we study the k -coverage problem, in which every point on the resultant path is covered by at least k sensors while optimizing certain objectives. We present tackle this problem under both centralized and distributed setting. The time complexity is bounded by O(k2n log n) where n is the number of deployed sensor nodes. To the best of our knowledge, this is the first work that presents polynomial time algorithms that find optimal k-support paths for a general k.

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

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

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

[4]  Shaojie Tang,et al.  Optimal k-support coverage paths in wireless sensor networks , 2009, 2009 IEEE International Conference on Pervasive Computing and Communications.

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

[6]  Der-Tsai Lee.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

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

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

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

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

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

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

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

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

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

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

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

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