Scheduling Cooperative IoT Devices in High-Dense Cellular Systems with QoS Guarantees.

We consider a cellular network with N Base Stations (BS) serving N groups of IoT devices. Each group has M devices requesting the same data and, thus, are allowed to cooperate. We are interested in finding the optimum BS-group assignment such that the network's sum throughput is maximized. One of the main challenges in this problem is the quality-of-service (QoS) that is requested by each group in terms of a hard-deadline imposed on each packet. This problem captures a number of IoT applications including autonomous driving, health-care systems as well as wireless sensors in industry automation systems. We present a polynomial-time scheduling algorithm and show that it is throughput optimal. Through simulations, we show that the although the increase in number of users per group overloads the system, but the throughput increases due to the cooperation among these users. In addition, we show the superiority of our presented algorithm over baseline algorithms.