Euclidean Matchings in Ultra-Dense Networks

In order to study the fundamental limits of network densification, we look at the spatial spectral efficiency gain achieved when densely deployed communication devices embedded in the d-dimensional Euclidean space are optimally `matched' in near-neighbour pairs. In light of recent success in probabilisitc modelling, we study devices distributed uniformly at random in the unit cube which enter into one-on-one contracts with each another. This is known in statistical physics as an Euclidean `matching'. Communication channels each have their own maximal data capacity given by Shannon's theorem. The length of the shortest matching then corresponds to the maximum one-hop capacity on those points. Interference is then added as a further constraint, which is modelled using shapes as guard regions, such as a disk, diametral disk, or equilateral triangle, matched to points, in a similar light to computational geometry. The disk, for example, produces the Delaunay triangulation, while the diametral disk produces a beta-skeleton. We also discuss deriving the scaling limit of both models using the replica method from the physics of disordered systems.

READ FULL TEXT
research
10/29/2019

Meta Distribution of SIR in Ultra-Dense Networks with Bipartite Euclidean Matchings

Ultra-dense networks maximise spatial spectral efficiency through spatia...
research
11/24/2019

On Maximum-Sum Matchings of Points

Huemer et al. (Discrete Mathematics, 2019) proved that for any two point...
research
01/15/2022

Noncommutative Geometry of Computational Models and Uniformization for Framed Quiver Varieties

We formulate a mathematical setup for computational neural networks usin...
research
06/29/2021

Optimal Spanners for Unit Ball Graphs in Doubling Metrics

Resolving an open question from 2006, we prove the existence of light-we...
research
02/22/2019

Matching points with disks with a common intersection

We consider matchings with diametral disks between two sets of points R ...
research
11/26/2018

Matching Features without Descriptors: Implicitly Matched Interest Points (IMIPs)

The extraction and matching of interest points is a prerequisite for vis...
research
10/31/2017

Manipulation Strategies for the Rank Maximal Matching Problem

We consider manipulation strategies for the rank-maximal matching proble...

Please sign up or login with your details

Forgot password? Click here to reset