A simple relaying strategy for diamond networks

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).


Published in:
2014 Ieee International Symposium On Information Theory (Isit), 1922-1926
Presented at:
IEEE International Symposium on Information Theory (ISIT), Honolulu, HI, JUN 29-JUL 04, 2014
Year:
2014
Publisher:
New York, Ieee
ISBN:
978-1-4799-5186-4
Laboratories:




 Record created 2015-04-13, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)