检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄德玲 严余松[1] 彭大芹[2] HUANG De-ling;YAN Yu-song;PENG Da-qin(School of Information Science and Technology,Southwest Jiaotong University,Chengdu 610031,China;School of Software Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
机构地区:[1]西南交通大学信息科学与技术学院,成都610031 [2]重庆邮电大学软件工程学院,重庆400065
出 处:《计算机科学》2019年第7期74-80,共7页Computer Science
摘 要:车辆自组织网络的拓扑结构变化迅速,使得节点之间的无线连接不稳定,因此基于贪婪转发的地理位置路由协议经常由于连接断开而失败。针对这个问题,提出一种判断连接可靠性的方法。该方法通过计算每个邻居节点的链路稳定性因子和距离衰减因子等来评估传输连接的可靠性,设计的相应路由协议采用可靠性最高的连接形成路由,从而增加包投递成功率。同时,针对路由环路问题,提出一种预测路口节点的算法,使得数据包能选择性地利用交叉路口协调节点来确定数据传输路径,从而有效避免路由环路,提高转发效率。实验结果表明,提出的算法在包投递成功率、端到端时延和包转发次数等方面都取得了较好的路由性能。The topology of vehicular ad hoc networks changes rapidly,which makes wireless connection between nodes unstable.Therefore,greedy forwarding based location routing protocols often fail because of the disconnection between nodes.Aiming at this problem,this paper proposed a method to judge the reliability of link.In this method,the reliability of transmission links is evaluated by calculating link stability factor and distance attenuation factor of each neighbor node.As a result,this paper designed a routing protocol in which the highest reliability links are used to form the route,consequently increasing the packet delivery success ratio.At the same time,this paper presented an algorithm to predict the intersection nodes,which makes the data packet selectively utilize the intersection coordinators to determine the data transmission path,enhancing the routing efficiency.Simulation results show that the proposed algorithm achieves better routing performance in terms of packet delivery success rate,end-to-end delay and packet forwarding times.
关 键 词:车辆自组织网络 地理位置服务 贪婪转发策略 基于预测的算法 路由协议
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117