On the Outage Probability of Distributed MAC with ZF Detection

Joseph Kampeas, Asaf Cohen, Omer Gurewitz

Research output: Contribution to journalArticlepeer-review


Distributed scheduling is an attractive approach for the Multiple-Access Channel (MAC). However, when a subset of the users access the channel simultaneously, distributed rate coordination is necessary, and is a major challenge, since the achievable rate of each user highly depends on the channels of other active users. That is, given a detection technique, e.g., Zero-Forcing (ZF), the rate at which a user can transmit depends on the channels other transmitting users have, a knowledge which is usually unavailable in distributed schemes. Fixing a rate and accepting some outage probability when this rate is too high is common practice in these cases. In this paper, we analyze the outage probability of a distributed, asymptotically optimal threshold-based scheduling algorithm under ZF. We rigorously evaluate the distribution of the relevant projections and give upper and lower bounds on the outage probability as a function of the algorithm parameters. At the limit of a large number of users, the bounds match, resulting in the true asymptotic characterization of the outage probability.

Original languageAmerican English
Article number9312628
Pages (from-to)2398-2412
Number of pages15
JournalIEEE Transactions on Communications
Issue number4
StatePublished - 1 Apr 2021


  • Multiple access channel
  • distributed scheduling
  • outage probability
  • zero forcing

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'On the Outage Probability of Distributed MAC with ZF Detection'. Together they form a unique fingerprint.

Cite this