Minimal sensor integrity: Measuring the vulnerability of sensor grids

Information Processing Letters

Volumn 86, Issue 1, 2003, Pages 49-55

  Kannan, Rajgopal ^a   Sarangi, S ^b   Ray, Sibabrata ^c   Iyengar, S S ^a  

^a Louisiana State University   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c Department of Computer Science   (United States)

Author keywords

Game theory; Graph algorithms; Sensor integrity; Sensor networks

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SIMULATION; GAME THEORY; GRAPH THEORY; PROBLEM SOLVING; REAL TIME SYSTEMS; SENSORS;

SENSOR INTEGRITY;

COMPUTER NETWORKS;

EID: 0037447612     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00450-7     Document Type: Article

References (11)

1. Ahuja R., Magnanti T., Orlin J. Network Flows: Theory. Algorithms and Applications: 1993;Prentice-Hall, New York.
2. R.R. Brooks, C. Griffin, D. Friedlander, Self-organized distributed sensor network entity tracking, Internat. J. High-Performance Comput. Appl., to appear.
3. K. Chakrabarty, S.S. Iyengar, H. Qi, E.C. Cho, Optimal sensor deployment algorithms for surveillance and target location, IEEE Trans. Comput., to appear.
4. M. Chu, H. Haussecker, F. Zhao, Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks, Xerox PARC Technical Report P2001-10113, July 2001.
5. Estrin D., Govindan R., Heidemann J., Kumar S. Next century challenges: scalable coordination in sensor networks. Proc. ACM/IEEE International Conference on Mobile Computing and Networks. 1999.
6. Fowler R., Paterson M., Tanimoto S. Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett. 12:(3):1981;133-137.
7. Gonzalez T. Covering a set of points in multidimensional space. Inform. Process. Lett. 40:1991;181-188.
8. Iyengar S.S., Prasad L., Min H. Advances in Distributed Sensor Technology. 1995;Prentice-Hall, Englewood Cliffs, NJ.
9. Kahn J.M., Katz R.H., Pister K.S. Mobile networking for smart dust. ACM/IEEE International Conference on Mobile Computing and Networks. 1999.
10. S. Ray, R. Kannan, H. Jiang, Weighted integrity problem is polynomial for interval graphs, under review in Discrete Appl. Math.
11. Selten R. Reexamination of the perfectness concept for equilibrium points in extensive games. Internat. J. Game Theory. 4:1975;25-55.