Loading...
conference paper
A simple relaying strategy for diamond networks
2014
2014 Ieee International Symposium On Information Theory (Isit)
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).
Type
conference paper
Web of Science ID
WOS:000346496102012
Authors
Publication date
2014
Publisher
Published in
2014 Ieee International Symposium On Information Theory (Isit)
ISBN of the book
978-1-4799-5186-4
Publisher place
New York
Total of pages
5
Series title/Series vol.
IEEE International Symposium on Information Theory
Start page
1922
End page
1926
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Honolulu, HI | JUN 29-JUL 04, 2014 | |
Available on Infoscience
April 13, 2015
Use this identifier to reference this record