Publication

A simple relaying strategy for diamond networks

Christina Fragouli, Siddhartha Brahma
2014
Conference Papers

Abstract

We consider a Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. Using simple approximations to the capacity of the network, we show that simple relaying strategies involving two relays and two scheduling states can achieve at least half the capacity of the whole network, independent of channel SNRs. The proof uses linear programming duality and implies an algorithm to find such a pair of relays in O(n log n) time(1).

Official source

https://infoscience.epfl.ch/entities/publication/335a4ac0-55c2-49bd-a672-ce97c795da66

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A simple relaying strategy for diamond networks

Chat with Graph Search

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Energy-based comparison between the Fourier-Galerkin method and the finite element method