Probabilistic coverage in wireless sensor networks

The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage in order to anticipate this sensing behavior. We investigate the coverage issues in wireless sensor networks based on probabilistic coverage and propose a distributed probabilistic coverage algorithm (PCA) to evaluate the degree of confidence in detection probability provided by a randomly deployed sensor network. The probabilistic approach is a deviation from the idealistic assumption of uniform circular disc for sensing coverage used in the binary detection model. Simulation results show that area coverage calculated by using PCA is more accurate than the idealistic binary detection model

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

[2]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

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

[4]  John A. Stankovic,et al.  Di erentiated Surveillance Service for Sensor Networks , 2003 .

[5]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[6]  Mani B. Srivastava,et al.  Critical density thresholds for coverage in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

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

[8]  Tarek F. Abdelzaher,et al.  Analysis of Target Detection Performance for Wireless Sensor Networks , 2005, DCOSS.

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

[10]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[11]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

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

[13]  Gaurav S. Sukhatme,et al.  Coverage, Exploration and Deployment by a Mobile Robot and Communication Network , 2004, Telecommun. Syst..

[14]  Yu-Chee Tseng,et al.  A probabilistic signal-strength-based evaluation methodology for sensor network deployment , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[15]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[16]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[17]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

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

[19]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[20]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[21]  Krishnendu Chakrabarty,et al.  A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks , 2005, IEEE Transactions on Computers.

[22]  Xin Chen,et al.  A study on object tracking quality under probabilistic coverage in sensor networks , 2005, MOCO.

[23]  L. El Ghaoui,et al.  Convex position estimation in wireless 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).

[24]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[25]  Wenhua Dou,et al.  A Coverage-Preserving Density Control Algorithm for Wireless Sensor Networks , 2004, ADHOC-NOW.

[26]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[27]  Jeff Frolik,et al.  Effects of natural propagation environments on wireless sensor network coverage area , 2003, Proceedings of the 35th Southeastern Symposium on System Theory, 2003..

[28]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[29]  Gaurav S. Sukhatme,et al.  Autonomous deployment and repair of a sensor network using an unmanned aerial vehicle , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[30]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[31]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

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

[33]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[34]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..