作者: Sinchan Biswas , Amirpasha Shirazinia , Subhrakanti Dey
DOI: 10.1109/EUSIPCO.2016.7760314
关键词: Computer science 、 Heuristic 、 Convex optimization 、 Optimization problem 、 Communication channel 、 Heuristic (computer science) 、 Channel state information 、 Stochastic control 、 Throughput (business) 、 Mathematical optimization 、 Fading 、 Cognitive radio 、 Throughput 、 Time horizon
摘要: The paper investigates the problem of maximizing expected achievable sum rate in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing. We formulate as maximization throughput over finite time horizon subject to averaged interference constraint at primary (PU) almost sure causality constraints SUs. is mixed integer nonlinear program with respect two decision variables, namely, sensing decision, continuous variables transmission power. In general, this known be NP hard. For optimization these we use an exhaustive search policy length small, heuristic for longer horizons. given values simplifies into joint on SU power time, which non-convex nature. present analytic solution resulting using alternating convex non-causal channel state information harvested patterns base station (SBS) or fusion center (FC) infinite battery capacity transmitters. causal stochastic control solve it technique dynamic programming. Numerical results are presented illustrate performance various algorithms.