Skip to main content

Coverage Problem of Wireless Sensor Networks

  • Conference paper
Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4381))

Abstract

In this paper we study the limiting achievable coverage problems of sensor networks. For the sensor networks with uniform distributions we obtain a complete characterization of the coverage probability. For the sensor networks with non-uniform distributions, we derive two different necessary and sufficient conditions respectively in the situations that the density function achieves its minimum value on a set with positive Lebesgue measure or at finitely many points. We propose also an economical scheme for the coverage of sensor networks with empirical distributions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldous, D.: Probability Approximations via the Poisson Clumping Heuristic. Spring-Verlag, New York (1989)

    MATH  Google Scholar 

  2. Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: McEneaney, W.M., Yin, G.G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications. Systems Control Found. Appl, pp. 547–566. Birkhäuser Boston, Boston (1998)

    Google Scholar 

  3. Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley & Sons, New York (1988)

    MATH  Google Scholar 

  4. Huang, C.-F., Tseng, Y.-C.: The Coverage Problem in a Wireless Sensor Network. In: ACM Intl. Workshop on Wireless Sensor Networks and Applications, pp. 115–121 (2003)

    Google Scholar 

  5. Kar, K., Banerjee, S.: Node Placement for Connected Coverage in Sensor Networks. In: Proceedings of WiOpt : Modeling and Optimization in Mobile. Sophia Antipolis, France (2003)

    Google Scholar 

  6. Koskinen, H.: On the Coverage of a Random Sensor Network in a Bounded Domain. In: Proceedings of 16th ITC Specialist Seminar, pp. 11–18 (2004)

    Google Scholar 

  7. Liu, B., Brass, P., Dousse, O., Nain, P., Towsley, D.: Mobility Improves Coverage of Sensor Networks. Submitted to the ACM MobiHoc 2005 Symposium (2004)

    Google Scholar 

  8. Liu, B., Towsley, D.: A Study of the Coverage of Large-Scale Sensor Networks. In: IEEE International Conference on Mobile Ad-hoc and Sensor Systems (2004)

    Google Scholar 

  9. Li, X.Y., Wan, P.J., Frieder, O.: Coverage in Wireless Ad Hoc Sensor Networks. IEEE Trans. on Computers 52, 753–763 (2003)

    Article  Google Scholar 

  10. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad-hoc Sensor Networks. In: Proc. IEEE Infocom, pp. 1380–C1387 (2001)

    Google Scholar 

  11. Miorandi, D., Altman, E.: Coverage and Connectivity of Ad-Hoc Networks in Presence of Channel Randomness. In: Proc. of IEEE INFOCOM 2005. Miami, USA (2005)

    Google Scholar 

  12. Philips, T.K., Panwar, S.S., Tantawi, A.N.: Connectivity Properties of a Packet Radio Network Model. IEEE Transactions on Information Theory 35(5), 1044–1047 (1989)

    Article  Google Scholar 

  13. Poduri, S., Sukhatme, G.S.: Constrained Coverage for Mobile Sensor Networks. IEEE International Conference on Robotics and Automation. LA, USA, pp. 165–172 (2004)

    Google Scholar 

  14. Shakkottai, S., Srikant, R., Shroff, N.: Unreliable Sensor grids: Coverage, Connectivity and Diameter. In: Proc. IEEE Infocom (2003)

    Google Scholar 

  15. Tian, D., Georganas, N.D.: A coverage-preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: First ACM International Workshop on Wireless Sensor Networks and Applications, pp. 32–41 (2002)

    Google Scholar 

  16. Zhang, H.h., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Ad. Hoc. & Sensor Wireless Networks 1, 89–124 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jin Akiyama William Y. C. Chen Mikio Kano Xueliang Li Qinglin Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Lan, G.L., Ma, Z.M., Sun, S.S. (2007). Coverage Problem of Wireless Sensor Networks. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70666-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70665-6

  • Online ISBN: 978-3-540-70666-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics