Efficient sensor placement for surveillance problems

Pankaj K. Agarwal, Esther Ezra, Shashidhara K. Ganjugunte

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations


We study the problem of covering a two-dimensional spatial region P, cluttered with occluders, by sensors. A sensor placed at a location p covers a point x in P if x lies within sensing radius r from p and x is visible from p, i.e., the segment px does not intersect any occluder. The goal is to compute a placement of the minimum number of sensors that cover P. We propose a landmark-based approach for covering P. Suppose P has ς holes, and it can be covered by h sensors. Given a small parameter ε>∈0, let λ:∈=∈λ(h,ε)∈=∈(h/ε) (1∈+∈ln (1∈+∈ς)). We prove that one can compute a set L of O(λlogλ log(1/ε)) landmarks so that if a set S of sensors covers L, then S covers at least (1∈-∈ε)-fraction of P. It is surprising that so few landmarks are needed, and that the number of landmarks depends only on h, and does not directly depend on the number of vertices in P. We then present efficient randomized algorithms, based on the greedy approach, that, with high probability, compute sensor locations to cover L; here is the number sensors needed to cover L. We propose various extensions of our approach, including: (i) a weight function over P is given and S should cover at least (1∈-∈ε) of the weighted area of P, and (ii) each point of P is covered by at least t sensors, for a given parameter t∈ ∈1.

Original languageEnglish
Title of host publicationDistributed Computing in Sensor Systems - 5th IEEE International Conference, DCOSS 2009, Proceedings
Number of pages14
StatePublished - 2009
Externally publishedYes
Event5th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2009 - Marina del Rey, CA, United States
Duration: 8 Jun 200910 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5516 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2009
Country/TerritoryUnited States
CityMarina del Rey, CA

Bibliographical note

Funding Information:
Work on this paper was supported by NSF under grants CNS-05-40347, CFF-06-35000, and DEB-04-25465, by ARO grants W911NF-04-1-0278 and W911NF-07-1-0376, and by an NIH grant 1P50-GM-08183-01.


Dive into the research topics of 'Efficient sensor placement for surveillance problems'. Together they form a unique fingerprint.

Cite this