Sequential and Cooperative Sensing for Multi-Channel Cognitive Radios

被引:55
作者
Kim, Seung-Jun [1 ]
Giannakis, Georgios B. [1 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
基金
美国国家科学基金会;
关键词
Cognitive radio; optimal stopping; sequential detection; spectrum sensing; DYNAMIC SPECTRUM ACCESS; MARKOV-PROCESSES; QUANTIZATION; ALGORITHMS; MAC;
D O I
10.1109/TSP.2010.2049106
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Effective spectrum sensing is a critical prerequisite for multi-channel cognitive radio (CR) networks, where multiple spectrum bands are sensed to identify transmission opportunities, while preventing interference to the primary users. The present paper develops sequential spectrum sensing algorithms which explicitly take into account the sensing time overhead, and optimize a performance metric capturing the effective average data rate of CR transmitters. A constrained dynamic programming problem is formulated to obtain the policy that chooses the best time to stop taking measurements and the best set of channels to access for data transmission, while adhering to hard "collision" constraints imposed to protect primary links. Given the associated Lagrange multipliers, the optimal access policy is obtained in closed form, and the subsequent problem reduces to an optimal stopping problem. A basis expansion-based sub-optimal strategy is employed to mitigate the prohibitive computational complexity of the optimal stopping policy. A novel on-line implementation based on the recursive least-squares (RLS) algorithm along with a stochastic dual update procedure is then developed to obviate the lengthy training phase of the batch scheme. Cooperative sequential sensing generalizations are also provided with either raw or quantized measurements collected at a central processing unit. The numerical results presented verify the efficacy of the proposed algorithms.
引用
收藏
页码:4239 / 4253
页数:15
相关论文
共 38 条
[1]  
[Anonymous], 1985, Bandit Problems: Sequential Allocation of Experiments
[2]  
[Anonymous], P IEEE S NEW FRONT D
[3]  
[Anonymous], 1985, Sequential Analysis
[4]  
[Anonymous], IEEE T SIG UNPUB MAY
[5]  
[Anonymous], 1993, FUNDAMENTALS STAT SI
[6]  
[Anonymous], 2007, Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics)
[7]  
Bertsekas D. P., 2000, DYNAMIC PROGRAMMING, VI
[8]   CONVERGENCE OF DISCRETIZATION PROCEDURES IN DYNAMIC-PROGRAMMING [J].
BERTSEKAS, DP .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1975, AC20 (03) :415-419
[9]  
Cabric D., 2006, TAPAS 06 P 1 INT WOR, P12, DOI DOI 10.1109/MILCOM.2006.301994
[10]  
CASTANON DA, 1997, P 36 IEEE C DEC CONT, V2, P1202