Wireless Network Simplification: the Gaussian N-Relay Diamond Network

Nazaroglu C., Oezguer A., Fragouli C.

IEEE International Symposium on Information Theory (ISIT), St Petersburg, Russia, 31 July - 05 August 2011 identifier

  • Publication Type: Conference Paper / Full Text
  • City: St Petersburg
  • Country: Russia
  • Middle East Technical University Affiliated: Yes


We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the N available relays? We show that in every Gaussian N-relay diamond network, there exists a subset of k relays which alone provide approximately k/k+1 of the total capacity. The result holds independent of the number of available relay nodes N, the channel configurations and the operating SNR. The result is tight in the sense that there exists channel configurations for N-relay diamond networks, where every subset of k relays can provide at most k/k+1 of the total capacity. The approximation is within 3 log N + 3k bits/s/Hz to the capacity.