How Many Wireless Sensors are Needed to Guarantee Connectivity of a One-Dimensional Network with Random Inter-Node Spacing?

Kurlin, Vitaliy; Mihaylova, Lyudmila

Abstract

An important problem in wireless sensor networks is to nd an optimal number of randomly deployed sensors to guarantee connectivity of the resulting network with a given probability. The authors describe a general method to compute the probabilities of connectivity and coverage for one-dimensional networks with arbitrary densities of inter-node spacings. A closed formula for the probability of connectivity is derived when inter-node spacings have arbitrary dierent piece-wise constant densities. Explicit estimates for a number of sensors to guarantee connectivity of the network are found for constant and normal densities.

Citation

Kurlin, V., & Mihaylova, L. (2013). How Many Wireless Sensors are Needed to Guarantee Connectivity of a One-Dimensional Network with Random Inter-Node Spacing?. Journal of applied probability and statistics, 8(2), 27-50

• Journal Article Type: Article
• Publication Date: Nov 1, 2013
• Deposit Date: Nov 15, 2013
• Publicly Available Date: Jan 15, 2014
• Journal: Journal of applied probability and statistics.
• Print ISSN: 1930-6792
• Publisher: ISOSS Publications
• Peer Reviewed: Peer Reviewed
• Volume: 8
• Issue: 2
• Pages: 27-50
• Keywords: Wireless sensor network, Connectivity, Probability, Density.
• Public URL: https://durham-repository.worktribe.com/output/1444585
• Publisher URL: http://japs.isoss.net/Contents.htm