Connectivity of Random 1-Dimensional Networks

Kurlin, V ORCID: 0000-0001-5328-5351 and Mihaylova, L (2007) Connectivity of Random 1-Dimensional Networks Journal of Applied Probability and Statistics. ISSN 1930-6792

Text connectivity.random.1dim.network.pdf - Author Accepted Manuscript Download (435kB)

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.

Item Type:	Article
Additional Information:	12 pages, 10 figures
Uncontrolled Keywords:	cs.IT, cs.IT, cs.DS, stat.AP
Depositing User:	Symplectic Admin
Date Deposited:	14 Dec 2016 16:19
Last Modified:	21 Apr 2026 23:16
Related Websites:	Author
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3004874
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.