Asymptotically optimal scheduling for compute-and-forward

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Consider a Compute and Forward (CF) relay network with L users and a single relay. The relay tries to decode a linear function of the transmitted signals. For such a network, letting all L users transmit simultaneously, especially when L is large, causes a significant degradation in the rate in which the relay is able to decode. In fact, the rate goes to zero very fast with L. Therefore, in each transmission phase only a fixed number of users should transmit, i.e., users should be scheduled. In this work, we examine the problem of scheduling for CF and lay the foundations for identifying the optimal schedule which, to date, lacks a clear understanding. Specifically, we start with insights why when the number of users is large, good scheduling opportunities can be found. Then, we provide an asymptotically optimal, polynomial time scheduling algorithm and analyze it's performance. We conclude that scheduling under CF provides a gain in the system sum-rate, up to the optimal scaling law of O(log log L).

Original languageAmerican English
Title of host publication2018 IEEE Information Theory Workshop, ITW 2018
ISBN (Electronic)9781538635995
StatePublished - 2 Jul 2018
Event2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China
Duration: 25 Nov 201829 Nov 2018

Publication series

Name2018 IEEE Information Theory Workshop, ITW 2018


Conference2018 IEEE Information Theory Workshop, ITW 2018

All Science Journal Classification (ASJC) codes

  • Information Systems


Dive into the research topics of 'Asymptotically optimal scheduling for compute-and-forward'. Together they form a unique fingerprint.

Cite this