TY - JOUR
T1 - Congestion Game With Link Failures for Network Selection in High-Speed Vehicular Networks
AU - Yan, Xiaoyun
AU - Dong, Ping
AU - Du, Xiaojiang
AU - Zheng, Tao
AU - Zhang, Hongke
AU - Guizani, Mohsen
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
KW - Congestion game
KW - high-speed vehicular networks
KW - link failures
KW - network selection
KW - redundant transmission
UR - http://www.scopus.com/inward/record.url?scp=85058084895&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85058084895&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2018.2884766
DO - 10.1109/ACCESS.2018.2884766
M3 - Article
AN - SCOPUS:85058084895
VL - 6
SP - 76165
EP - 76175
JO - IEEE Access
JF - IEEE Access
M1 - 8558496
ER -