Problem of localisation in networks of randomly deployed nodes: asymptotic and finite analysis, and thresholds

DOI10.1049/IET-COM.2009.0553MaRDI QIDQ2854449zbMATH OpenOpenAlexFDO

Authors Fred Daneshgaran, Massimiliano Laddomada, Marina Mondin

Publication date 18 October 2013

Published in IET Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0710.0531

Mathematics Subject Classification ID

Communication theory (94A05) Stochastic network models in operations research (90B15)

Abstract: We derive the probability that a randomly chosen NL-node over $S$ gets localized as a function of a variety of parameters. Then, we derive the probability that the whole network of NL-nodes over $S$ gets localized. In connection with the asymptotic thresholds, we show the presence of asymptotic thresholds on the network localization probability in two different scenarios. The first refers to dense networks, which arise when the domain $S$ is bounded and the densities of the two kinds of nodes tend to grow unboundedly. The second kind of thresholds manifest themselves when the considered domain increases but the number of nodes grow in such a way that the L-node density remains constant throughout the investigated domain. In this scenario, what matters is the minimum value of the maximum transmission range averaged over the fading process, denoted as $d_{max}$, above which the network of NL-nodes almost surely gets asymptotically localized.

This page was built for publication: Problem of localisation in networks of randomly deployed nodes: asymptotic and finite analysis, and thresholds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854449)