Providing and finding k-road-coverage efficiently in wireless sensor networks

In this paper, we study k-road-coverage problems in wireless sensor networks (WSNs). Assume there is a 2-dimensional area Ω with a given road map **image**  = (V,E) where E contains all road segments and V consists of all intersection points on Ω. The first question we study is about ‘sensor deployment’, i.e., how to deploy a minimum number of sensor nodes on Ω such that each path (each road segment) on **image** is k-covered when all sensor nodes have the same sensing range. When sensors can only be deployed in a set of discrete locations, we propose an efficient method with the approximation ratio 6 + ϵ for the special case where k = 1 and O(k) generally. If sensors can be deployed in arbitrary locations, we propose an efficient method with the approximation ratio 24 + ϵ when k = 1 and O(k) generally. The second question we study is about ‘path query’, i.e., how to find the k-covered path or k-support path connecting any given source/destination pair of points on the road map **image**. Basically, given any source/destination pair of points S and D, we present two algorithms which can efficiently find a k-covered path connecting S and D and a k-supported path connecting S and D, respectively. Copyright © 2010 John Wiley & Sons, Ltd.

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

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

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

[4]  Matthew J. Katz,et al.  Covering Points by Unit Disks of Fixed Location , 2007, ISAAC.

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

[6]  Weili Wu,et al.  A better constant-factor approximation for weighted dominating set in unit disk graph , 2009, J. Comb. Optim..

[7]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

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

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

[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]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

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

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

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

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

[16]  Esther M. Arkin,et al.  Minimum-cost coverage of point sets by disks , 2006, SCG '06.

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

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

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

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

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