Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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).