一种采用剩余服务时间的异构网络选择算法

Network selection algorithm in heterogeneous wireless networks based on residual service time

We propose a network selection algorithm based on the residual service time for the network selection problem in heterogeneous networks. There have been already many research works and achievements in this area, but most of the existing works just consider the optimal user or network revenue which does not consider the impact of new users. This paper presents the concept of the residual service time, and uses it to model the impact of the new users, in order to get a better network option on long time scales. In this paper, we use the non-cooperative game to model the network, and prove that the Nash equilibrium of the model is also the global optimal solution. Finally, we use the Lyapunov stability theory to show that the proposed algorithm is stable. Simulation results show that the introduction of the residual service time can improve the network performance, reduce the blocking rate, and increase the total network revenue.