Subscribe

Issue No.08 - August (2008 vol.57)

pp: 1113-1128

Kelli Baumgartner , Duke University, Durham

Silvia Ferrari , Duke University Duke University, Durham Durham

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.56

ABSTRACT

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.

INDEX TERMS

Sensors, Remote sensing, Geometrical problems and computations, Nonlinear programming, Wireless sensor networks

CITATION

Kelli Baumgartner, Silvia Ferrari, "A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks",

*IEEE Transactions on Computers*, vol.57, no. 8, pp. 1113-1128, August 2008, doi:10.1109/TC.2008.56REFERENCES

- [8] V. Isler, S. Khanna, and K. Daniilidis, “Sampling Based Sensor-Network Deployment,”
Proc. IEEE/RSJ Int'l Conf. Intelligent Robots and Systems), vol. 100, pp. 1780-1785, 2004.- [9] L. Benyuan and D. Towsley, “A Study of the Coverage of Large-Scale Sensor Networks,”
Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, pp. 475-483, 2004.- [14] M. Marengoni, B.A. Draper, A. Hanson, and R.A. Sitaraman, “System to Place Observers on a Polyhedral Terrain in Polynomial Time,”
Image and Vision Computing, vol. 18, pp. 773-780, 1996.- [15] J. O'Rourke,
Art Gallery Theorems and Algorithms. Oxford Univ. Press, 1987.- [16] T.A. Wettergren, “Statistical Analysis of Detection Performance for Large Distributed Sensor Systems,” Technical Report ADA417136, Naval Undersea Warfare Center, http:/stinet.dtic. mil, 2008.
- [19] B. Koopman,
Search and Screening: General Principles with Historical Applications. Pergamon Press, 1980.- [21] J. Goodman, R. Pollack, and R. Wenger, “Geometric Transversal Theory,”
New Trends in Discrete and Computational Geometry, J.Pach, ed., pp. 163-198, Springer Verlag, 1991.- [22] S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak, “Exposure in Wireless Ad-Hoc Sensor Networks,”
Mobile Computing and Networking, pp. 139-150, 2001.- [23] Q. Huang, “Solving an Open Sensor-Exposure Problem Using Variational Calculus,” Technical Report WUCS-03-1, Washington Univ., http://www.cs.wustl.edu/qingfeng/papersExposureTR Short.pdf , 2003.
- [24] T. Clouqueur, V. Phipatanasuphorn, P. Ramanathan, and K. Saluja, “Sensor Deployment for Detection of Targets Traversing a Region,”
Mobile Networks and Applications, vol. 8, pp. 453-461, Aug. 2003.- [25] E. Helly, “Über Mengen Konvexer Körper mit Gemeinschaftlichen Punkten,”
Jahresbericht der Deutschen MathematikerVereiningung, vol. 32, pp. 175-176, 1923.- [32] D.P. Bertsekas,
Convex Analysis and Optimization. Athena Scientific, 2003.- [33] H.F. Davis and A.D. Snider,
Vector Analysis. William C. Brown, 1987.- [34] S. Skiena, “Generating $k\hbox{-}{\rm Subsets}$ ,”
Implementing Discrete Math.: Combinatorics and Graph Theory with Mathematica, pp. 44-46, Addison-Wesley, 1990.- [36] S. Ross,
Introduction to Stochastic Dynamic Programming. Academic Press, 1983.- [37] H.T. Croft, K.J. Falconer, and R.K. Guy,
Unsolved Problems in Geometry. Springer-Verlag, 1991.- [38] D.P. Bertsekas,
Nonlinear Programming. Athena Scientific, 2007.- [39] M.S. Bazaraa, H.D. Sherali, and C.M. Shetty,
Nonlinear Programming: Theory and Algorithms. Wiley Interscience, 2006.- [41] Mathworks,
Matlab Optimization Toolbox, http:/www. mathworks.com, function: fmincon, 2004.- [42] D. Hammond, “Sonobuoy Field Drift Prediction,” “Naval Air Warfare Center Aircraft Division,” Technical Report A115034, Patuxent River, Md., http://www.stormingmedia.us/11/1150A115034.html , 2008.
- [43] G.J. Juselis, “Station Keeping Buoy System,” Secretary of the Navy Patent number: 5577942, http://www.google.compatents?id= tMwhAAAAEBAJ , 1996.
- [46] K.A.C. Baumgartner, “Control and Optimization of Track Coverage in Underwater Sensor Networks,” PhD thesis, Duke Univ., Dec. 2007.
- [47] R.V. Hogg, J.W. McKean, and A.T. Craig,
Introduction to Mathematical Statistics. Prentice Hall, 2005. |