Delay Efficient D2D Communications over 5G Edge-Computing Mobile Networks

Device to Device (D2D) communication scheduling is fundamental for data offloading in fifth-generation (5G) edge-computing mobile networks. Suppose there are multiple users which aim to fetch cached popular contents locally via data offloading, and assume each device user has a demand, the objective is to seek an interference-aware schedule of transmission activities with minimum delay to satisfy all demands. We consider the problem with the duty-cycled constraint. We propose a combinatorial algorithm under the duty-cycled model. The approximation factor is independent of the cycling period length, while most existing methods for duty-cycled scheduling are accompanied with large approximation bounds that increase linearly with the cycling period length of the duty-cycled model.