Joint Coding and Scheduling Optimization in Wireless D2D Networks

In this paper, we study the problem of distributing data to a group of partially connected cooperative D2D network using network coding. In such a scenario, the transmission conflicts occur from simultaneous transmissions of multiple devices, and the scheduling decision should be made not only on the encoded packets but also on the set of transmitting devices. We give a relaxed formulation of the joint optimization problem over the set of transmitting devices and the packet combinations and analyze the lower bound. We also propose a heuristic solution for this setup using a conflict graph and local graph at every device. Simulation results show that our coding scheme significantly reduces the number of transmission slots.