cs.IT

(what is this?)

# Title: Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis

Abstract: Consider the problem of a multiple access channel in a time dependent environment 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 analyse the system's properties, such as delay, QoS and capacity scaling laws. Specifically, we start with analyzing the performance while \emph{assuming the users are not necessarily fully backlogged}, focusing on the queueing problem and, especially, on the \emph{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 behaviour 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 analysed, along with the channel capacity scaling laws.
 Comments: arXiv admin note: substantial text overlap with arXiv:1507.03255 Subjects: Information Theory (cs.IT) Cite as: arXiv:1709.04361 [cs.IT] (or arXiv:1709.04361v1 [cs.IT] for this version)

## Submission history

From: Ori Shmuel [view email]
[v1] Tue, 12 Sep 2017 07:55:30 GMT (4543kb,D)