当前位置:主页 > 科技论文 > 交通工程论文 >

车联网路侧单元联盟划分及中继车辆选择

发布时间:2018-06-22 18:29

  本文选题:车联网 + 路侧单元 ; 参考:《大连理工大学》2014年硕士论文


【摘要】:随着车辆所携带的无线移动设备的大量增加,出现了车联网应用技术来更好的组织和管理道路上车辆所形成的无线网络。车联网以改善交通安全状况、提高运输效率、方便人们出行为目标,对未来的交通系统产生深远的影响。车联网己成为智能交通领域研究的新热点,受到国际工业界和学术界的共同关注,已有越来越多的研究人员投入到车联网研究当中。其中车联网的信息传输机制对支持各类交通安全及娱乐相关应用具有重要意义。 车联网中实现高效的信息传输机制具有非常大的挑战性,需要考虑交通环境中车辆节点快速移动及稠密交通数据冗余等实际特性和约束。在众多车联网信息分发策略研究中,Waild等人提出一种路侧单元之间协作的合作式车路通信模型,该模型中设计了一种充分发挥车辆间共享信息能力的路侧单元协作策略,目的是提高网络中传输数据的多样性,并利用联盟博弈(CGS)方法将骨干网中的路侧单元划分为协作联盟来协调管理,但是该策略需要成员对联盟中其他所有成员有所贡献才能加入联盟,这样带来的不足是没有考虑一个成员对某一联盟中部分成员有贡献,而对剩余成员的影响可以忽略的情况。另有基于图划分理论的路侧单元联盟形成策略,联盟内部成员依赖路网拓扑关系进行协作而不能更加灵活地协调各成员的协作关系。而且在单行路环境中因不能发掘相对行驶车辆共享信息的能力而变得低效。 针对以上问题,本文通过分析路侧单元间协作通信特点提出基于遗传算法的路侧单元协作联盟划分(CFGA)策略,选择合适的编码方式充分表达骨干网路侧单元的联盟组成及联盟内部成员间的协作关系,保证种群初始化、选择操作和交叉操作产生的个体是符合路网拓扑的合理个体,并利用边界基因变异有效实现解空间的局部搜索。针对路侧单元间协作通信在单行路上的局限性提出车辆向后方共享信息的策略,利用集合覆盖原理选择共享中继车辆使共享信息重复转发次数降低。
[Abstract]:With the increasing number of wireless mobile devices carried by vehicles, the wireless network formed by vehicle networking technology has emerged to better organize and manage vehicles on the road. In order to improve traffic safety, improve transportation efficiency, and facilitate people to travel as the goal, it will have a profound impact on the future transportation system. Vehicle networking has become a new research hotspot in the field of intelligent transportation. It has attracted the common attention of the international industry and academia, and more researchers have been involved in the research of vehicle networking. The information transmission mechanism of vehicle network is of great significance to support all kinds of traffic safety and entertainment applications. The realization of efficient information transmission mechanism in vehicle networking is very challenging. It is necessary to consider the practical characteristics and constraints such as the rapid movement of vehicle nodes and the redundancy of dense traffic data in traffic environment. Waild et al put forward a cooperative vehicle-road communication model based on collaboration between road-side units in the study of information distribution strategies for vehicle networking. In this model, a collaborative strategy of road-side units is designed to give full play to the ability of sharing information among vehicles. The purpose of this paper is to improve the diversity of data transmission in the network, and to divide the roadside units in backbone network into cooperative alliances to coordinate the management by using the alliance game (CGS) method. However, the strategy requires members to contribute to all other members of the alliance to join the alliance, which brings the disadvantage that a member has no contribution to some members of a certain alliance, but the influence on the remaining members can be ignored. In addition, there is a strategy of forming road side unit alliance based on graph partition theory, in which the members of the alliance depend on the topological relationship of the road network for cooperation, but can not coordinate the cooperation relationship of each member more flexibly. Moreover, in the single-lane environment, it becomes inefficient because it is unable to explore the ability of sharing information relative to moving vehicles. In order to solve the above problems, this paper proposes a genetic algorithm-based cooperative alliance partition (CFGA) strategy for road-side units by analyzing the characteristics of collaborative communication between road-side units. Choosing the appropriate coding method can fully express the alliance composition of the road side unit of the backbone network and the cooperative relationship among the members of the alliance, so as to ensure the initialization of the population, the individuals generated by the selection operation and the cross operation are reasonable individuals in line with the network topology. And the boundary gene mutation is used to realize the local search of solution space effectively. In view of the limitation of cooperative communication between road side units in single route, a strategy of sharing information towards the rear of vehicles is proposed. The selection of shared relay vehicles based on the set coverage principle can reduce the number of retransmission of shared information.
【学位授予单位】:大连理工大学
【学位级别】:硕士
【学位授予年份】:2014
【分类号】:U495;TN929.5;TP391.44

【参考文献】

相关期刊论文 前1条

1 金弟;杨博;刘杰;刘大有;何东晓;;复杂网络簇结构探测——基于随机游走的蚁群算法[J];软件学报;2012年03期



本文编号:2053776

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/jiaotonggongchenglunwen/2053776.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户f5016***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com