点击次数：

论文类型：期刊论文

发表时间：2015-07-01

发表刊物：Journal of Computational Information Systems

收录刊物：EI、Scopus

卷号：11

期号：13

页面范围：4903-4911

ISSN号：15539105

摘要：Due to the high speed of vehicles, time for communication between vehicles and road-side unit (RSU) is very short, which limits data dissemination capacity of the RSUs. To address this problem, this paper proposes a RSU coalition partitioning method basing on the ant colony algorithm (ACA). Basically, according to the amount and type of data that can be shared between encountering vehicles and RSUs, firstly, a evaluation function for RSU coalition was established that fully reects constitution of a RSU coalition and data-sharing capacity through cooperation of RSUs within the coalition; secondly, a state transition rule was designed, which generates a partitioning method that maximize data-exchanging capacity by iteration; lastly, global and local rules for pheromone updating were established to prevent the system staying at a locally optimal solution. This paper then used VISSIM simulation platform to verify this algorithm, and the results indicated that ACA coalition partitioning strategy improved gain (average data transmission capacity) of a RSU by 7.95% and 5.32%, compared to partitioning strategies basing on game theory and graph cut theory respectively. By this means, the vehicle-vehicle (V2V) and vehicle-road (V2R) data-exchanging capacity in the vehicle network was effectively improved, more types of data can be disseminated in this network, thus achieving efficient V2V and V2R data dissemination. ?, 2015, Journal of Computational Information Systems. All right reserved.