基于匹配博弈的车辆异构网络选择算法

摘要：针对车辆在异构网络覆盖环境下的网络接入选择问题，基于双边匹配博弈中稳定匹配的相关概念，提出一种车辆异构网络选择博弈模型，通过用户侧与网络侧的双向选择得到异构网络选择的稳定匹配。算法首先利用层次分析法获得相应权重分配以给出满意度函数，然后将网络侧的一对多匹配转化为一对一匹配问题，在稳定匹配条件下构建多目标优化模型，并求解最优匹配结果。相关性能分析及仿真实验表明，基于稳定匹配的博弈模型相对于传统决策模型，能够使网络和用户侧双方的满意度最优化，从而得到双向网络选择的均衡状态。

Network Selection Algorithm Based on Stable Matching Game in Vehicular Heterogeneous Network

A gaming method of vehicular heterogeneous network selection was proposed, to solve the network access problem of vehicles in heterogeneous network coverage. Based on the concepts of stable matching in two-sided matching game, stable matching of network selection was obtained through the mutual selection between users and networks. Firstly, the corresponding weights were calculated by using AHP to obtain the satisfaction function, then, one-to-many two-sided matching problem was converted into one-to-one two-sided matching problem, and optimal matching results could be obtained by constructing the multi-objective optimization model under the condition of stable matching. The performance analysis and simulation results show that the proposed model based on stable matching optimizes the satisfaction degree of both the network and user sides, and thus the equilibrium state of two way network selection was obtained,compared to the traditional selection-making model.