Throughput optimized multi-source cooperative networks with compute-and-forward

In this work, we investigate a multi-source multicast network with the aid of multiple relays, where it is assumed that no direct link is available at each S-D pair. The aim is to maximum the common multicast throughput of all source nodes. A transmission protocol employing the relaying strategy, namely, compute-and-forward (CPF), is proposed. Both the delay-stringent transmission and the delay-tolerant transmission applications are investigated. The associated optimization problems to maximum the short-term and long-term common multicast throughput are formulated and solved. Performance comparisons show that the CPF strategy outperforms conventional decode-and-forward (DF) strategy.