期刊文献+

基于蚁群算法的延时感知VANET路由协议 被引量:3

Ant Colony-Based Delay-Aware Routing Protocol for Vehicular Ad Hoc Networks
下载PDF
导出
摘要 针对城市车载自组网场景,提出了一种基于蚁群算法的道路延时感知路由协议。将数据转发过程分为直路模式和路口模式,利用蚁群算法中信息素的更新机制建立了一种基于蚁群算法的延时感知路段权重计算方法,并结合蚁群对最优化路径的探索过程给出了一种优化的反应式路由方案。仿真实验模拟了城市交通场景,将所提出的路由协议与GPSR、GSR、VACO路由协议进行性能比较,实验结果表明,该协议在数据分组投递率及延时方面均有较好的性能。 As the foundation for intelligent transportation system(ITS),vehicular ad hoc network(VANET)has been receiving more and more attentions in recent years.Due to the high mobility and uneven spatial distribution of vehicles in vehicular networks,network topology changes frequently,which makes the routing links easy to break.Hence,how to design the reliable and efficient routing protocols for VANET is becoming a challenging task.To deal with this problem,this paper proposes an ant colony optimization(ACO)based delay-aware routing protocol(ACDAP)for urban VANETs.Firstly,according to urban road topology,the data forwarding process is divided into straight road mode and intersection mode.In the straight road mode,packets are transmitted along the road by means of greedy strategy.While in the intersection mode,some special nodes,named as bridge nodes,are selected at the junctions to connect the partition networks over road segments.These bridge nodes are responsible for launching small control packets termed as ants.Meanwhile,these bridge nodes calculate the weights of segments by using a delay-aware method that is designed according to the pheromone updating mechanism and the exploration of the optimal path in ant colony algorithms.These weights can well reflect the connectivity of segment networks.Based on the calculated weight for each road segment,a reactive routing scheme is proposed to obtain the optimal route with high network connectivity.Finally,the real urban vehicular scenario is simulated via the NS2 simulation platform,and the comparison between the ACDAP with several routing protocols including GPSR,GSR and VACO is made,from which it is shown that the proposed ACDAP protocol in this work outperforms the conventional protocols in terms of in both data packet delivery rate(PDR)and end-to-end delay(E2ED).
作者 吉祥 虞慧群 范贵生 孙怀英 JI Xiang;YU Huiqun;FAN Guisheng;SUN Huaiying(Department of Computer Science and Engineering,East China University of Science and Technology,Shanghai 200237,China;Shanghai Key Laboratory of Computer Software Evaluating and Testing,Shanghai 201112,China)
出处 《华东理工大学学报(自然科学版)》 CAS CSCD 北大核心 2020年第1期128-134,共7页 Journal of East China University of Science and Technology
基金 国家自然科学基金(61702334,61772200) 上海市浦江人才计划(17PJ1401900) 上海自然科学基金(17ZR1406900,17ZR1429700) 华东理工大学教育教学规律与方法研究项目(ZH1726108)
关键词 车载自组网 蚁群算法 桥节点 数据分组投递率 端到端延时 vehicular ad hoc network ant colony optimization bridge node data packet delivery rate end-to-end delay
  • 相关文献

同被引文献31

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部