TY - JOUR
T1 - Performance analysis of opportunistic distributed scheduling in multi-user systems
AU - Shmuel, Ori
AU - Cohen, Asaf
AU - Gurewitz, Omer
N1 - Funding Information:
Manuscript received September 11, 2017; revised February 26, 2018; accepted May 12, 2018. Date of publication May 25, 2018; date of current version October 16, 2018. This research was partially supported by the Israeli MOITAL NEPTUN consortium and in part by the European Union Horizon 2020 Research and Innovation Programme SUPERFLUIDITY under Grant 671566. This paper was presented in part at the 2014 IEEE 28th Convention of Electrical & Electronics Engineers in Israel and in part at the 2015 53rd Annual Allerton Conference on Communication, Control, and Computing. The associate editor coordinating the review of this paper and approving it for publication was C. Fischione. (Corresponding author: Ori Shmuel.) The authors are with the Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beersheba 8410501, Israel (e-mail: shmuelor@bgu.ac.il; coasaf@bgu.ac.il; gurewitz@bgu.ac.il).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2018/10/1
Y1 - 2018/10/1
N2 - Consider the problem of a multiple access channel with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and usually only one user may transmit at any given time. Assuming a distributed, opportunistic scheduling algorithm, we analyze the system's properties, such as delay, QoS, and capacity scaling laws. Specifically, we start with analyzing the performance while assuming the users are not necessarily fully backlogged, focusing on the queuing problem and, especially, on the strong dependence between the queues. We first extend a known queuing model by Ephremides and Zhu, to give new results on the convergence of the probability of collision to its average value (as the number of users grows), and hence for the ensuing system performance metrics, such as throughput and delay. This model, however, is limited in the number of users one can analyze. We thus suggest a new model, which is much simpler yet can accurately describe the system behavior when the number of users is large. We then proceed to the analysis of this system under the assumption of time dependent channels. Specifically, we assume each user experiences a different channel state sequence, expressing different channel fluctuations (specifically, the Gilbert-Elliott model). The system performance under this setting is analyzed, along with the channel capacity scaling laws.
AB - Consider the problem of a multiple access channel with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and usually only one user may transmit at any given time. Assuming a distributed, opportunistic scheduling algorithm, we analyze the system's properties, such as delay, QoS, and capacity scaling laws. Specifically, we start with analyzing the performance while assuming the users are not necessarily fully backlogged, focusing on the queuing problem and, especially, on the strong dependence between the queues. We first extend a known queuing model by Ephremides and Zhu, to give new results on the convergence of the probability of collision to its average value (as the number of users grows), and hence for the ensuing system performance metrics, such as throughput and delay. This model, however, is limited in the number of users one can analyze. We thus suggest a new model, which is much simpler yet can accurately describe the system behavior when the number of users is large. We then proceed to the analysis of this system under the assumption of time dependent channels. Specifically, we assume each user experiences a different channel state sequence, expressing different channel fluctuations (specifically, the Gilbert-Elliott model). The system performance under this setting is analyzed, along with the channel capacity scaling laws.
KW - Communication system performance
KW - EVT
KW - dependent-channels
KW - multiple-access
KW - point-process
KW - scaling-laws
UR - http://www.scopus.com/inward/record.url?scp=85047603259&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2018.2840704
DO - 10.1109/TCOMM.2018.2840704
M3 - Article
AN - SCOPUS:85047603259
SN - 1558-0857
VL - 66
SP - 4637
EP - 4652
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 10
M1 - 8365834
ER -