检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汤星峰 徐卿钦 马世纬 TANG Xingfeng;XU Qingqin;MA Shiwei(Chongqing Key Lab of Mobile Communications Technology(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications),Chongqing 400065,China)
机构地区:[1]移动通信技术重庆市市级重点实验室(重庆邮电大学通信与信息工程学院),重庆400065
出 处:《计算机应用》2020年第6期1738-1744,共7页journal of Computer Applications
基 金:长江学者和创新团队发展计划项目(IRT_16R72)。
摘 要:为了提高城市中车辆间信息的传输效率,实现车辆间的信息共享,针对目前车载自组网(VANET)中基于地理位置转发的多跳单播路由算法没有考虑城市场景的特殊性,不能很好地适应城市中车辆的高度动态性,使车辆之间的数据包可能在错误的路径上传播,造成丢包率较高、时延较长的问题,提出了一种新的基于路径探索的贪婪路由算法。首先,以数据包传输时延为标准,运用人工蜂群算法对数字地图规划出的多条路由路径进行探索。其次,优化数据包在车辆之间的多跳转发方式。仿真结果表明,与贪婪周边无状态路由(GPSR)协议和最大持续时间最小角的GPSR(MM-GPSR)改进算法比较,在最好情况下,所提算法的数据包到达率分别提高了13.81%和9.64%,而该算法的数据包平均端到端时延分别降低了61.91%和27.28%。In order to improve the transmission efficiency of information between vehicles in the city and realize the information sharing between vehicles,aiming at the problem that the current multi-hop unicast routing algorithm based on geographical location forwarding in the Vehicular Ad-hoc NETwork(VANET)does not consider the specificity of the urban scene and cannot adapt to the high dynamicity of vehicles in the city,so that the data packets between vehicles may spread on the wrong path,resulting in high packet loss rate and long delay,a new greedy routing algorithm based on path exploration was proposed.Firstly,taken the data packet transmission delay as the standard,artificial bee colony algorithm was used to explore multiple routing paths planned by the digital map.Then,the multi-hop forwarding method of data packets between vehicles was optimized.Simulation results show that,compared with Greedy Perimeter Stateless Routing(GPSR)protocol and Maxduration-Minangle GPSR(MM-GPSR)improved algorithm,in the best case,the data packet arrival rate of the proposed algorithm increases by 13.81%and 9.64%respectively,and the average data packet end-to-end delay of the proposed algorithm decreases by 61.91%and 27.28%respectively.
关 键 词:车载自组网 数据路由 人工蜂群算法 路由路径探索 贪婪转发
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42