一种解决VANETs空洞问题的限时携带贪婪前传方法

发布时间：2018-06-20 14:24

本文选题：车载自组织网络 + 网络空洞　；参考：《兰州理工大学学报》2017年01期

【摘要】：针对车辆节点快速移动和非均匀分布导致的车联网网络空洞问题,以及空洞节点采用SCF(store carry forward)方法长期携带过时交通信息导致浪费存储资源的问题,提出一种先应式空洞发现策略以及一种限时携带的贪婪前传广播(CGFB,limited time carry and greedy forward broadcast)方法.CGFB结合了GF(greedy forward)算法和SCF算法的优点,可以提高建立路径的成功概率并降低存储消耗.仿真结果表明,当平均邻居节点数大于4时,CGFB算法成功建立路径的概率可达97%以上;相比SCF算法,当平均邻居节点数为2时,可节省90%以上的存储资源.
[Abstract]:Aiming at the problem of vehicle network holes caused by the rapid movement and uneven distribution of vehicle nodes, and the problem that the hollow nodes use SCF store carry forward (SCF store carry forward) method to carry outdated traffic information for a long time, the storage resources are wasted. In this paper, we propose a proactive cavity discovery strategy and a time-limited greedy forward broadcast time carry and greedy forward broadcast) method. CGFB combines the advantages of GFGR greedy forward) algorithm and SCF algorithm, which can improve the probability of establishing path and reduce storage consumption. The simulation results show that when the average neighbor node number is more than 4, the probability of successfully establishing the path of CGFB algorithm can reach more than 97%, and when the average neighbor node number is 2, the storage resources can be saved by more than 90% compared with SCF algorithm.
【作者单位】：兰州理工大学计算机与通信学院;
【分类号】：TN929.5;U495

【相似文献】