Dynamic Resource Allocation in Co-Located and Cell-Free Massive MIMO

November 13, 2019 Β· Declared Dead Β· πŸ› IEEE Transactions on Green Communications and Networking

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zheng Chen, Emil BjΓΆrnson, Erik G. Larsson arXiv ID 1911.07301 Category cs.IT: Information Theory Cross-listed cs.NI Citations 39 Venue IEEE Transactions on Green Communications and Networking Last Checked 6 months ago
Abstract
In this paper, we study joint power control and scheduling in uplink massive multiple-input multiple-output (MIMO) systems with randomly arriving data traffic. We consider both co-located and Cell-Free (CF) Massive MIMO, where the difference lies in whether the antennas are co-located at the base station or spread over a wide network area. 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 optimizes the long-term user throughput under various fairness policies while keeping the transmission queues stable. Simulation results show that the state-of-the-art power control schemes developed for Massive MIMO with infinite backlogs can fail to stabilize the system even when the data arrival rates are within the network capacity region. Our proposed DSA shows advantage in providing finite delay with performance optimization whenever the network can be stabilized.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted