Kurlin, V. and Mihaylova, L.S. (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 (JAPS), 8. 27 - 50 . ISSN 1930-6792
Abstract
An important problem in wireless sensor networks is to find 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 di fferent piece-wise constant densities. Explicit estimates for a number of sensors to guarantee connectivity of the network are found for constant and normal densities.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 01 Dec 2014 10:18 |
Last Modified: | 13 Aug 2015 22:19 |
Published Version: | http://japs.isoss.net/nov13.htm |
Status: | Published |
Publisher: | ISOSS Publications, USA |
Refereed: | No |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:82249 |