Efficient point coverage in wireless sensor networks

@article{Wang2006EfficientPC,
  title={Efficient point coverage in wireless sensor networks},
  author={Jie Wang and Ning Zhong},
  journal={J. Comb. Optim.},
  year={2006},
  volume={11},
  pages={291-304}
}
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have l types of sensors available with different sensing ranges and different costs. We want to find, given an integer σ ≥ 1, a selection of sensors and a subset of points to place these sensors such that every point in R is covered by at least σ sensors and the total cost of the sensors is minimum. This problem is known to be NP… CONTINUE READING
Highly Cited
This paper has 82 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 48 extracted citations

83 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 83 citations based on the available data.

See our FAQ for additional information.

References

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

Eikland. LP Solve: Linear Programming Code, version 5.5

  • M. Berkelaar, K. P. Notebaert
  • Eindhoven Univ. of Technology, The Netherlands
  • 2005
Highly Influential
5 Excerpts

Sensor networks–the next tier of the Internet. Keynote speeach in the Workshop on Sensor Networks–What

  • D. Culler
  • Is Real and What Lies Ahead,
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…