Optimal time sharing in underlay cognitive radio systems with RF energy harvesting

Due to the fundamental tradeoffs, achieving spectrum efficiency and energy efficiency are two contending design challenges for the future wireless networks. However, applying radio-frequency (RF) energy harvesting (EH) in a cognitive radio system could potentially circumvent this tradeoff, resulting in a secondary system with limitless power supply and meaningful achievable information rates. This paper proposes an online solution for the optimal time allocation (time sharing) between the EH phase and the information transmission (IT) phase in an underlay cognitive radio system, which harvests the RF energy originating from the primary system. The proposed online solution maximizes the average achievable rate of the cognitive radio system, subject to the $\varepsilon$-percentile protection criteria for the primary system. The optimal time sharing achieves significant gains compared to equal time allocation between the EH and IT phases.Comment: Proceedings of the 2015 IEEE International Conference on Communications (IEEE ICC 2015), 8-12 June 2015, London, U

Power Allocation for Energy-Harvesting-based Fading Cognitive Multiple Access Channels: with or without Successive Interference Cancellation

This paper considers a fading cognitive multiple access channel (CMAC), where multiple secondary users (SUs), who share the spectrum with a primary user (PU), transmit to a cognitive base station (CBS). A power station is assumed to harvest energy from the nature and then provide power to the SUs. We investigate the power allocation problems for such a CMAC to maximize the SU sum rate under the interference power constraint, the sum transmit power constraint and the peak transmit power constraint of each individual SU. In particular, two scenarios are considered: with successive interference cancellation (SIC) and without SIC. For the first scenario, the optimal power allocation algorithm is derived. For the second scenario, a heuristic algorithm is proposed. We show that the proposed algorithm with SIC outperforms the algorithm without SIC in terms of the SU sum rate, while the algorithm without SIC outperforms the algorithm with SIC in terms of the number of admitted SUs for a high sum transmit power limit and a low peak transmit power limit of each individual SU