检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:彭艺[1] 李启骞 朱豪 张申 PENG Yi;LI Qi-qian;ZHU Hao;ZHANG Shen(Faculty of Information Engineering and Automation,Kunming University of Science and Technology,Kunming Yunnan 650000,China)
机构地区:[1]昆明理工大学信息工程与自动化学院,云南昆明650000
出 处:《通信技术》2020年第3期634-640,共7页Communications Technology
基 金:国家地区自然科学基金(No.61761025)。
摘 要:无线Mesh网络因其较好的鲁棒性、可覆盖区域广、低成本、接入便利等优点,在临时布置通信网络逐渐得到了重用,在无线通信技术中扮演着越来越重要的角色。针对无线Mesh网络的特点,提出一种基于改进蚁群算法的多径路由协议Fortified Ant协议。与传统的蚁群算法路由协议相比,该协议对蚁群算法进行改进,在蚁群算法基础上加入排序算法,同时在该协议中加入多径传输,在主路由失效时马上启用备份路由,保证信息传输的时效性和可靠性。实验结果表明,与ADOV、DSR和ACO路由算法相比,该算法能迅速发现质量较优的多条路径,具有收敛快、开销少等优势。Due to its advantages such as good robustness,wide coverage,low cost and convenient access,wireless mesh network is gradually being reused in temporary communication networks and plays an increasingly important role in wireless communication technologies.Aiming at the characteristics of wireless mesh networks,a multi-path routing protocol based on an improved ant colony algorithm is proposed,namely the Fortified Ant protocol.Compared with the traditional ant colony algorithm routing protocol,this protocol improves the ant colony algorithm,adds a sorting algorithm on the basis of the ant colony algorithm,and at the same time,the multi-path transmission to the protocol.When the main circuit fails,the backup route is immediately enabled to ensure the timeliness and reliability of information transmission.Experimental results show that compared with ADOV,DSR,and ACO routing algorithms,this algorithm can quickly find multiple paths with better quality,and has the advantages of fast convergence and low cost.
关 键 词:无线MESH网络 蚁群算法 排序算法 多径路由 Fortified Ant
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13