Information Coverage in Randomly Deployed Wireless Sensor Networks

Coverage is an important issue in wireless sensor networks. The most commonly used coverage model in the literature defines a point to be covered if its Euclidian distance to at least one sensor is less than a fixed threshold. This is a conservative definition of coverage which implicitly assumes that each sensor makes a decision independent of other sensors in the field. Sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We have previously proposed a new notion of information coverage and investigated its properties. In this paper, we study sensor density requirements for complete information coverage of a field with random sensor deployment. We provide an upper bound on the probability that an arbitrary point in a randomly deployed sensor field is not information covered and find the relationship between the sensor density and the average field vacancy. Simulation results validate our theoretical analysis and show that significant savings in terms of sensor density for complete coverage can be achieved with information coverage.

[1]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[2]  Wei Wang,et al.  Information coverage for wireless sensor networks , 2005, IEEE Communications Letters.

[3]  Wei Wang,et al.  Localized Recursive Estimation in Wireless Sensor Networks , 2005, MSN.

[4]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[5]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[6]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[7]  Hasan Çam,et al.  Energy efficient differentiable coverage service protocols for wireless sensor networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

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

[9]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[10]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[11]  Andrea J. Goldsmith,et al.  Joint estimation in sensor networks under energy constraints , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[12]  Zhi-Quan Luo,et al.  Universal decentralized estimation in a bandwidth constrained sensor network , 2005, IEEE Transactions on Information Theory.

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

[14]  Wei Wang,et al.  Scheduling Sensor Activity for Point Information Coverage in Wireless Sensor Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[15]  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).

[16]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[17]  Thomas F. La Porta,et al.  Proxy-based sensor deployment for mobile sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

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

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

[20]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[21]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[22]  Wei Wang,et al.  Worst and Best Information Exposure Paths in Wireless Sensor Networks , 2005, MSN.

[23]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[24]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[25]  József Balogh,et al.  On k−coverage in a mostly sleeping sensor network , 2008, Wirel. Networks.

[26]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.

[27]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

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

[29]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[30]  Thomas F. La Porta,et al.  A bidding protocol for deploying mobile sensors , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[31]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[32]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.