Preemptive and Non Preemptive Switching Protocols for 5G Wireless Dynamic Network Architecture

Abstract

This article focuses on 5G wireless dynamic network architecture and analyzes a novel paradigm for wireless network access, where certain classes of smart devices may act as an access point (AP) temporarily anytime while connected to the Internet. Due to the unpredictably available/unavailable time and uninformed disconnections of the APs, users need a seamless, efficient, and reliable schedule for switching between available APs. In this article, we model the available/unavailable behavior of each AP as a two-state Markov chain, and then propose two switching policies: push-based preemptive switching and pull-based non-preemptive switching. For each policy, the process of user switching among the APs or base station (BS) in its accessing list is modeled as a Markovian process. Approximated statistical models of the two switching policies are provided, and stationary distributions of these processes can be derived. In addition, we propose a dual-charging mechanism where the APs charge the users by signaling transmission and data transmission. Based on the derived stationary distributions and proposed dual-charging mechanism, we propose an optimal priority assignment algorithm to constitute the access lists for preemptive and non-preemptive switching. Simulation results confirm the accuracy of the statistical models and verify the performance of the preemptive and non-preemptive switching policies. In the low mobility scenarios, preemptive switching would be a better option because it has acceptable signaling overhead, brings higher capacity and utility for users, and brings higher profit for APs. In the high mobility scenarios, non-preemptive switching would be a better option because it incurs fewer switchings and higher profit for APs.