EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
Spectrum sharing in wireless networks via QoS-aware secondary multicast beamforming
IEEE Transactions on Signal Processing
Power allocation in wireless multi-user relay networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Signal Processing
On optimization of joint base station association and power control via Benders' decomposition
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Wireless Communications
A complete characterization of strong duality in nonconvex optimization with a single constraint
Journal of Global Optimization
Wireless multicast scheduling with switched beamforming antennas
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in years, because it is particularly appealing from a network operator's perspective (e.g., UMTS, 802.16e). When there are many co-channel users and/or the service constraints are stringent, the problem becomes infeasible and some form of admission control is necessary. We advocate a cross-layer approach to joint multiuser transmit beamforming and admission control, aiming to maximize the number of users that can be served at their desired QoS. It is shown that the core problem is NP-hard, yet amenable to convex approximation tools. Two computationally efficient convex approximation algorithms are proposed: one is based on semidefinite relaxation of an equivalent problem reformulation; the other takes a penalized second-order cone approach. Their performance is assessed in a range of experiments, using both simulated and measured channel data. In all experiments considered, the proposed algorithms work remarkably well in terms of the attained performance-complexity trade-off, consistently exhibiting close to optimal performance at an affordable computational complexity.