Performance Analysis of Opportunistic Distributed Scheduling In Multi-User Systems
- 25 May 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. PP (00906778) , 1
Abstract
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 queueing problem and, especially, on the strong dependence between the queues. We first extend a known queueing 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 describes 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.Keywords
This publication has 55 references indexed in Scilit:
- Opportunistic Multichannel Aloha: Distributed Multiaccess Control Scheme for OFDMA Wireless NetworksIEEE Transactions on Vehicular Technology, 2006
- Resource Allocation and Cross-Layer Control in Wireless NetworksFoundations and Trends® in Networking, 2006
- On the capacity of spatially correlated mimo rayleigh-fading channelsIEEE Transactions on Information Theory, 2003
- Opportunistic transmission scheduling with resource-sharing constraints in wireless networksIEEE Journal on Selected Areas in Communications, 2001
- Finite-state Markov model for Rayleigh fading channelsIEEE Transactions on Communications, 1999
- Stability conditions for some distributed systems: buffered random access systemsAdvances in Applied Probability, 1994
- Dynamic server allocation to parallel queues with randomly varying connectivityIEEE Transactions on Information Theory, 1993
- Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered usersIEEE Transactions on Automatic Control, 1981
- Limit Theorems for Extreme Values of Chain-Dependent ProcessesThe Annals of Probability, 1975
- Limit theorems for sums of chain-dependent processesJournal of Applied Probability, 1974