Cognitive Medium Access: Exploration, Exploitation, and Competition

被引:203
作者
Lai, Lifeng [1 ]
El Gamal, Hesham [2 ]
Jiang, Hai [3 ]
Poor, H. Vincent [4 ]
机构
[1] Univ Arkansas, Dept Syst Engn, Little Rock, AR 72204 USA
[2] Ohio State Univ, Dept Elect & Comp Engn, Dreese Labs 205, Columbus, OH 43210 USA
[3] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada
[4] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
关键词
Bandit problem; cognitive radio; exploration; exploitation; medium access; OPPORTUNISTIC SPECTRUM ACCESS; MULTIARMED BANDIT PROBLEM; CHANNEL SENSING-ORDER; ALLOCATION RULES; RADIO NETWORKS; OPTIMALITY; MAC;
D O I
10.1109/TMC.2010.65
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. First, the scenario in which a single cognitive user wishes to opportunistically exploit the availability of frequency bands is considered. By adopting tools from the classical bandit problem, optimal as well as low complexity asymptotically optimal solutions are developed. Next, the multiple cognitive user scenario is considered. The situation in which the availability probability of each channel is known is first considered. An optimal symmetric strategy that maximizes the total throughput of the cognitive users is developed. To avoid the possible selfish behavior of the cognitive users, a game-theoretic model is then developed. The performance of both models is characterized analytically. Then, the situation in which the availability probability of each channel is unknown a priori is considered. Low-complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed. The operating points of these low-complexity protocols are shown to converge to those of the scenario in which the availability probabilities are known. Finally, numerical results are provided to illustrate the impact of sensing errors and other practical considerations.
引用
收藏
页码:239 / 253
页数:15
相关论文
共 23 条
[1]   Optimality of Myopic Sensing in Multichannel Opportunistic Access [J].
Ahmad, Sahand Haji Ali ;
Liu, Mingyan ;
Javidi, Tara ;
Zhao, Qing ;
Krishnamachari, Bhaskar .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (09) :4040-4050
[2]   ASYMPTOTICALLY EFFICIENT ALLOCATION RULES FOR THE MULTIARMED BANDIT PROBLEM WITH MULTIPLE PLAYS .1. IID REWARDS [J].
ANANTHARAM, V ;
VARAIYA, P ;
WALRAND, J .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1987, 32 (11) :968-976
[3]  
[Anonymous], 1985, Bandit Problems: Sequential Allocation of Experiments
[4]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[5]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[6]   Channel Sensing-Order Setting in Cognitive Radio Networks: A Two-User Case [J].
Fan, Rongfei ;
Jiang, Hai .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2009, 58 (09) :4997-5008
[7]   Dynamic spectrum access in the time domain: Modeling and exploiting white space [J].
Geirhofer, Stefan ;
Tong, Lang ;
Sadler, Brian M. .
IEEE COMMUNICATIONS MAGAZINE, 2007, 45 (05) :66-72
[8]   Cognitive radio: Brain-empowered wireless communications [J].
Haykin, S .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (02) :201-220
[9]   Optimal Selection of Channel Sensing Order in Cognitive Radio [J].
Jiang, Hai ;
Lai, Lifeng ;
Fan, Rongfei ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (01) :297-307
[10]   Efficient discovery of spectrum opportunities with MAC-layer sensing in cognitive radio networks [J].
Kim, Hyoil ;
Shin, Kang G. .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2008, 7 (05) :533-545