Information coverage for 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. In this paper we argue that this is a conservative definition of coverage. This definition implicitly assumes that each sensor makes a decision independent of other sensors in the field. However, sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We then propose a new notion of information coverage and investigate its implications for sensor deployment. Numerical and simulation results show that significant savings in terms of sensor density for complete coverage can be achieved by using our definition of information coverage compared to that by using the existing definition.

[1]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[3]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[4]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[5]  J. Mendel Lessons in Estimation Theory for Signal Processing, Communications, and Control , 1995 .

[6]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.