Analysis of Connectivity for Sensor Networks Using Geometrical Probability

Sensors typically have limited power of transmission. Thus desired connectivity probability (CP) between the sensors is critical in the given de- ployment area. This paper presents a novel approach for analyzing the lower bound of CP for sensor networks under uniformly distribution of the sensors in a given area.

[1]  João Schwarz Dasilva,et al.  European R&D programs on third-generation mobile communication systems , 1997, IEEE Wirel. Commun..

[2]  Aura Ganz,et al.  QoS Routing for Mesh-Based Wireless LANs , 2002, Int. J. Wirel. Inf. Networks.

[3]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

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

[5]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

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

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

[8]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[9]  Sajal K. Das,et al.  Mobility-adaptive protocols for managing large ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[10]  B Warneke,et al.  Smart Dust 立方ミリメートル・コンピュータと通信する , 2001 .

[11]  Gabor Karsai,et al.  Smart Dust: communicating with a cubic-millimeter computer , 2001 .

[12]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

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

[14]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[15]  S. Chakrabarti,et al.  QoS issues in ad hoc wireless networks , 2001, IEEE Commun. Mag..

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

[17]  Joseph Y. Halpern,et al.  Minimum-energy mobile wireless networks revisited , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[18]  Tracy Camp,et al.  Mesh-based geocast routing protocols in an ad hoc network , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

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

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

[21]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[22]  Sanjay Jha,et al.  Probabilistic coverage in wireless sensor networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[23]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[24]  Paolo Santi,et al.  A probabilistic analysis for the range assignment problem in ad hoc networks , 2001, MobiHoc '01.

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

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

[27]  Sandeep S. Kulkarni,et al.  pCover: Partial Coverage for Long-Lived Surveillance Sensor Networks , 2005 .

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

[29]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[30]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[31]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

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

[33]  A. M. Mathai.  An Introduction to Geometrical Probability: Distributional Aspects with Applications , 1999 .

[34]  Jie Wu,et al.  Energy-efficient coverage problems in wireless ad-hoc sensor networks , 2006, Comput. Commun..

[35]  Weifa Liang,et al.  Approximate coverage in wireless sensor networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[36]  Sean E. Hynes,et al.  Multi-Agent Simulations (MAS) for Assessing Massive Sensor Coverage and Deployment , 2003 .

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

[38]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.