Reliability-guaranteed admission control for mobile computation offloading under Nakagami fading channel

The coupled stochastic channel interferences can lead to intermittent connectivity and invalid fragment transmissions, which pose a significant challenge to guarantee the reliability of computation offloading. A wide variety of conventional approaches to making offloading decisions are based on the fundamental condition that channels are sufficiently reliable for completing each transmission session. However, the reliability that a user can successfully offload a computation task before a restricted deadline remains unexplored under the interference channels. In this letter, we focus on the Nakagami-m fading channel and propose an analytical framework to characterize the reliability of computation offloading with the restrictions of application deadline and offloading data size in the presence of coupled stochastic interferences. A lower-bound offloading reliability capturing coupled randomness is theoretically derived. Based on the analytical framework, we further propose an admission control method for users to make computation offloading decisions. Simulation results verify our theoretical framework and show the superior performance of the proposed method over other benchmark schemes in terms of guaranteeing reliability.