Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?

@article{Zhang2006IsDD,
  title={Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?},
  author={Honghai Zhang and Jennifer C. Hou},
  journal={Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications},
  year={2006},
  pages={1-13}
}
Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain level of coverage. The number of sensors required for maintaining k-coverage depends on the area of the monitored region, the probability that a node fails or powers off (to save energy), and the deployment strategy. In this paper, we derive the density required to maintain k-coverage under three deployment strategies: (i) nodes are deployed as a Poisson point process, (ii) nodes… CONTINUE READING
Highly Cited
This paper has 100 citations. REVIEW CITATIONS

Citations

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

101 Citations

051015'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 101 citations based on the available data.

See our FAQ for additional information.

References

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

Wireless sensor networks for habitat monitoring

  • A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler
  • In First ACM International Workshop on Wireless…
  • 2002
1 Excerpt

Introduction to the Theory of Coverage Processes

  • P. Hall
  • 1988
2 Excerpts

Similar Papers

Loading similar papers…