7 research outputs found
The typical cell in anisotropic tessellations
The typical cell is a key concept for stochastic-geometry based modeling in
communication networks, as it provides a rigorous framework for describing
properties of a serving zone associated with a component selected at random in
a large network. We consider a setting where network components are located on
a large street network. While earlier investigations were restricted to street
systems without preferred directions, in this paper we derive the distribution
of the typical cell in Manhattan-type systems characterized by a pattern of
horizontal and vertical streets. We explain how the mathematical description
can be turned into a simulation algorithm and provide numerical results
uncovering novel effects when compared to classical isotropic networks.Comment: 7 pages, 7 figure
The typical cell in anisotropic tessellations
The typical cell is a key concept for stochastic-geometry based modeling in communication networks, as it provides a rigorous framework for describing properties of a serving zone associated with a component selected at random in a large network. We consider a setting where network components are located on a large street network. While earlier investigations were restricted to street systems without preferred directions, in this paper we derive the distribution of the typical cell in Manhattan-type systems characterized by a pattern of horizontal and vertical streets. We explain how the mathematical description can be turned into a simulation algorithm and provide numerical results uncovering novel effects when compared to classical isotropic networks
Shortest Path Distance in Manhattan Poisson Line Cox Process
While the Euclidean distance characteristics of the Poisson line Cox process
(PLCP) have been investigated in the literature, the analytical
characterization of the path distances is still an open problem. In this paper,
we solve this problem for the stationary Manhattan Poisson line Cox process
(MPLCP), which is a variant of the PLCP. Specifically, we derive the exact
cumulative distribution function (CDF) for the length of the shortest path to
the nearest point of the MPLCP in the sense of path distance measured from two
reference points: (i) the typical intersection of the Manhattan Poisson line
process (MPLP), and (ii) the typical point of the MPLCP. We also discuss the
application of these results in infrastructure planning, wireless
communication, and transportation networks