A Fully Distributed Algorithm for Throughput Performance in Wireless Networks

TL;DR

This paper introduces a fully distributed link scheduling algorithm for wireless networks that guarantees stability under the physical interference model, with efficiency independent of network size and requiring no global network information.

Contribution

The paper presents a novel distributed algorithm that achieves stable throughput in wireless networks under SINR constraints without global network knowledge.

Findings

Algorithm guarantees stability under stochastic arrivals.

Efficiency is independent of network size.

No need for nodes to have global topology information.

Abstract

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the maximum feasible traffic that the algorithm can handle without queues growing indefinitely. Our algorithm achieves two important goals: (i) efficiency is independent of the size of the network, and (ii) the algorithm is fully distributed, i.e., individual nodes need no information about the overall network topology, not even local information.