Efficient Sensor Placement for Surveillance Problems

@inproceedings{Agarwal2009EfficientSP,
  title={Efficient Sensor Placement for Surveillance Problems},
  author={Pankaj K. Agarwal and Esther Ezra and Shashidhara K. Ganjugunte},
  booktitle={DCOSS},
  year={2009}
}
We study the problem of covering a two-dimensional spatial r egionP , cluttered with occluders, by sensors. A sensor placed at a lo cationp coversa point x in P if x lies within sensing radius r from p andx is visible fromp, i.e., the segmentpx does not intersect any occluder. The goal is to compute a plac ement of the minimum number of sensors that cover P . We propose alandmark-based approach for coveringP . SupposeP hasς holes, and it can be covered by h sensors. Given a small parameter… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Deploying wi reless sensors to achieve both coverage and connectivity

  • X. Bai, S. Kumar, Z. Yun, D. Xuan, T. H. Lai
  • Proc. ACM MobiHoc,
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…