Toward Optimal Resource Scheduling for Internet of Things Under Imperfect CSI

Abstract

The Internet of Things (IoT) increases the number of connected devices and supports the ever-growing complexity of applications. Owing to the constrained physical size, the IoT devices can significantly enhance the computational capacity by offloading computation-intensive tasks to the resource-rich edge servers deployed at the base station (BS) via wireless networks. However, how to achieve optimal resource scheduling remains a challenge due to stochastic task arrivals, time-varying wireless channels, and imperfect estimation of channel state information (CSI). In this article, by virtue of the Lyapunov optimization technique, we propose the toward optimal resource scheduling algorithm under imperfect CSI (TORS) to optimize resource scheduling in an IoT environment. A convex transmit power and subchannel allocation problem in TORS is formulated. This problem is then solved via the Lagrangian dual decomposition method. We derive analytical bounds for the time-averaged system throughput and queue backlog. We show that TORS can arbitrarily approach the optimal system throughput by simply tuning an introduced control parameter $\beta $ without prior knowledge of stochastic task arrivals and the CSI of wireless channels. Extensive simulation results confirm the theoretical analysis on the performance of TORS.