Connectivity of Random 1-Dimensional Networks
Information Theory
2009-10-10 v2 Data Structures and Algorithms
math.IT
Applications
Abstract
An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a vehicle, so it is natural to assume that arbitrary probability density functions of distances between successive sensors in a segment are given. The paper computes the probability of connectivity and coverage of 1-dimensional networks and gives estimates for a minimal number of sensors for important distributions.
Cite
@article{arxiv.0710.1001,
title = {Connectivity of Random 1-Dimensional Networks},
author = {V. Kurlin and L. Mihaylova},
journal= {arXiv preprint arXiv:0710.1001},
year = {2009}
}
Comments
12 pages, 10 figures