Date Added: Jan 2010
The authors maximize the minimum rate of each information flow in a multi-source, multi-relay, single destination cooperative network. The relays use the decode-and-forward protocol while all transmissions use OFDM. The key to their approach is fractional cooperation wherein not all source subcarriers are relayed. There may, therefore, be fewer relays than sources. Finding the optimal allocation relay subcarriers to sources is combinatorial and has exponential complexity. They develop an upper bound on the max-min rate and present an algorithm which performs very close to this upper bound.