Harmonized Cellular and Distributed Massive MIMO: Load Balancing and Scheduling

Multi-tier networks with large-array base stations (BSs) that are able to operate in the "massive MIMO" regime are envisioned to play a key role in meeting the exploding wireless traffic demands. Operated over small cells with reciprocity-based training, massive MIMO promises large spectral efficiencies per unit area with low overheads. Also, near-optimal user-BS association and resource allocation are possible in cellular massive MIMO HetNets using simple admission control mechanisms and rudimentary BS schedulers, since scheduled user rates can be predicted a priori with massive MIMO. Reciprocity-based training naturally enables coordinated multi-point transmission (CoMP), as each uplink pilot inherently trains antenna arrays at all nearby BSs. In this paper we consider a distributed-MIMO form of CoMP, which improves cell-edge performance without requiring channel state information exchanges among cooperating BSs. We present methods for harmonized operation of distributed and cellular massive MIMO in the downlink that optimize resource allocation at a coarser time scale across the network. We also present scheduling policies at the resource block level which target approaching the optimal allocations. Simulations reveal that the proposed methods can significantly outperform the network-optimized cellular-only massive MIMO operation (i.e., operation without CoMP), especially at the cell edge

Practical Algorithms for Multicast Support in Input Queues Switches

Abstract — This paper deals with multicast flow support in N × N Input Queued switch architectures. A practical approach to support multicast traffic is presented, assuming that O(N) queues are available at each input port. The focus is on dynamic queueing policies, where, at each input port, multicast flows are assigned to one among the available queues when flows become active: flows are assigned to queues according to switch queue status and, possibly, to flow information. We discuss queueing assignments, scheduling algorithms and flow activity definition models. We explain why dynamic queueing disciplines may outperform static policies, and we show that, even in the most favorable conditions for static policies, they provide comparable performance. I

Spectrum Sharing in mmWave Cellular Networks via Cell Association, Coordination, and Beamforming

This paper investigates the extent to which spectrum sharing in mmWave networks with multiple cellular operators is a viable alternative to traditional dedicated spectrum allocation. Specifically, we develop a general mathematical framework by which to characterize the performance gain that can be obtained when spectrum sharing is used, as a function of the underlying beamforming, operator coordination, bandwidth, and infrastructure sharing scenarios. The framework is based on joint beamforming and cell association optimization, with the objective of maximizing the long-term throughput of the users. Our asymptotic and non-asymptotic performance analyses reveal five key points: (1) spectrum sharing with light on-demand intra- and inter-operator coordination is feasible, especially at higher mmWave frequencies (for example, 73 GHz), (2) directional communications at the user equipment substantially alleviate the potential disadvantages of spectrum sharing (such as higher multiuser interference), (3) large numbers of antenna elements can reduce the need for coordination and simplify the implementation of spectrum sharing, (4) while inter-operator coordination can be neglected in the large-antenna regime, intra-operator coordination can still bring gains by balancing the network load, and (5) critical control signals among base stations, operators, and user equipment should be protected from the adverse effects of spectrum sharing, for example by means of exclusive resource allocation. The results of this paper, and their extensions obtained by relaxing some ideal assumptions, can provide important insights for future standardization and spectrum policy.Comment: 15 pages. To appear in IEEE JSAC Special Issue on Spectrum Sharing and Aggregation for Future Wireless Network

Distributed Multicell Beamforming Design Approaching Pareto Boundary with Max-Min Fairness

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.Comment: 8 figures. To Appear in IEEE Trans. Wireless Communications, 201