2014 · 11 citations · 14 references
EngineeringCommunicationElectrical EngineeringDigital CommunicationOptimizationWireless CommunicationsCognitive RadioConvex OptimizationMultiple Access TechniquesOptimization TheoryStochastic OptimizationWireless NetworksCognitive Radio NetworksCognitive Radio Resource AllocationLower Bound ComputationNp-hardnessOptimal Power ControlRadio Resource ManagementUpper Bound Computation
In this paper, we consider the rate maximization of a new cognitive ratio (CR) scenario when multiple primary users (PU) are operating under the simultaneous wireless information and power transfer (SWIPT) mode. Since the rate maximization problem is NP-hard, we separate the derivation approach into the following two steps: (i) we prove that the optimal transmit covariance is of rank-one; (ii) we apply the semi-definite programming (SDP) relaxation. Two suboptimal algorithms that provide the upper bound and the lower bound of the original solutions are proposed to cope with this NP-hard problem. The duality gap is demonstrated to be very small by Monte Carlo simulations.
14
Semidefinite Relaxation of Quadratic Optimization Problems
Zhi‐Quan Luo, Wing‐Kin Ma, Anthony Man–Cho So et al. · IEEE Signal Processing Magazine · 2010 · 3.6K citations
Transporting information and energy simultaneously
Lav R. Varshney · 2008 · 1.8K citations