Abstract
In this letter, we study the problem of distributing data to a group of partially connected cooperative D2D networks using network coding. In such a scenario, the transmission conflicts occur from simultaneous transmissions of multiple devices, where the scheduling decision should be made not only on the encoded packets but also on the set of transmitting devices. We formulate the joint optimization problem over the set of transmitting devices and the packet combinations with a conflict-free graph model, which contains both coding conflict and transmission conflict. We also propose a heuristic solution for this setup by finding the maximum independent set in the conflict-free graph. Simulation results show that our coding scheme significantly reduces the number of transmission slots.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
