Massive MIMO Networks with Spatio-Temporal Traffic: Scheduling Mechanism Optimization

Qi Zhang, Howard H. Yang, Tony Q.S. Quek, Shi Jin

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

In this letter, we develop a framework for the analysis of massive multiple-input multiple-output (MIMO) networks with both spatial and temporal random arrival of traffic, which is important in the next generation network but has not been investigated before. Using stochastic geometry and queueing theory, we derive a tight closed-form approximation for the average number of packets successfully transmitted at any unit time slot and area, referred to as spatial mean packet throughput ( T ). To maximize T , we find that when the number of BS antennas ( M ) is much larger than the average number of devices per cell ( {mathcal{ N}}_{tt S} ), the BS should schedule as many devices as possible; however, when M is smaller or comparable with {mathcal{ N}}_{tt S} , scheduling too many devices will bring significant impairment on T , and the optimal number of scheduled devices should be obtained from our proposed solution. To further quantify this conclusion, we also present M/{mathcal{ N}}_{tt S} as the criteria to choose proper scheduling mechanisms. The effectiveness of our optimal solutions has been verified via simulations.

原文English
文章編號9110500
頁(從 - 到)2339-2343
頁數5
期刊IEEE Communications Letters
24
發行號10
DOIs
出版狀態Published - 2020 十月

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

指紋 深入研究「Massive MIMO Networks with Spatio-Temporal Traffic: Scheduling Mechanism Optimization」主題。共同形成了獨特的指紋。

引用此