Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks

Authors:
Jian Tang;Satyajayant Misra;Guoliang Xue
Affiliations:
Department of Computer Science, Montana State University, Bozeman, MT 59717-3880, United States;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-8809, United States;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-8809, United States
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2008

Citing 12
Cited 7

On generating all maximal independent sets

Information Processing Letters
Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Achieving MAC layer fairness in wireless packet networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Rate allocation in wireless sensor networks with network lifetime requirement

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Convex Optimization

Convex Optimization
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocating dynamic time-spectrum blocks in cognitive radio networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Distributed algorithms for spectrum allocation, power control, routing, and congestion control in wireless networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer optimization for end-to-end rate allocation in multi-radio wireless mesh networks

Wireless Networks
Cross-Layer Design for End-to-End Throughput and Fairness Enhancement in Multi-Channel Wireless Mesh Networks

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory

A route-based scheduling in wireless multi-hop mesh networks for collision avoidance

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Modeling fairness in resource allocation for secondary users in a competitive cognitive radio network

WTS'10 Proceedings of the 9th conference on Wireless telecommunications symposium
Joint spectrum allocation and scheduling in multi-radio multi-channel cognitive radio wireless networks

Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Maximizing throughput for overlaid cognitive radio networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Mean-variance based QoS management in cognitive radio

IEEE Transactions on Wireless Communications
A new joint strategy of radio channel allocation and power control for wireless mesh networks

Computer Communications
Proportional fair power allocation for secondary transmitters in the TV white space

Journal of Electrical and Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cognitive radio and Dynamic Spectrum Access (DSA) enable wireless users to share a wide range of available spectrums. In this paper, we study joint spectrum allocation and scheduling problems in cognitive radio wireless networks with the objectives of achieving fair spectrum sharing. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the protocol model in such networks. Based on the MCCG, we present an optimal algorithm to compute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource allocation, we take fairness into consideration by presenting optimal algorithms as well as fast heuristics to compute fair solutions based on a simplified max-min fairness model and the well-known proportional fairness model. Numerical results show that the performance given by our heuristic algorithms is very close to that of the optimal solution, and our proportional fair algorithms achieve a good tradeoff between throughput and fairness. In addition, we extend our research to the physical interference model, and propose effective heuristics for solving the corresponding problems.