Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis Academic Article uri icon

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 (eg, 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 …

publication date

  • September 12, 2017