Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks

被引：137

作者：

Urgaonkar, Rahul ^{[1
]}

Neely, Michael J. ^{[1
]}

机构：

[1] Univ So Calif, Dept Elect Engn, Syst Div, Los Angeles, CA 90089 USA

来源：

IEEE TRANSACTIONS ON MOBILE COMPUTING | 2009年 / 8卷 / 06期

基金：

美国国家科学基金会;

关键词：

Cognitive radio; queuing analysis; resource allocation; Lyapunov optimization; SPECTRUM ACCESS; WIRELESS NETWORKS;

D O I：

10.1109/TMC.2009.38

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：766 / 777

页数：12

共 23 条

[1] NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey [J].

Akyildiz, Ian F. ;

Lee, Won-Yeol ;

Vuran, Mehmet C. ;

Mohanty, Shantidev .

COMPUTER NETWORKS, 2006, 50 (13) :2127-2159

[2]

[Anonymous], P IEEE INFOCOM MAR

[3]

[Anonymous], 1996, Stochastic Processes

[4]

Cao L., 2005, P IEEE SENS AD HOC C

[5]

Chaporkar P., 2005, P 43 ALL C COMM CONT

[6] Joint design and separation principle for opportunistic spectrum access in the presence of sensing errors [J].

Chen, Yunxia ;

Zhao, Qing ;

Swami, Ananthram .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (05) :2053-2071

[7]

Georgiadis Leonidas, 2006, Foundations and Trends in Networking, V1, P1, DOI 10.1561/1300000001

[8]

Hou Y. T., 2007, P IEEE INFOCOM MAY

[9]

HUANG S, 2008, P IEEE INFOCOM APR

[10]

LIN X, 2005, P IEEE INFOCOM MAR

← 1 2 3 →