Minimal sensor integrity: Measuring the vulnerability of sensor grids

DOI10.1016/S0020-0190(02)00450-7MaRDI QIDQ1007573zbMATH OpenFDO

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)

zbMATH Keywords

game theorygraph algorithmssensor networkssensor integrity

Mathematics Subject Classification ID

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

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

Cites work

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

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)