Optimal power allocation for green cognitive radio: fractional programming approach. Issue 12 (1st August 2013)

• Record Type: Journal Article
• Authors: Naeem, Muhammad; Illanko, Kandasamy; Karmokar, Ashok; Anpalagan, Alagan; Jaseemuddin, Muhammad
• Is Part Of: IET communications. Volume 7:Issue 12(2013)
• Page Start: 1279
• Page End: 1286
• Publication Date: 2013-08-01
• Subjects: cognitive radio -- concave programming -- environmental factors -- iterative methods -- nonlinear programming; optimal power allocation -- green cognitive radio -- constrained fractional programming problem -- energy‐efficient fractional objective -- nonlinear nonconvex optimisation problem -- energy‐efficient maximisation problem -- parametric optimisation problem -- iterative power allocation algorithm -- ε‐optimal solution -- energy‐efficient cognitive radio networks -- interference threshold level -- primary users -- secondary users; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2012.0604
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : In this study, the problem of determining the power allocation that maximises the energy efficiency of cognitive radio network is investigated as a constrained fractional programming problem. The energy‐efficient fractional objective is defined in terms of bits per Joule per Hertz. The proposed constrained fractional programming problem is a non‐linear non‐convex optimisation problem. The authors first transform the energy‐efficient maximisation problem into a parametric optimisation problem and then propose an iterative power allocation algorithm that guarantees ε ‐optimal solution. A proof of convergence is also given for the ε ‐optimal algorithm. The proposed ε ‐optimal algorithm provide a practical solution for power allocation in energy‐efficient cognitive radio networks. In simulation results, the effect of different system parameters (interference threshold level, number of primary users and number of secondary users) on the performance of the proposed algorithms are investigated.