The approximate optimality of simple schedules for half-duplex multi-relay networks
The approximate optimality of simple schedules for half-duplex multi-relay networks
In ISIT2012 Brahma, Özgür and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with N non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with …