“Wireless networks without edges”: Dynamic radio resource clustering and user scheduling

Cellular systems using Coordinated Multi-Point (CoMP) transmissions leveraging clusters of spatially distributed radio antennas as Virtual Base Stations (VBSs) have the potential to realize overall throughput gains and, perhaps more importantly, can deliver substantial enhancement to poor performing “edge” users. In this paper we propose a novel framework aimed at fully exploiting the potential of such systems through dynamic radio resource clustering and user scheduling which maximize system utility. The dynamic clustering problem is modeled as a maximum weight clustering problem which is NP-hard, however, we show that by structuring the set of possible VBSs to be “2-decomposable” it can be efficiently computed. We also propose to optimize over a class of power allocation policies to radio resources, and thus VBSs, which allow dynamic user scheduling and flexible power allocations depending on instantaneous channel realizations. We use simulation to compare our approach with a state-of-the-art baseline which exploits dynamic frequency reuse and opportunistic user scheduling, but no clustering, and show edge users' throughput gains are as high as 80% without degrading the performance of others.

[1]  R. Häggkvist,et al.  Bipartite graphs and their applications , 1998 .

[2]  Rahim Tafazolli,et al.  On the Evolution of Multi-Cell Scheduling in 3GPP LTE / LTE-A , 2013, IEEE Communications Surveys & Tutorials.

[3]  Zhi-Quan Luo,et al.  Joint Base Station Clustering and Beamformer Design for Partial Coordinated Transmission in Heterogeneous Networks , 2012, IEEE Journal on Selected Areas in Communications.

[4]  J. Munkres ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[5]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[6]  C-ran the Road towards Green Ran , 2022 .

[7]  Donald E. Knuth,et al.  Dancing links , 2000, cs/0011047.

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[9]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[10]  Andrea J. Goldsmith,et al.  On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming , 2006, IEEE Journal on Selected Areas in Communications.

[11]  Gerhard Wunder,et al.  Self-organizing distributed inter-cell beam coordination in cellular networks with best effort traffic , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[12]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..

[13]  Harish Viswanathan,et al.  Self-Organizing Dynamic Fractional Frequency Reuse for Best-Effort Traffic through Distributed Inter-Cell Coordination , 2009, IEEE INFOCOM 2009.

[14]  Jeffrey G. Andrews,et al.  Fundamental Limits of Cooperation , 2012, IEEE Transactions on Information Theory.

[15]  Gerhard Wunder,et al.  Autonomous Distributed Power Control Algorithms for Interference Mitigation in Multi-Antenna Cellular Networks , 2011, EW.