Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks

Authors:
Rahul Urgaonkar;Michael J. Neely
Affiliations:
University of Southern California, Los Angeles;University of Southern California, Los Angeles
Venue:
IEEE Transactions on Mobile Computing
Year:
2009

Citing 0
Cited 8

Efficient resource allocation with flexible channel cooperation in OFDMA cognitive radio networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Streaming scalable videos over multi-hop cognitive radio networks

IEEE Transactions on Wireless Communications
Utility optimal scheduling in processing networks

Performance Evaluation
Dual band connectivity of cognitive radio networks

Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
Dynamic Spectrum Allocation with Maximum Efficiency and Fairness in Interactive Cognitive Radio Networks

Wireless Personal Communications: An International Journal
Control of wireless networks with secrecy

IEEE/ACM Transactions on Networking (TON)
LIFO-backpressure achieves near-optimal utility-delay tradeoff

IEEE/ACM Transactions on Networking (TON)
Optimal scheduling and power allocation in cooperate-to-join cognitive radio networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop opportunistic scheduling policies for cognitive radio networks that maximize the throughput utility of the secondary (unlicensed) users subject to maximum collision constraints with the primary (licensed) users. We consider a cognitive network with static primary users and potentially mobile secondary users. We use the technique of Lyapunov Optimization to design an online flow control, scheduling, and resource allocation algorithm that meets the desired objectives and provides explicit performance guarantees.