Sensor Density for Complete Information Coverage in Wireless Sensor Networks
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.
Unable to display preview. Download preview PDF.
- 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.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
- 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.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.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.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