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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks 39(4), 393–422 (2002)
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)
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)
Wang, B., Wang, W., Srinivasan, V., Chua, K.C.: Information Coverage for Wireless Sensor Networks. IEEE Communications Letters 9(11), 967–969 (2005)
Mendel, J.M.: Lessons in Estimation Theory for Signal Processing, Communications and Control. Prentice Hall, Inc., Englewood Cliffs (1995)
Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley and Sons, Chichester (1988)
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)
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)
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)
Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks, Tech. Rep., Technical Report UIUC, UIUCDCS-R-2003-2351 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Chua, K.C., Srinivasan, V., Wang, W. (2006). Sensor Density for Complete Information Coverage in Wireless Sensor Networks. In: Römer, K., Karl, H., Mattern, F. (eds) Wireless Sensor Networks. EWSN 2006. Lecture Notes in Computer Science, vol 3868. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11669463_8
Download citation
DOI: https://doi.org/10.1007/11669463_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32158-3
Online ISBN: 978-3-540-32159-0
eBook Packages: Computer ScienceComputer Science (R0)