Conflict-Free Scheduling for Partially Connected D2D Networks With Network Coding

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.