4 years ago

Asymptotically Optimal Scheduling for Compute-and-Forward.

Omer Gurewitz, Asaf Cohen, Ori Shmuel

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 the relay is able to decode. In fact, it goes to zero very fast with $L$. Therefore, in each transmission phase only a fixed number of users should transmit, i.e., \emph{users should be scheduled.}

In this work, we provide an asymptotically optimal, polynomial time scheduling algorithm for CF. We show that scheduling under CF not only guarantees non-zero rate, it provides a gain in the system sum-rate, up to the optimal scaling law of $O(\log{\log{L}})$. We do this by first fixing a good, yet sub-optimal, coefficients vector, and devising a polynomial time algorithm to find a sub-set of the users whose channel gains matches the vector. We then prove that this choice is asymptotically optimal.

Publisher URL: http://arxiv.org/abs/1801.03259

DOI: arXiv:1801.03259v2

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.