TY - GEN

T1 - On the outage probability of distributed MAC with ZF detection

AU - Kampeas, Joseph

AU - Cohen, Asaf

AU - Gurewitz, Omer

N1 - Publisher Copyright:
© 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.

PY - 2018/7/2

Y1 - 2018/7/2

N2 - 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 channel capacity 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.

AB - 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 channel capacity 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.

UR - http://www.scopus.com/inward/record.url?scp=85062073951&partnerID=8YFLogxK

U2 - 10.1109/ITW.2018.8613472

DO - 10.1109/ITW.2018.8613472

M3 - Conference contribution

AN - SCOPUS:85062073951

T3 - 2018 IEEE Information Theory Workshop, ITW 2018

BT - 2018 IEEE Information Theory Workshop, ITW 2018

PB - Institute of Electrical and Electronics Engineers

T2 - 2018 IEEE Information Theory Workshop, ITW 2018

Y2 - 25 November 2018 through 29 November 2018

ER -