Advertisement

Sensor Density for Complete Information Coverage in Wireless Sensor Networks

  • Bang Wang
  • Kee Chaing Chua
  • Vikram Srinivasan
  • Wei Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3868)

Abstract

Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor. This is a conservative definition of coverage and we have previously proposed a new notion of information coverage. Compared with the conventional definition of coverage, a point can still be information covered even if it is not within the sensing disk of any sensor. The density requirements for complete information coverage of a field are analyzed and simulated for a random sensor deployment. Our results show that significant savings in terms of sensor density can be achieved with information coverage.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks 39(4), 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Cardei, M., Wu, J.: Coverage in Wireless Sensor Networks. In: Ilyas, M., Mahgoub, I. (eds.) Handbook of Sensor Networks, ch. 19. CRC Press, Boca Raton (2004)Google Scholar
  3. 3.
    Huang, C.-F., Tseng, Y.-C.: A Survey of Solutions to The Coverage Problems in Wireless Sensor Networks. Journal of Internet Technology 6(1) (2005)Google Scholar
  4. 4.
    Wang, B., Wang, W., Srinivasan, V., Chua, K.C.: Information Coverage for Wireless Sensor Networks. IEEE Communications Letters 9(11), 967–969 (2005)CrossRefGoogle Scholar
  5. 5.
    Mendel, J.M.: Lessons in Estimation Theory for Signal Processing, Communications and Control. Prentice Hall, Inc., Englewood Cliffs (1995)zbMATHGoogle Scholar
  6. 6.
    Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley and Sons, Chichester (1988)zbMATHGoogle Scholar
  7. 7.
    Zhang, H., Hou, J.: On Deriving the Upper Bound of α-lifetime for Large Sensor Networks. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2004)Google Scholar
  8. 8.
    Kumar, S., Lai, T.H., Balogh, J.: On k-Coverage in A Mostly Sleeping Sensor Network. In: ACM International Conference on Mobile Computing and Networking (MobiCom), pp. 114–158 (2004)Google Scholar
  9. 9.
    Tian, D., Georganas, N.D.: A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp. 32–41 (2002)Google Scholar
  10. 10.
    Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks, Tech. Rep., Technical Report UIUC, UIUCDCS-R-2003-2351 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bang Wang
    • 1
  • Kee Chaing Chua
    • 1
  • Vikram Srinivasan
    • 1
  • Wei Wang
    • 1
  1. 1.Department of Electrical and Computer Engineering (ECE)National University of Singapore (NUS)Singapore

Personalised recommendations