000161911 001__ 161911
000161911 005__ 20180317093335.0
000161911 037__ $$aREP_WORK
000161911 245__ $$aNetwork Simplification: the Gaussian N-Relay Diamond Network
000161911 260__ $$c2010
000161911 269__ $$a2010
000161911 300__ $$a8
000161911 336__ $$aReports
000161911 500__ $$aFull-text available upon request.
000161911 520__ $$aWe consider the Gaussian $N$-relay diamond network, where a source wants to communicate to a destination 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$ relays? We show that in every Gaussian $N$-relay diamond network, there exists a subset of $k$ relays which alone provide approximately a fraction $\frac{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 approximation is within $3\log N+3k$ bits/s/Hz to the capacity. 
000161911 6531_ $$awireless networks, relaying, cooperative communication, network simplification, relay selection
000161911 700__ $$aNazaroglu, Caner
000161911 700__ $$0241934$$aÖzgür Aydin, Ayfer$$g168198
000161911 700__ $$0240968$$aFragouli, Christina$$g161832
000161911 909CO $$ooai:infoscience.tind.io:161911$$preport
000161911 909C0 $$0252185$$pARNI$$xU11353
000161911 917Z8 $$x168198
000161911 937__ $$aEPFL-REPORT-161911
000161911 973__ $$aEPFL$$sPUBLISHED
000161911 980__ $$aREPORT