RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2017 Volume 53, Issue 1, Pages 79–91 (Mi ppi2229)

This article is cited in 1 paper

Large Systems

Model of a random geometric graph with attachment to the coverage area

S. N. Khoroshenkikh, A. B. Dainyak

Moscow Institute of Physics and Technology, State University, Moscow, Russia

Abstract: We propose a model of random geometric graph with vertices in $\mathbb{R}^n$ and $\mathbb{Z}^n$ as an alternative to existing models of ad-hoc wireless networks. We provide estimates for some graph invariants in our model in $\mathbb{R}^1$ and $\mathbb{Z}^n$.

UDC: 621.391.1:519.1

Received: 26.06.2016


 English version:
Problems of Information Transmission, 2017, 53:1, 73–83

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026