In this paper, we study the joint power control and scheduling in uplink massive multiple-input multiple-output (MIMO) systems with random data arrivals. The data is generated at each user according to an individual stochastic process. Using Lyapunov optimization techniques, we develop a dynamic scheduling algorithm (DSA), which decides at each time slot the amount of data to admit to the transmission queues and the transmission rates over the wireless channel. The proposed algorithm achieves nearly optimal performance on the long-term user throughput under various fairness policies. Simulation results show that the DSA can improve the time-average delay performance compared to the state-of-the-art power control schemes developed for Massive MIMO with infinite backlogs.
The basis of stochastic network optimization was presented in @cite_2 , with many examples of its applications to communication and queueing systems. Flow control algorithms in a heterogeneous network using Lyapunov optimization techniques were proposed in @cite_8 . Furthermore, @cite_5 gives an overview of cross-layer control and scheduling algorithms using the drift-plus-penalty framework to achieve stability while optimizing some network performance metric. MIMO downlink scheduling using the flow control algorithm was studied in @cite_9 , where the backlog at the BS is assumed to be infinite. Due to the difficulty of solving the weighted sum rate maximization problem, an on-off scheduling policy was considered as an approximation of the optimal rate allocation problem. A dynamic scheduling scheme using Lyapunov techniques was developed in @cite_3 for millimeter wave-enabled Massive MIMO systems, after some simplifying assumptions on the rate expressions. Note that @cite_12 proposes an effective algorithm to solve the weighted sum rate maximization problem for Massive MIMO systems with i.i.d. Rayleigh fading channels, which facilitate the application of Lyapunov optimization in Massive MIMO with random data traffic.
@cite_8 @cite_9 @cite_3 @cite_2 @cite_5 @cite_12
2081893537 2038519345 2047468088 1970830346
Consider media streaming in MIMO interference networks whereby multiple base stations (BS) simultaneously deliver media to their associated users using fixed data rates. The performance is fundamentally limited by the cross-link interference. We propose a cache-induced opportunistic cooperative MIMO (CoMP) for interference mitigation. By caching a portion of the media files, the BSs opportunistically employ CoMP to transform the cross-link interference into spatial multiplexing gain. We study a mixed-timescale optimization of MIMO precoding and cache control to minimize the transmit power under the rate constraint. The cache control is to create more CoMP opportunities and is adaptive to the long-term popularity of the media files. The precoding is to guarantee the rate requirement and is adaptive to the channel state information and cache state at the BSs. The joint stochastic optimization problem is decomposed into a short-term precoding and a long-term cache control problem. We propose a precoding algorithm which converges to a stationary point of the short-term problem. Based on this, we exploit the hidden convexity of the long-term problem and propose a low complexity and robust solution using stochastic subgradient. The solution has significant gains over various baselines and does not require explicit knowledge of the media popularity. We propose a novel MIMO cooperation framework called the cache-induced opportunistic cooperative MIMO (Coop-MIMO) for video streaming in backhaul limited multicell MIMO networks. By caching a portion of the video files, the base stations (BSs) opportunistically employ Coop-MIMO transmission to achieve MIMO cooperation gain without expensive payload backhaul. We derive closed form expressions of various video streaming performance metrics for cache-induced opportunistic Coop-MIMO and investigate the impact of BS level caching and key system parameters on the performance. Specifically, we first obtain a mixed fluid-diffusion limit for the playback buffer queueing system. Then we derive the approximated video streaming performance using the mixed fluid-diffusion limit. Based on the performance analysis, we formulate the joint optimization of cache control and playback buffer management as a stochastic optimization problem. Then we derive a closed form solution for the playback buffer thresholds and develop a stochastic subgradient algorithm to find the optimal cache control. The analysis shows that the video streaming performance improves linearly with the BS cache size BC, the transmit power cost decreases exponentially with BC, and the backhaul cost decreases linearly with BC. Large multiple-input multiple-output (MIMO) networks promise high energy efficiency, i.e., much less power is required to achieve the same capacity compared to the conventional MIMO networks if perfect channel state information (CSI) is available at the transmitter. However, in such networks, huge overhead is required to obtain full CSI especially for Frequency-Division Duplex (FDD) systems. To reduce overhead, we propose a downlink antenna selection scheme, which selects S antennas from M > S transmit antennas based on the large scale fading to serve K ≤ S users in large distributed MIMO networks employing regularized zero-forcing (RZF) precoding. In particular, we study the joint optimization of antenna selection, regularization factor, and power allocation to maximize the average weighted sum-rate. This is a mixed combinatorial and non-convex problem whose objective and constraints have no closed-form expressions. We apply random matrix theory to derive asymptotically accurate expressions for the objective and constraints. As such, the joint optimization problem is decomposed into subproblems, each of which is solved by an efficient algorithm. In addition, we derive structural solutions for some special cases and show that the capacity of very large distributed MIMO networks scales as O(KlogM) when M→∞ with K, S fixed. Simulations show that the proposed scheme achieves significant performance gain over various baselines. Consider the multiple-input multiple-output (MIMO) interfering broadcast channel whereby multiple base stations in a cellular network simultaneously transmit signals to a group of users in their own cells while causing interference to each other. The basic problem is to design linear beamformers that can maximize the system throughput. In this paper, we propose a linear transceiver design algorithm for weighted sum-rate maximization that is based on iterative minimization of weighted mean-square error (MSE). The proposed algorithm only needs local channel knowledge and converges to a stationary point of the weighted sum-rate maximization problem. Furthermore, the algorithm and its convergence can be extended to a general class of sum-utility maximization problem. The effectiveness of the proposed algorithm is validated by numerical experiments.