车联网中基于分布式博弈的移动网关选取算法

A distributed game theoretic approach for dynamic gateway selection in VANETs

提出一种基于VANET-CELLULAR混合架构的车联网(VANET)。在这种架构下,车辆可以根据一些原则动态成簇,在这些簇中,通过车辆间分布式博弈快速选取最少数量的车辆作为移动网关,将本地VANET接入蜂窝网络,并随着簇的网络拓扑变化动态更新网关,以最大化车辆数据传输的性能。考虑到车辆节点的自私特点,分布式博弈可以有效地提高移动网关节点的积极性,使得算法的可行性增强。仿真结果表明该算法能高效选取车联网移动网关。

A VANET-CELLULAR integrated network architecture is proposed to ensure efficient data exchanging for various applications in Vehicular Ad-hoc NETwork(VANETs). In this architecture, vehicles are dynamically clustered by related metrics, and those vehicles conformed to the context-aware requirement are selected as mobile gateway to link the 3GPP networks. A distributed game theoretic approach is adopted to stimulate vehicles to cooperate with their neighbors, and the overall performance of communication is improved by evolutionarily maximizing each vehicle’s own utility. The simulation results show that this approach works efficiently in selection of the minimal mobile gateways in VANETs.