Global Optimization Algorithm and sub-optimal algorithms for power allocation in two-way relay assisted cognitive radio networks
Udit Pareek, Daniel C. Lee · International Conference on Signal Processing and Communication Systems · 2011
In this paper, we consider a two-way cognitive relay network comprising two sources and multiple relays. The relays use a simple Amplify-and-Forward relaying mechanism. For such networks, we formulate the max-min and sum capacity optimization problems. The formulated optimization problems are non-convex and nonlinear in nature. We obtain the optimal solution of the optimization problems by using a known technique called Global Optimization Algorithm (GOP). We note that the computational complexity of the GOP algorithm grows exponentially with the number of relays. Therefore, we propose low-complexity heuristics that provide suboptimal solutions to the given optimization problems. The simulation results show that the performance of the heuristics is close to that of the respective optimal solutions.
Cited by 6 works. doi:10.1109/icspcs.2011.6140819
Authors
References
- Convex Optimization
- Cognitive radio: brain-empowered wireless communications
- Generalized Benders decomposition
- Federal Communications Commission
- Spectral efficient protocols for half-duplex fading relay channels
- A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Power allocation for F/TDMA multiuser two-way relay networks
- Beamforming and Power Control for Multi-Antenna Cognitive Two-Way Relaying
- Adaptive Power Allocation in Two-Way Amplify-and-Forward Relay Networks