Risk-Aware Cooperative Spectrum Access for Multi-Channel Cognitive Radio Networks

被引:69
作者
Zhang, Ning [1 ]
Cheng, Nan [1 ]
Lu, Ning [1 ]
Zhou, Haibo [2 ]
Mark, Jon W. [1 ]
Shen, Xuemin [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[2] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200240, Peoples R China
基金
加拿大自然科学与工程研究理事会;
关键词
Cognitive radio; stackelberg game; congestion game; maximum weight matching; WIRELESS COMMUNICATIONS; DIVERSITY; SECURITY; CHANNEL; RELAYS; TRUST;
D O I
10.1109/JSAC.2014.1403004
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, risk-aware cooperative spectrum access schemes for cognitive radio networks (CRNs) with multiple channels are proposed, whereby multiple primary users (PUs) operating over different channels choose trustworthy secondary users (SUs) as relays to improve throughput, and in return SUs gain transmission opportunities. To study the multi-channel cooperative spectrum access, cooperation over single channel is investigated first, which involves a PU selecting the suitable SU and granting a period of access time to the selected SU as a reward, considering trustworthiness of SUs. The above procedure is modeled as a Stackelberg game, through which access time allocation and power allocation are obtained. Based on the above results, cooperation over multiple channels is studied from the perspectives of the primary network and secondary network, respectively. Two schemes are proposed accordingly: the primary network-centric matching (PCM) scheme and the secondary network-centric cluster-based (SCC) scheme. In PCM scheme, cooperating SU for each channel is determined to maximize the total utility of the primary network, which is formulated as a maximum weight matching problem. In SCC scheme, SUs first form a cluster to share the channel state information (CSI), and the best SUs are selected for cooperation with PUs over different channels to obtain the maximum aggregate access time for the secondary network. Then, SUs share the obtained resource using congestion game and quadrature signalling. Numerical results demonstrate that, with the proposed schemes, PUs can achieve higher throughput, while SUs can obtain longer average access time, compared with the random channel access approach.
引用
收藏
页码:516 / 527
页数:12
相关论文
共 33 条
[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], 1984, QUANTITATIVE MEASURE
[3]  
[Anonymous], IEEE J SEL IN PRESS
[4]  
[Anonymous], P 38 AS C SIGN SYST
[5]  
[Anonymous], 2001, INTRO GRAPH THEORY
[6]   A trust-based security system for ubiquitous and pervasive computing environments [J].
Boukerche, Azzedine ;
Ren, Yonglin .
COMPUTER COMMUNICATIONS, 2008, 31 (18) :4343-4351
[7]  
Cao B., 2012, P IEEE INFOCOM
[8]   Simple Channel Sensing Order in Cognitive Radio Networks [J].
Cheng, Ho Ting ;
Zhuang, Weihua .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2011, 29 (04) :676-688
[9]  
Cheng N., IEEE T VEH IN PRESS
[10]  
Dehnie S., 2007, 41 IEEE ANN C INF SC