This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
December 2002 (vol. 51 no. 12)
pp. 1448-1453

Abstract—We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimensional) of points (coordinates) and use the term target location to refer to the problem of locating a target at a grid point at any instant in time. We first present an integer linear programming (ILP) solution for minimizing the cost of sensors for complete coverage of the sensor field. We solve the ILP model using a representative public-domain solver and present a divide-and-conquer approach for solving large problem instances. We then use the framework of identifying codes to determine sensor placement for unique target location. We provide coding-theoretic bounds on the number of sensors and present methods for determining their placement in the sensor field. We also show that grid-based sensor placement for single targets provides asymptotically complete (unambiguous) location of multiple targets in the grid.

[1] J.M. Kahn, R.H. Katz, and K.S.J. Pister, “Mobile Networking for Smart Dust,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networks, 1999.
[2] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263-270, 1999.
[3] R.R. Brooks and S.S. Iyengar, Multi-Sensor Fusion: Fundamentals and Applications with Software. Upper Saddle River, N.J.: Prentice Hall, 1998.
[4] S.S. Iyengar, L. Prasad, and H. Min, Advances in Distributed Sensor Technology, Prentice-Hall, Englewood Cliffs, N.J., 1995.
[5] N.S.V. Rao, "Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems," IEEE Trans. Computers, vol. 42, no. 4, pp. 447-457, 1993.
[6] T.R.N. Rao and Fujiwara, Error-Coding for Computer Systems.Englewood Cliffs, N.J.: Prentice Hall, 1989.
[7] M. Bae and B. Bose, “Resource Placement in Torus-Based Networks,” IEEE Trans. Computers, vol. 46, no. 10, pp. 1083-1092, Oct. 1997.
[8] N.S.V. Rao, S.S. Iyengar, B.J. Oomen, and R.L. Kashyap, “On Terrain Model Acquisition by a Point Robot Amidst Polyhedral Obstacles,” IEEE J. Robotics and Automation, vol. 4, pp. 450-455, Aug. 1988.
[9] J. O'Rourke, Art Gallery Theorems and Algorithms. New York: Oxford Univ. Press, 1987.
[10] H.P. Williams, Model Building in Mathematical Programming, second ed. New York: John Wiley, 1985.
[11] M. Berkelaar, “lpsolve, version 3.0,” Design Automation Section, Eindhoven Univ. of Technology, Eindhoven, The Netherlands,ftp://ftp.ics.ele.tue.nl/publp_solve, 1999.
[12] M.G. Karpovksy, K. Chakrabarty, and L.B. Levitin, “A New Class of Codes for Covering Vertices in Graphs,” IEEE Trans. Information Theory, vol. 44, pp. 599-611, Mar. 1998.
[13] G.D. Cohen, I. Honkala, S.N. Litsyn, and A. Lobstein, Covering Codes. Amsterdam: North Holland, 1997.

Index Terms:
Covering codes, identifying codes, integer linear programming, optimization, sensor density, sensor field.
Citation:
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hairong Qi, Eungchun Cho, "Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks," IEEE Transactions on Computers, vol. 51, no. 12, pp. 1448-1453, Dec. 2002, doi:10.1109/TC.2002.1146711
Usage of this product signifies your acceptance of the Terms of Use.