Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Catherine Gloaguen"'
Publikováno v:
Image Analysis and Stereology, Vol 28, Iss 3, Pp 155-163 (2011)
We consider the stochastic subscriber line model as a spatial stochastic model for telecommunication networks and we are interested in the evaluation of the required capacities at different locations of the network in order to provide, in fine, an es
Externí odkaz:
https://doaj.org/article/37df78de9fdb4d91b267a2b0bbfaca8d
Indoor coverage is a major challenge for 5G millimeter waves (mmWaves). In this paper, we address this problem through a novel theoretical framework that combines stochastic indoor environment modeling with advanced physical propagation simulation. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8175c5e88fe3312df186ae03ec85a968
https://hal.archives-ouvertes.fr/hal-02481730/document
https://hal.archives-ouvertes.fr/hal-02481730/document
Publikováno v:
Aarhus University
Neuhaeuser, D, Hirsch, C, Gloaguen, C & Schmidt, V 2015, ' Parametric Modeling of Sparse Random Trees Using 3D Copulas ', Stochastic Models, bind 31, nr. 2, s. 226-260 .
Neuhaeuser, D, Hirsch, C, Gloaguen, C & Schmidt, V 2015, ' Parametric Modeling of Sparse Random Trees Using 3D Copulas ', Stochastic Models, bind 31, nr. 2, s. 226-260 .
We provide a parametric modeling approach suitable for various kinds of hierarchical networks based on random geometric graphs. In these networks, we have two kinds of components, so-called high-level components (HLC) and low-level components (LLC).
Autor:
Elie Cali, Catherine Gloaguen
This paper presents a methodology for fast and reliable cost estimation of fixed access network deployment on any urban area. It is based on theoretical results presented in former papers for distances and attenuation results, adding the most importa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c9dcfc41a5bad86fd2931d61f4b164c
http://arxiv.org/abs/1701.03417
http://arxiv.org/abs/1701.03417
Publikováno v:
Aarhus University
Neuhäuser, D, Hirsch, C, Gloaguen, C & Schmidt, V 2012, ' On the distribution of typical shortest-path lengths in connected random geometric graphs ', Queueing Systems, bind 71, nr. 1, s. 199-220 .
Neuhäuser, D, Hirsch, C, Gloaguen, C & Schmidt, V 2012, ' On the distribution of typical shortest-path lengths in connected random geometric graphs ', Queueing Systems, bind 71, nr. 1, s. 199-220 .
Stationary point processes in ?2 with two different types of points, say H and L, are considered where the points are located on the edge set G of a random geometric graph, which is assumed to be stationary and connected. Examples include the classic
Publikováno v:
Stochastic Models. 27:141-167
We consider a spatial stochastic model for telecommunication networks, the stochastic subscriber line model, and we investigate the distribution of the typical shortest path length between network components. Therefore, we derive a representation for
Publikováno v:
Advances in Applied Probability. 42:936-952
We consider spatial stochastic models, which can be applied to, e.g. telecommunication networks with two hierarchy levels. In particular, we consider Cox processes X L and X H concentrated on the edge set T (1) of a random tessellation T, where the p
Publikováno v:
annals of telecommunications - annales des télécommunications. 66:103-118
The access network displays an important particularity that the locations of the network components strongly depend on geometrical features such as road systems and a city’s architecture. This paper deals with the distributions of point-to-point co
Publikováno v:
Journal of Statistical Computation and Simulation. 79:939-957
We consider stationary Poisson–Voronoi tessellations (PVT) in the Euclidean plane and study the properties of Voronoi tessellations induced by linear Poisson processes on the edges of the PVT. We are especially interested in simulation algorithms f
Publikováno v:
Japan J. Indust. Appl. Math. 25, no. 3 (2008), 305-330
We consider modulated Poisson--Voronoi tessellations, intended as models for telecommunication networks on a nationwide scale. By introducing an algorithm for the simulation of the typical cell of the latter tessellation, we lay the mathematical foun