Dynamic Packet Scheduling in Wireless Networks
The authors consider protocols that serve communication requests arising over time in a wireless network that is subject to interference. Unlike previous approaches, they take the geometry of the network and power control into account, both allowing to increase the network's performance significantly. They introduce a stochastic and an adversarial model to bound the packet injection. Although taken as the primary motivation, this approach is not only suitable for models based on the Signal-to-Interference-plus-Noise Ratio (SINR). It also covers virtually all other common interference models, for example the multiple-access channel, the radio-network model, the protocol model, and distance-2 matching. Packet-routing networks allowing each edge or each node to transmit or receive one packet at a time can be modeled as well.