Connectivity and Centrality in Dense Random Geometric Graphs

TL;DR

This paper analyzes the connectivity and centrality properties of dense random geometric graphs, which model wireless networks with short-range communication, to understand their structural characteristics relevant to 5G multi-hop intra-cell communication.

Contribution

It provides new insights into the connectivity and centrality in dense random geometric graphs, relevant for designing efficient 5G wireless networks.

Findings

Connectivity thresholds identified for dense graphs

Centrality measures characterized in the model

Implications for 5G multi-hop communication

Abstract

Due to shorter range communication becoming more prevalent with the development of multiple-input, multiple-output antennas (MIMO) and millimeter wave communications, multi-hop, intra-cell communication is anticipated to play a major role in 5G. This is developed in this thesis. Our analysis involves a stochastic spatial network model called a random geometric graph, which we use to model a network of interconnected devices communicating wirelessly without any separate, pre-established infrastructure. [The remaining abstract is available in the front matter of this thesis.]