The Capacity of Ad hoc Networks under Random Packet Losses

TL;DR

This paper analyzes the capacity of ad hoc networks considering realistic packet loss probabilities, showing that losses significantly reduce throughput and proposing a new scheduling scheme to improve performance.

Contribution

It introduces a realistic model accounting for packet losses and proposes a scheduling scheme that enhances network throughput under these conditions.

Findings

Per-node throughput drops to O(1/n) due to packet losses.

Proposed scheme achieves a throughput of Ω(1/√n (log n)^{(α+2)/2(α-2)}).

Packet losses critically impact ad hoc network capacity estimates.

Abstract

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to Interference and Noise Ratio (SINR) is above a certain threshold, then every transmitted packet is received error-free by the receiver thereby. Using this model, the per node capacity of the network was shown to be $\Theta(\frac{1}{\sqrt{n\log{n}}})$. In reality, for any finite link SINR, there is a non-zero probability of erroneous reception of the packet. We show that in a large network, as the packet travels an asymptotically large number of hops from source to destination, the cumulative impact of packet losses over intermediate links results in a per-node throughput of only $O(\frac{1}{n})$. We then propose a new scheduling scheme to counter this effect. The proposed scheme provides tight guarantees on end-to-end packet loss probability, and improves the per-node throughput to $\Omega(\frac{1}{\sqrt{n} ({\log{n}})^{\frac{\alpha{{+2}}}{2(\alpha-2)}}})$ where $\alpha>2$ is the path loss exponent.