Ad Hoc网络中有效的费用优化组播路由算法  

An Efficient Multicast Routing Algorithm for Cost Optimization in Ad Hoc Network

作　　者：肖建新 贺耀 

机构地区：[1]益阳医学高等专科学校计算机教研室,湖南益阳413000

出　　处：《计算机与现代化》2012年第6期122-124,130,共4页Computer and Modernization

摘　　要：Ad Hoc无线网络组网灵活、快捷,不受有线网络的影响,具有广阔的发展前景。随着无线通信技术的发展,组播应用日益广泛,组播技术正成为重要的研究课题。本文研究Ad Hoc网络时延约束组播路由问题,针对已有算法复杂性高、难于应用于实际的缺点,提出快速有效的组播路由算法DCMR。该算法首先找到足够的满足时延约束的源点与接收节点间路径;然后,对满足时延约束的路径依费用排序,并依序选择路径建立覆盖所有接收节点的组播树;最后,检查组播树的有效性,去掉可能存在的环路,并进行费用优化。仿真实验表明,在构造的组播树费用方面,DCMR算法稍差于KPP算法,但是,DCMR算法执行时间远低于KPP算法执行时间,可减少43.9%CPU执行时间。Ad Hoc wireless network has the flexible, fast installment without the impact of cable networks, and has broad pros- pects for development. With the development of wireless communications technology, multicast applications widespread increas- ingly, multicast technology is becoming an important research topic. This paper studies the multicast routing problem in Ad Hoc network. For the complexity of existing algorithms and the difficulty of applying to the real world, the paper presents an efficient and effective multicast routing algorithm DCMR. First, the algorithm finds enough the delay constraint satisfied paths. Then, the path would be sorted by cost, and be selected in turn to cover all the receiving node, until the muiticast tree is established. Final- ly, the validity of the multicast tree would be checked, removing the routing loop which may exist. Simulation results show that the tree costs generated by DCMR algorithm is slightly worse than KPP algorithm. But, for ＂algorithm execution time, compared with KPP, DCMR has decreased 43.9%.

关 键 词：Ad HOC 组播 路由树 费用优化 时延约束 

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