Sum Throughput Maximization in a Cognitive Multiple Access Channel With Cooperative Spectrum Sensing and Energy Harvesting

被引:10
作者
Biswas, Sinchan [1 ]
Dey, Subhrakanti [1 ]
Shirazinia, Amirpasha [2 ]
机构
[1] Uppsala Univ, Div Signals & Syst, S-75105 Uppsala, Sweden
[2] Analyt & AI Grp, S-17062 Stockholm, Sweden
基金
瑞典研究理事会;
关键词
Energy harvesting; cognitive radio; multiple access channel; spectrum sensing; fading channel; POWER ALLOCATION; WIRELESS ENERGY; RADIO NETWORKS; COMMUNICATION; CAPACITY; TRADEOFF;
D O I
10.1109/TCCN.2019.2908860
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This paper focuses on the problem of sensing throughput optimization in a fading multiple access cognitive radio (CR) network, where the secondary user (SU) transmitters participate in cooperative spectrum sensing and are capable of harvesting energy and sharing energy with each other. We formulate the optimization problem as a maximization of the expected achievable sum-rate over a finite horizon, subject to an average interference constraint at the primary receiver, peak power constraints, and energy causality constraints at the SU transmitters. The optimization problem is a non-convex, mixed integer non-linear program (MINLP) involving the binary action to sense the spectrum or not, and the continuous variables, such as the transmission power, shared energy, and sensing time. The problem is analyzed under two different assumptions on the available information pattern: 1) non-causal channel state information (CSI), energy state information (ESI), and infinite battery capacity and 2) the more realistic scenario of the causal CSI/ESI and finite battery. In the non-casual case, this problem can be solved by an exhaustive search over the decision variable or an MINLP solver for smaller problem dimensions, and a novel heuristic policy for larger problems, combined with an iterative alternative optimization method for the continuous variables. The causal case with finite battery is optimally solved using a dynamic programming (DP) methodology, whereas a number of sub-optimal algorithms are proposed to reduce the computational complexity of DP. Extensive numerical simulations are carried out to illustrate the performance of the proposed algorithms. One of the main findings indicates that the energy sharing is more beneficial when there is a significant asymmetry between average harvested energy levels/channel gains of different SUs.
引用
收藏
页码:382 / 399
页数:18
相关论文
共 51 条
[1]  
[Anonymous], 2002, 02135 FCC SPECTR POL
[2]  
[Anonymous], P IEEE WIR C NETW C
[3]  
[Anonymous], 2016, DYNAMIC PROGRAMMING
[4]   Optimal Packet Scheduling on an Energy Harvesting Broadcast Link [J].
Antepli, Mehmet Akif ;
Uysal-Biyikoglu, Elif ;
Erkal, Hakan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2011, 29 (08) :1721-1731
[5]   Energy Detection Based Cooperative Spectrum Sensing in Cognitive Radio Networks [J].
Atapattu, Saman ;
Tellambura, Chintha ;
Jiang, Hai .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (04) :1232-1241
[6]   Sensing Strategy Exploiting Channel Memory in CR Network With RF Energy Harvesting [J].
Bae, Yun Han ;
Baek, Jung Woo .
IEEE COMMUNICATIONS LETTERS, 2018, 22 (12) :2539-2542
[7]  
Biswas S, 2016, EUR SIGNAL PR CONF, P577, DOI 10.1109/EUSIPCO.2016.7760314
[8]  
Boyd Stephen P., 2014, Convex Optimization
[9]   DIMENSIONING NETWORK DEPLOYMENT AND RESOURCE MANAGEMENT IN GREEN MESH NETWORKS [J].
Cai, Lin X. ;
Poor, H. Vincent ;
Liu, Yongkang ;
Luan, Tom H. ;
Shen, Xuemin ;
Mark, Jon W. .
IEEE WIRELESS COMMUNICATIONS, 2011, 18 (05) :58-65
[10]  
Celik Abdulkadir, 2016, IEEE Transactions on Cognitive Communications and Network, V2, P238, DOI 10.1109/TCCN.2016.2608337