一种基于博弈理论的VANET路由算法  

A game- base routing protocol in VANET

作　　者：孙海霞[1] 胡永[1] 刘炜[1] 

机构地区：[1]西藏民族大学信息工程学院西藏光信息处理与可视化技术重点实验室,陕西咸阳712082

出　　处：《电子技术应用》2015年第8期97-100,105,共5页Application of Electronic Technique

基　　金：国家民委基金项目(13074)

摘　　要：车联网VANET属于移动自组织网的特殊应用,能够自动、无基础设施组织网络。VANET为车与车辆间和车与基础设施间提供通信,然而,VANET的动态拓扑致使移动自组织网的路由不再适用于VANET。为此,提出一种基于博弈理论(Game)路由算法,通过Game寻找最优的路由,并提供接入Internet最优路径。该算法利用学习算法计算纳什等式,再利用纳什等式寻找最合理的路径。仿真结果表明,提出的路由算法能够有效地进行VANET通信。Vehicular Ad Hoc Network（VANET） is considered as a special application of Mobile Ad Hoc Networks（MANETs） in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure. However, due to the highly dynamic topology in VANETs, several routing protocols in mobile ad- hoc wireless networks are not very suitable for VANETs networks. Therefore, we propose a routing algorithm which is based on the congestion game. It provide the optimal Internet access path by game theory. The simulation results show that the proposed routing algorithm has better feasibility and effectiveness for communicating VANETs.

关 键 词：学习算法 纳什均衡 博弈理论 网关 路由 车载网 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]