On the $k$ Nearest-Neighbor Path Distance from the Typical Intersection in the Manhattan Poisson Line Cox Process
Abstract
In this paper, we consider a Cox point process driven by the Manhattan Poisson line process. We calculate the exact cumulative distribution function (CDF) of the path distance (L1 norm) between a randomly selected intersection and the -th nearest node of the Cox process. The CDF is expressed as a sum over the integer partition function , which allows us to numerically evaluate the CDF in a simple manner for practical values of . These distance distributions can be used to study the -coverage of broadcast signals transmitted from a \ac{RSU} located at an intersection in intelligent transport systems (ITS). Also, they can be insightful for network dimensioning in vehicle-to-everything (V2X) systems, because they can yield the exact distribution of network load within a cell, provided that the \ac{RSU} is placed at an intersection. Finally, they can find useful applications in other branches of science like spatial databases, emergency response planning, and districting. We corroborate the applicability of our distance distribution model using the map of an urban area.
Keywords
Cite
@article{arxiv.2008.10670,
title = {On the $k$ Nearest-Neighbor Path Distance from the Typical Intersection in the Manhattan Poisson Line Cox Process},
author = {Konstantinos Koufos and Harpreet S. Dhillon and Mehrdad Dianati and Carl P. Dettmann},
journal= {arXiv preprint arXiv:2008.10670},
year = {2021}
}