Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.