DocumentCode :
266544
Title :
Scalable coordinated beamforming for dense wireless cooperative networks
Author :
Yuanming Shi ; Jun Zhang ; Letaief, Khaled B.
Author_Institution :
Dept. of ECE, Hong Kong Univ. of Sci. & Technol., Hong Kong, China
fYear :
2014
fDate :
8-12 Dec. 2014
Firstpage :
3603
Lastpage :
3608
Abstract :
To meet the ever growing demand for both high throughput and uniform coverage in future wireless networks, dense network deployment will be ubiquitous, for which cooperation among the access points is critical. Considering the computational complexity of designing coordinated beamformers for dense networks, low-complexity and suboptimal precoding strategies are often adopted. However, it is not clear how much performance loss will be caused. To enable optimal coordinated beamforming, in this paper, we propose a framework to design a scalable beamforming algorithm based on the alternative direction method of multipliers (ADMM). Specifically, we first propose to apply the matrix stuffing technique to transform the original optimization problem to an equivalent ADMM-compliant problem, which is much more efficient than the widely-used modeling framework CVX. We will then propose to use the ADMM algorithm, a.k.a. the operator splitting method, to solve the transformed ADMM-compliant problem efficiently. In particular, the subproblems of the ADMM algorithm at each iteration can be solved with closed-forms and in parallel. Simulation results show that the proposed techniques can result in significant computational efficiency compared to the state-of-the-art interior-point solvers. Furthermore, the simulation results demonstrate that the optimal coordinated beamforming can significantly improve the system performance compared to sub-optimal zero forcing beamforming.
Keywords :
array signal processing; computational complexity; cooperative communication; matrix algebra; optimisation; precoding; radio networks; ADMM- compliant problem; access point; alternative direction method of multiplier; computational complexity; dense network deployment; dense wireless cooperative network; interior-point solver; matrix stuffing technique; optimization problem; scalable coordinated beamforming algorithm; suboptimal precoding strategy; suboptimal zero forcing beamforming; Algorithm design and analysis; Array signal processing; Computational complexity; Optimization; Signal processing algorithms; Transforms; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Communications Conference (GLOBECOM), 2014 IEEE
Conference_Location :
Austin, TX
Type :
conf
DOI :
10.1109/GLOCOM.2014.7037367
Filename :
7037367
Link To Document :
بازگشت