English
Related papers

Related papers: On the $k$ Nearest-Neighbor Path Distance from the…

200 papers

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…

Information Theory · Computer Science 2020-06-09 Vishnu Vardhan Chetlur , Harpreet S. Dhillon , Carl P. Dettmann

In this letter, we characterize the load on the cellular macro base stations (MBSs) due to vehicular users modeled by a Poisson line Cox process (PLCP). Modeling the locations of MBSs by a homogeneous 2D Poisson point process (PPP), we…

Information Theory · Computer Science 2020-08-05 Vishnu Vardhan Chetlur , Harpreet S. Dhillon

We characterize the statistics of nearest-neighbor and contact distance distributions for Thomas cluster process (TCP), which is a special case of Poisson cluster process. In particular, we derive the cumulative distribution function (CDF)…

Information Theory · Computer Science 2016-09-27 Mehrnaz Afshang , Chiranjib Saha , Harpreet S. Dhillon

We introduce a general framework for the modeling and analysis of vehicular networks by defining street systems as random 1D subsets of $\mathbb{R}^{2}$. The street system, in turn, specifies the random intensity measure of a Cox process of…

Networking and Internet Architecture · Computer Science 2021-06-15 Jeya Pradha Jeyaraj , Martin Haenggi

In this paper, we consider a vehicular network in which the wireless nodes are located on a system of roads. We model the roadways, which are predominantly straight and randomly oriented, by a Poisson line process (PLP) and the locations of…

Information Theory · Computer Science 2017-09-26 Vishnu Vardhan Chetlur , Harpreet S. Dhillon

This paper analyzes statistical properties of the Poisson line Cox point process useful in the modeling of vehicular networks. The point process is created by a two-stage construction: a Poisson line process to model road infrastructure and…

Information Theory · Computer Science 2018-07-24 Chang-Sik Choi , François Baccelli

In this letter, we derive the CDF (cumulative distribution function) of $k$th contact distance (CD) and nearest neighbor distance (NND) of the $n$-dimensional ($n$-D) Mat\'ern cluster process (MCP). We present a new approach based on the…

Information Theory · Computer Science 2020-07-31 Kaushlendra Pandey , Abhishek K. Gupta

In this paper, we investigate the cumulative distribution function (CDF) of the aggregate interference in carrier sensing multiple access/collision avoidance (CSMA/CA) networks measured at an arbitrary time and position. We assume that…

Networking and Internet Architecture · Computer Science 2015-12-25 June Hwang , Jinho Choi , Riku Jantti , Seong-Lyun Kim

We derive exact expressions for the shortest path length to a point of a Poisson line Cox process (PLCP) from the typical point of the PLCP and from the typical intersection of the underlying Poisson line process (PLP), restricted to a…

Information Theory · Computer Science 2024-11-26 Gourab Ghatak , Sanjoy Kumar Jhawar , Martin Haenggi

The current analysis of wireless networks whose transceivers are confined to streets is largely based on Poissonian models, such as Poisson line processes and Poisson line Cox processes. We demonstrate important scenarios where a model with…

Information Theory · Computer Science 2023-06-14 Mohammad Taha Shah , Gourab Ghatak , Souradip Sanyal , Martin Haenggi

The arrival of molecules in molecular communication via diffusion (MCvD) is a counting process, exhibiting by its nature binomial distribution. Even if the binomial process describes well the arrival of molecules, when considering…

Emerging Technologies · Computer Science 2014-10-29 H. Birkan Yilmaz , Chan-Byoung Chae , Burcu Tepekule , Ali E. Pusane

We consider a road network represented by a directed graph. We assume to collect many measurements of traffic flows on all the network arcs, or on a subset of them. We assume that the users are divided into different groups. Each group…

Systems and Control · Electrical Eng. & Systems 2025-03-20 Mattia Laurini , Irene Saccani , Stefano Ardizzoni , Luca Consolini , Marco Locatelli

In this letter, we derive the cumulative density function (CDF) of the nearest neighbor and contact distance distributions of the Matern cluster process (MCP) in R2. These results will be useful in the performance analysis of many…

Information Theory · Computer Science 2017-08-29 Mehrnaz Afshang , Chiranjib Saha , Harpreet S. Dhillon

Vehicular platooning is a promising way to facilitate efficient movement of vehicles with a shared route. Despite its relevance, the interplay of platooning and the communication performance in the resulting vehicular network (VN) is…

Information Theory · Computer Science 2022-06-28 Kaushlendra Pandey , Kanaka Raju Perumalla , Abhishek K. Gupta , Harpreet S. Dhillon

Consider that the coordinates of $N$ points are randomly generated along the edges of a $d$-dimensional hypercube (random point problem). The probability that an arbitrary point is the $m$th nearest neighbor to its own $n$th nearest…

Disordered Systems and Neural Networks · Physics 2007-05-23 Cesar Augusto Sangaletti Tercariol , Felipe de Mouta Kiipper , Alexandre Souto Martinez

We introduce the binomial line process (BLP), a novel spatial stochastic model for the characterization of streets in the statistical evaluation of wireless and vehicular networks. Existing stochastic geometry models for streets, e.g.,…

Physics and Society · Physics 2021-10-07 Gourab Ghatak

This paper presents a new method to obtain the distance distribution between the mobile node and any reference node in a regular hexagon. The existing distance distribution research mainly focuses on static network deployment and ignores…

Information Theory · Computer Science 2021-11-15 Ziyan Zhu , Fei Tong

We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…

Probability · Mathematics 2019-06-05 Vincent Guigues

We consider a stationary Poisson hyperplane process with given directional distribution and intensity in $d$-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body $K$ and consider the intersection…

Probability · Mathematics 2013-12-17 Daniel Hug , Rolf Schneider

In this letter, we derive new lower bounds on the cumulative distribution function (CDF) of the contact distance in the Poisson Hole Process (PHP) for two cases: (i) reference point is selected uniformly at random from $\mathbb{R}^2$…

Information Theory · Computer Science 2017-05-09 Mustafa A. Kishk , Harpreet S. Dhillon
‹ Prev 1 2 3 10 Next ›