Minimal sensor integrity in sensor grids

Author

Kannan, Rajgopal ; Sarangi, Sudipta ; Ray, Sibabrata ; Iyengar, Iyengar S.

Author_Institution

Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA

Volume

2

fYear

2002

fDate

8-11 July 2002

Firstpage

959

Abstract

We define the problem of maximal sensor integrity placement, that of locating sensors in n-dimensional grids with minimal vulnerability to enemy attack or sensor faults. We show a polynomial time algorithm for computing sensor integrity exists for sensors with unbounded ranges deployed over a 1D grid of points. We then present an integer linear programming (ILP) formulation for computing sensor integrity for unbounded range sensors over higher dimension grids.

Keywords

computational complexity; integer programming; linear programming; sensor fusion; 1D points grid; integer linear programming; maximal sensor integrity placement; minimal enemy attack vulnerability; minimal sensor fault vulnerability; minimal sensor integrity; n-dimensional grids; polynomial time algorithm; sensor grids; sensor location; unbounded range sensors; unbounded ranges; Computer science; Cost function; Environmental economics; Grid computing; Monitoring; Polynomials; Sensor fusion; Sensor phenomena and characterization; Sensor systems; Surveillance;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Fusion, 2002. Proceedings of the Fifth International Conference on

Conference_Location

Annapolis, MD, USA

Print_ISBN

0-9721844-1-4

Type

conf

DOI

10.1109/ICIF.2002.1020915

Filename

1020915