Information-theoretic Capacity of Clustered Random Networks

TL;DR

This paper investigates the capacity limits of clustered ad hoc networks modeled by shot-noise Cox processes, identifying regimes and strategies to approach theoretical maximum throughput.

Contribution

It introduces a novel analysis of capacity scaling laws for clustered networks and proposes strategies to nearly achieve maximum capacity across different regimes.

Findings

Five operational regimes identified.

Communication strategies achieve near-optimal throughput.

Capacity scaling laws depend on network clustering characteristics.

Abstract

We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shot-noise Cox process. We identify five different operational regimes, and for each regime we devise a communication strategy that allows to achieve a throughput to within a poly-logarithmic factor (in the number of nodes) of the maximum theoretical capacity.