A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks

This paper presents a new coverage formulation addressing the quality of service of sensor networks that cooperatively detect targets traversing a region of interest. The problem of track coverage consists of finding the positions of n sensors such that a Lebesgue measure on the set of tracks detected by at least k sensors is optimized. This paper studies the geometric properties of the network, addressing a deterministic track-coverage formulation and binary sensor models. It is shown that the tracks detected by a network of heterogeneous omnidirectional sensors are the geometric transversals of non-translates families of circles. A novel methodology based on cone theory is presented for representing and measuring sets of transversals in closed-form. Then, the solution of the track-coverage problem can be formulated as a nonlinear program (NLP). The numerical results show that this approach can improve track coverage by up to two orders of magnitude compared to grid and random deployments. Also, it can be used to reduce the number of sensors required to achieve a desired detection performance by up to 50%, and to optimally replenish or reposition existing sensor networks.

[1]  Cumulative detection probabilities for a randomly moving source in a sparse field of sensors , 1989, Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989..

[2]  M. Buehler,et al.  Dynamic object localization via a proximity sensor network , 1996, 1996 IEEE/SICE/RSJ International Conference on Multisensor Fusion and Integration for Intelligent Systems (Cat. No.96TH8242).

[3]  R. Pollack,et al.  Geometric Transversal Theory , 1993 .

[4]  Yu-Chee Tseng,et al.  Location Tracking in a Wireless Sensor Network by Mobile Agents and Its Data Fusion Strategies , 2003, Comput. J..

[5]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[6]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[7]  Alhussein A. Abouzeid,et al.  Coverage by directional sensors in randomly deployed wireless sensor networks , 2006, J. Comb. Optim..

[8]  E. Helly.  Über Mengen konvexer Körper mit gemeinschaftlichen Punkte. , 1923 .

[9]  Rephael Wenger,et al.  Stabbing pairwise disjoint translates in linear time , 1989, SCG '89.

[10]  Thomas A. Wettergren.  Statistical Analysis of Detection Performance for Large Distributed Sensor Systems , 2003 .

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

[12]  David S Hammond.  Sonobuoy Field Drift Prediction , 2005 .

[13]  W. Ridley.  Automation of buoy positioning , 1985, OCEANS '85 - Ocean Engineering and the Environment.

[14]  DAVID G. KENDALL,et al.  Introduction to Mathematical Statistics , 1947, Nature.

[15]  Herbert Edelsbrunner.  Finding Transversals for Sets of Simple Geometric Figures , 1985, Theor. Comput. Sci..

[16]  T. Shermer.  Recent Results in Art Galleries , 1992 .

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

[18]  Krishnendu Chakrabarty,et al.  A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks , 2005, IEEE Transactions on Computers.

[19]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[20]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[21]  J. A. George,et al.  Packing different-sized circles into a rectangular container , 1995 .

[22]  Anil V. Rao,et al.  Optimal Control of an Underwater Sensor Network for Cooperative Target Tracking , 2009, IEEE Journal of Oceanic Engineering.

[23]  B. O. Koopman.  Search and Screening: General Principles and Historical Applications , 1980 .

[24]  Mikhail J. Atallah,et al.  Efficient Algorithms for Common Transversals , 1987, Inf. Process. Lett..

[25]  Sulema Aranda,et al.  On Optimal Sensor Placement and Motion Coordination for Target Tracking , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[26]  Y. Li,et al.  Greedy algorithms for packing unequal circles into a rectangular container , 2005, J. Oper. Res. Soc..

[27]  Qingfeng Huang.  Solving an Open Sensor Exposure Problem using Variational Calculus , 2003 .

[28]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[29]  S. Sitharama Iyengar,et al.  Distributed Sensor Networks — a Review of Recent Research , 2001, J. Frankl. Inst..

[30]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .

[31]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[32]  R.L. Streit,et al.  Tracking with distributed sets of proximity sensors using geometric invariants , 2004, IEEE Transactions on Aerospace and Electronic Systems.

[33]  A. Banerjee.  Convex Analysis and Optimization , 2006 .

[34]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[35]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[36]  S. Sitharama Iyengar,et al.  Special issue introduction--the road map for distributed sensor networks in the context of computing and communication , 2004, J. Parallel Distributed Comput..

[37]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[38]  Steven Skiena.  Combinatorics and Graph Theory with Mathematica , 1990 .

[39]  David Avis,et al.  Lower Bounds for Line Stabbing , 1989, Inf. Process. Lett..

[40]  L.M. Kaplan,et al.  Global node selection for localization in a distributed sensor network , 2006, IEEE Transactions on Aerospace and Electronic Systems.

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

[42]  Pramod K. Varshney,et al.  Energy-efficient deployment of Intelligent Mobile sensor networks , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[43]  Nirwan Ansari,et al.  Adaptive decision fusion for unequiprobable sources , 1997 .

[44]  Parameswaran Ramanathan,et al.  Sensor Deployment Strategy for Detection of Targets Traversing a Region , 2003, Mob. Networks Appl..

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

[46]  S. Ferrari.  Track coverage in sensor networks , 2006, 2006 American Control Conference.

[47]  Kenneth Falconer,et al.  Unsolved Problems In Geometry , 1991 .

[48]  Arnold L. Rosenberg,et al.  Stabbing line segments , 1982, BIT.

[49]  Sampath Kannan,et al.  Sampling based sensor-network deployment , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[50]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

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

[52]  J.-P. Le Cadre,et al.  Searching tracks , 2000 .

[53]  Kelli A. Crews Baumgartner,et al.  Control and Optimization of Track Coverage in Underwater Sensor Networks , 2007 .

[54]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .