Asymptotic Capacity of Wireless Ad Hoc Networks with Realistic Links under a Honey Comb Topology

TL;DR

This paper analyzes the capacity limits of wireless ad hoc networks with realistic link conditions, using a honeycomb topology to derive bounds that account for fading and shadowing effects.

Contribution

It introduces new capacity bounds for ad hoc networks considering Rayleigh fading and shadowing, based on a simplified honeycomb topology model.

Findings

Derived bounds reflect packet drop and capture probabilities.

Capacity bounds are applicable under specific routing and scheduling schemes.

The model incorporates realistic physical interference effects.

Abstract

We consider the effects of Rayleigh fading and lognormal shadowing in the physical interference model for all the successful transmissions of traffic across the network. New bounds are derived for the capacity of a given random ad hoc wireless network that reflect packet drop or capture probability of the transmission links. These bounds are based on a simplified network topology termed as honey-comb topology under a given routing and scheduling scheme.