On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension
Foundations and Trends in Networking · 2018
DOI: 10.1561/1300000029 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends in Networking, 2018. Verfasst von Armand M. Makowski und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 57 Literaturangaben.
Abstract (Originalsprache)
We consider geometric random graphs where n points are distributed independently on the unit interval [0, 1] according to some probability distribution function F with density function f. Two nodes communicate with each other if their distance is less than some transmission range. For this class of random graphs, we survey results concerning the existence of zero-one laws for graph connectivity, the type of the zero-one law obtained under specific assumptions on the density function f, the form of its critical scaling and its dependence on f, and the width of the corresponding phase transitions. This is motivated by the desire to understand how node distribution affects the critical transmission range as specified by the disk model. Engineering implications are discussed for power allocation.
Zitieren
APA
Makowski, A. M., & Han, G. (2018). On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension. Foundations and Trends in Networking. https://doi.org/10.1561/1300000029
Vancouver
Makowski AM, Han G. On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension. Foundations and Trends in Networking. 2018. doi:10.1561/1300000029
BibTeX
@article{Makowski2018,
author = {Makowski, Armand M. and Han, Guang},
title = {On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension},
journal = {Foundations and Trends in Networking},
year = {2018},
doi = {10.1561/1300000029}
}
EUVIMED