Distributed Multicell Beamforming Design Approaching Pareto Boundary with Max-Min Fairness
2012 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 11, no 8, 2921-2933 p.Article in journal (Refereed) Published
This paper addresses coordinated downlink beamforming optimization in multicell time division duplex (TDD) systems where a small number of parameters are exchanged between cells but with no data sharing. With the goal to reach the point on the Pareto boundary with max-min rate fairness, we first develop a two-step centralized optimization algorithm to design the joint beamforming vectors. This algorithm can achieve a further sum-rate improvement over the max-min optimal performance, and is shown to guarantee max-min Pareto optimality for scenarios with two base stations (BSs) each serving a single user. To realize a distributed solution with limited intercell communication, we then propose an iterative algorithm by exploiting an approximate uplink-downlink duality, in which only a small number of positive scalars are shared between cells in each iteration. Simulation results show that the proposed distributed solution achieves a fairness rate performance close to the centralized algorithm while it has a better sum-rate performance, and demonstrates a better tradeoff between sum-rate and fairness than the Nash Bargaining solution especially at high signal-to-noise ratio.
Place, publisher, year, edition, pages
2012. Vol. 11, no 8, 2921-2933 p.
Distributed processing, multicell downlink beamforming, Pareto boundary, uplink-downlink duality
IdentifiersURN: urn:nbn:se:kth:diva-102203DOI: 10.1109/TWC.2012.061912.111751ISI: 000307904600024ScopusID: 2-s2.0-84865351166OAI: oai:DiVA.org:kth-102203DiVA: diva2:551477
FunderICT - The Next Generation
QC 201209282012-09-112012-09-112013-04-11Bibliographically approved