How many wireless sensors are needed to guarantee connectivity of a one-dimensional network with random inter-node spacing ?
Year: 2013
Type: article
Abstract: An important problem in wireless sensor networks is to nd an optimal number \nof 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.
Authors: Vitaliy Kurlin, Lyudmila Mihaylova
Institution: Durham University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W170358891
