检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈登 潘力 CHEN Deng;PAN Li(North Sichuan College of Preschool Teacher Education,Guangyuan 628017,Sichuan Province,China;Zhengzhou University of Technology,Zhengzhou 450044,China)
机构地区:[1]川北幼儿师范高等专科学校,四川广元628017 [2]郑州工程技术学院,郑州450044
出 处:《信息技术》2022年第12期73-79,共7页Information Technology
基 金:河南省科技厅科技攻关计划项目(202002210346)。
摘 要:针对车辆自组网(VANETs)中通信链路频繁断开、拓扑结构的动态变化等问题,提出一种寻找网络数据最优分发优化路径的方法。首先,分析区域内车辆密度以及区域车辆数据传输模型,给出链路稳定性计算公式和障碍物发生概率的计算公式;其次,考虑精英团体的克隆复制与普通个体极值相互学习,提出基于精英型的粒子群进化算法,以寻找VANETs中数据分发最优路径;最后,通过仿真验证所提方法在包传递率、平均吞吐量和路由开销这三方面优于现有的QoS感知数据传播和贪婪外围无状态路由算法。Based on the problem of frequent disconnection of communication links and the dynamic change of topology in mobile Vehicular Ad Hoc Networks(VANETs),a method for finding the optimal distribution and optimization path of network data is proposed.Firstly,the vehicle density in the area and the vehicle data transmission model in the area are analyzed,and the calculation formula of link stability and the calculation formula of obstacle occurrence probability are given.Secondly,considering the clone replication of elite groups and mutual learning of extreme values of ordinary individuals,an elite particle swarm optimization evolutionary algorithm is proposed to find the optimal path for data distribution in VANETs.Finally,it is verified by simulation that the proposed method is superior to the existing QoS-aware data dissemination and greedy perimeter stateless routing method in three aspects,including packet delivery ratio,average throughput,and routing overhead.
关 键 词:车辆自组网络 最优路径 链路稳定性 数据分发 粒子群算法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.137.236