TY - GEN
T1 - Scheduling Optimization for Mixed-type Devices of IoT in Massive MIMO Systems with Spatio-Temporal Traffic
AU - Zhang, Qi
AU - Yang, Howard H.
AU - Quek, Tony Q.S.
AU - Jin, Shi
N1 - Funding Information:
This paper was supported by the National Natural Science Foundation of China under Grant 61801244, and the Natural Science Foundation of Jiangsu Province under Grant BK20180754.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/10/21
Y1 - 2020/10/21
N2 - In this paper, we develop a framework for the analysis of massive multiple-input multiple-output (MIMO) systems where various types of devices with different configurations and requirements co-exist, taking into account both the spatial and temporal random traffic. A closed-form approximation of the spatial mean packet throughput which denotes the average number of packets that are successfully transmitted at any unit time slot and area is derived by using tools from stochastic geometry and queuing theory. Based on it, we investigate the optimal scheduling number for each type of device that maximizes the spatial mean packet throughput while meeting devices' delay demands. It is found that when the BS antenna number (M) goes to infinity, the BS should schedule all devices under its coverage, regardless of devices' variations. However, when M is finite, the BS should have a bias on scheduling devices with heavier arrival traffic and lower decoding threshold. On the basis of this, if the delay constraint of one device becomes stricter, the BS will allocate extra shares of the scheduling quantity to it, and this allocation acts more evidently with small-scale BS antennas.
AB - In this paper, we develop a framework for the analysis of massive multiple-input multiple-output (MIMO) systems where various types of devices with different configurations and requirements co-exist, taking into account both the spatial and temporal random traffic. A closed-form approximation of the spatial mean packet throughput which denotes the average number of packets that are successfully transmitted at any unit time slot and area is derived by using tools from stochastic geometry and queuing theory. Based on it, we investigate the optimal scheduling number for each type of device that maximizes the spatial mean packet throughput while meeting devices' delay demands. It is found that when the BS antenna number (M) goes to infinity, the BS should schedule all devices under its coverage, regardless of devices' variations. However, when M is finite, the BS should have a bias on scheduling devices with heavier arrival traffic and lower decoding threshold. On the basis of this, if the delay constraint of one device becomes stricter, the BS will allocate extra shares of the scheduling quantity to it, and this allocation acts more evidently with small-scale BS antennas.
UR - http://www.scopus.com/inward/record.url?scp=85099450392&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85099450392&partnerID=8YFLogxK
U2 - 10.1109/WCSP49889.2020.9299751
DO - 10.1109/WCSP49889.2020.9299751
M3 - Conference contribution
AN - SCOPUS:85099450392
T3 - 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020
SP - 74
EP - 79
BT - 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020
Y2 - 21 October 2020 through 23 October 2020
ER -