Minimal sensor integrity: Measuring the vulnerability of sensor grids

DOI10.1016/S0020-0190(02)00450-7zbMATH Open1156.90455MaRDI QIDQ1007573FDOQ1007573

Authors: R. Kannan, Sibabrata Ray, Sudipta Sarangi, S. S. Iyengar 

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• Dynamically optimized sensor deployment based on game theory
• Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
• Optimal one-dimensional coverage by unreliable sensors

zbMATH Keywords

game theorygraph algorithmssensor networkssensor integrity

Mathematics Subject Classification ID

Dynamic programming (90C39) Applications of game theory (91A80)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Grid coverage for surveillance and target location in distributed sensor networks
• Optimal packing and covering in the plane are NP-complete
• Covering a set of points in multidimensional space

Cited In (1)

• Dynamically optimized sensor deployment based on game theory

This page was built for publication: Minimal sensor integrity: Measuring the vulnerability of sensor grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007573)