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

发布时间：2018-07-12 14:22

  本文选题：异构网络 + 稳定匹配　； 参考：《电信科学》2015年09期

【摘要】：针对车辆在异构网络覆盖环境下的网络接入选择问题,基于双边匹配博弈中稳定匹配的相关概念,提出一种车辆异构网络选择博弈模型,通过用户侧与网络侧的双向选择得到异构网络选择的稳定匹配。算法首先利用层次分析法获得相应权重分配以给出满意度函数,然后将网络侧的一对多匹配转化为一对一匹配问题,在稳定匹配条件下构建多目标优化模型,并求解最优匹配结果。相关性能分析及仿真实验表明,基于稳定匹配的博弈模型相对于传统决策模型,能够使网络和用户侧双方的满意度最优化,从而得到双向网络选择的均衡状态。
[Abstract]:Aiming at the problem of network access selection for vehicles in heterogeneous network coverage environment, a model of vehicle heterogeneous network selection game is proposed based on the concept of stable matching in bilateral matching game. The stable matching of heterogeneous network selection is obtained by two-way selection between user side and network side. The algorithm first obtains the corresponding weight distribution by AHP to give the satisfaction function, then transforms the one-to-many matching problem into one-to-one matching problem, and constructs a multi-objective optimization model under the condition of stable matching. The optimal matching results are obtained. Correlation performance analysis and simulation experiments show that the game model based on stable matching can optimize the satisfaction degree of both the network and the user side compared with the traditional decision model and thus obtain the equilibrium state of two-way network selection.
【作者单位】： 东南大学移动通信国家重点实验室;
【基金】：国家自然科学基金资助项目(No.61372104,No.61201175) 江苏省科技成果转化专项基金资助项目(No.BA2010023)~~
【分类号】：U495;TN929.5
，

本文编号：2117442