一种改进的路径选择算法研究  

Study on an Improved Path Selected Algorithm

作　　者：年伏宝 华江林[1] NIAN Fubao;HUA Jiangliang(Anhui Vocational College of Press and Publishing,Hefei,Anhui 230601,China)

机构地区：[1]安徽新闻出版职业技术学院,安徽合肥230601

出　　处：《九江学院学报（自然科学版）》2018年第4期76-78,84,共4页Journal of Jiujiang University：Natural Science Edition

基　　金：安徽省自然科学重点项目(编号KJ2017A871);安徽省自然科学重点项目(编号KJ2017A874)的研究成果之一

摘　　要：在Ad Hoc无线网络中,由于信道相对复杂以及各节点在网络中的功能差异,反映无线网络性能的核心之一就是其路由协议的优劣。为了针对特有网络环境和通信业务,不仅要综合和对比现有的无线路由协议,也需要根据实际需求加以修改和补充。文章旨在综合表驱动和按需驱动的优势、降低算法复杂度,引入有向图和路径权值、契合网络应用需求来提出一种相对有效的路径选择算法。Because of the complexity of channel and function difference of communicated nodes in Ad Hoc,the performance of the route protocol showed the communication capability of Ad Hoc. In order to discovery a suitable path selected algorithm for a specified network and communication business,authors should synthesize and contrast the wireless routing protocol existing,also modify and supplement them for demand. This paper introduced the directed graph,path weight and business requirement based to establish an effective path selected algorithms by referring the advantages of table driven and requirement driven algorithms.

关 键 词：广度优先 有向图 算法复杂度 路径权值 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]