##
Wireless network simplification: the Gaussian N-relay diamond network

We consider the Gaussian N-relay diamond net- work, 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 of the total k+1 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 of the total capacity. The k+1 approximation is within 3 log N + 3k bits/s/Hz to the capacity. This result also provides a new approximation to the capacity of the Gaussian N-relay diamond network which is up to a multiplicative gap of 1 and additive gap of 3 log N + 3k. k+1 The current approximation results in the literature either aim to characterize the capacity within an additive gap by allowing no multiplicative gap or vice a versa. Our result suggests a new approximation approach where multiplicative and additive gaps are allowed simultaneously and are traded through an auxiliary parameter.1

Presented at:

IEEE International Symposium on Information Theory (ISIT'11), St Petersburg, Russia, July 31-August 5, 2011

Laboratories:

Record created 2012-01-25, last modified 2018-01-28