Exploring the Design Space of Greedy Link Scheduling Algorithms for Wireless Multihop Networks

It is known that using a Spatial TDMA (STDMA) access scheme can increase the capacity of a wireless network over CSMA/CD access scheme. Modern wireless devices are capable of transmitting at different data rates depending on the current network condition. However, little attention has been paid to how best is to use the multiple data rates capability. In this paper, the authors focus on greedy link scheduling algorithms that work with variable rates, where devices can transmit at lower data rates to accommodate lower quality links. They propose criteria that can be used in the scheduling algorithms and investigate performances of different scheduling algorithms that employ these different criteria.