Long term fair scheduling in a cognitive wireless network with spectrum underlay

Authors:
Bin Wang;Dongmei Zhao
Affiliations:
Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario;Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 1

On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

Operations Research
Geometric programming for communication systems

Communications and Information Theory
Exclusive-Region Based Scheduling Algorithms for UWB WPAN

IEEE Transactions on Wireless Communications
Resource allocation for spectrum underlay in cognitive radio networks

IEEE Transactions on Wireless Communications - Part 2
Joint rate and power allocation for cognitive radios in dynamic spectrum access environment

IEEE Transactions on Wireless Communications - Part 2
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Optimal power control, scheduling, and routing in UWB networks

IEEE Journal on Selected Areas in Communications

Scheduling for long term proportional fairness in a cognitive wireless network with spectrum underlay

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study fair rate scheduling in an ad hoc cognitive wireless network with spectrum underlay. Transmissions in the network are allowed provided their interference to the primary network is below a predefined threshold. An optimal scheduling problem is formulated with an objective to achieve proportional fairness (PF) of the long-term average transmission rates among different links in the network. Two scheduling schemes are proposed for achieving PF of the average rates, each using different criteria to make scheduling decisions. Both scheduling schemes can be implemented distributively in the ad hoc cognitive network with limited assistance from the primary network. Our results show that the proposed PF scheduling schemes can achieve high overall throughput and close-to-optimum fairness.