Scheduling variable rate links via a spectrum server

• Published in: 2005 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks : IEEE DySPAN 2005, dynamic spectrum access networks : 8-11 November 2005, Baltimore, MD, USA pp. 110 - 118
• Main Authors: Raman, C., Yates, R.D., Mandayam, N.B.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Algorithm design and analysis; Filters; Frequency; Job shop scheduling; Land mobile radio cellular systems; Linear programming; Network servers; Optimal scheduling; Radio spectrum management; Scheduling algorithm
• ISBN: 9781424400133; 1424400139
• DOI: 10.1109/DYSPAN.2005.1542624

We consider a centralized spectrum server that coordinates the transmissions of a group of links sharing a common spectrum. Links employ on-off modulation with fixed transmit power when active. In the on state, a link obtains a data rate determined by the signal-to-interference ratio on the link. By knowing the link gains in the network, the spectrum server finds an optimal schedule that maximizes the average sum rate subject to a minimum average rate constraint for each link. Using a graph theoretic model for the network and a linear programming formulation, the resulting schedules are a collection of transmission modes (sets of active links) that are time shared in a fashion that is reminiscent of spatial reuse patterns in cellular networks. In the special case when there is no minimum rate constraint, the optimal schedule results in a fixed dominant mode with highest sum rate being operated all the time. In order to offset the inherent unfairness in the above solution, we introduce a minimum rate constraint and characterize the resulting loss in sum rate when compared to the case when there is no minimum rate constraint. We also investigate alternate fairness criteria by designing scheduling algorithms that achieve max-min fairness and proportional fairness. It is shown that the max-min fair rate allocation maximizes the minimum common rate among the links. Simulation results are presented and future work is described