Network selection is of critical importance for heterogeneous vehicular networks. However, it still faces network congestion and reliability challenges in high-speed vehicular networks, which are caused by users’ selfishness and link failures, respectively. To address these challenges, we propose a scheme called enhanced congestion game with link failures (E-CGF) to achieve optimal network selection. In E-CGF, a hidden Markov model is utilized to formulate the link failure probability. Considering link failures, users can use more than one radio network simultaneously to improve throughput performance by redundant transmission, which leads to an increase of transit cost. Accordingly, the goal of E-CGF is to make a compromise between achieved throughput and transit cost. We first prove the existence of Nash equilibrium in E-CGF and construct an efficient algorithm to find the optimal strategy. We then evaluate the effect of different parameters on the utility based on numerical analysis. Finally, we carry out extensive experiments based on real-world traces of link states from high-speed rails and compare with three typical algorithms. The results demonstrate that E-CGF outperforms others by alleviating network congestion and improving transmission reliability with a moderate trade-off between achieved throughput and transit cost.
Read full abstract