| Ad hoc网络中基于标号的组播路由算法 |
| |
| 引用本文： | 刘涛,林琳,周贤伟,彭莱.Ad hoc网络中基于标号的组播路由算法[J].计算机工程,2010,36(2):108-109. |
| |
| 作者姓名： | 刘涛 林琳 周贤伟 彭莱 |
| |
| 作者单位： | 北京科技大学信息工程学院通信工程系,北京,100083 |
| |
| 基金项目： | 国家自然科学基金资助项目(60773074);;国家“863”计划基金资助项目(2007AA01Z213) |
| |
| 摘 要： | 针对Ad hoc网络中最小带宽消耗组播路由问题，给出一个基于标号优化的启发式算法(LOHA)，介绍标号规则及修改节点间邻接关系规则，通过修改组播树中节点的标号来减少树中的转发节点数，从而最小化带宽消耗。该算法的时间复杂度为O(n3)，从转发节点个数和平均跳数2个方面比较LOHA及广度优先搜索算法所生成的组播树。实验结果表明，LOHA得到的组播树带宽消耗较少。
|
| 关 键 词： | Ad hoc网络 组播树 启发式算法 带宽消耗 |
| 修稿时间： | |
Multicast Routing Algorithm Based on Label in Ad hoc Network |
| |
| LIU Tao,LIN Lin,ZHOU Xian-wei,PENG Lai.Multicast Routing Algorithm Based on Label in Ad hoc Network[J].Computer Engineering,2010,36(2):108-109. |
| |
| Authors: | LIU Tao LIN Lin ZHOU Xian-wei PENG Lai |
| |
| Affiliation: | (Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing 100083) |
| |
| Abstract: | Aiming at the problem of multicast routing with minimum bandwidth consumption, a Label Optimization based Heuristic Algorithm(LOHA) is proposed, including labeling rule and the modified rule of adjacent relationship between nodes. It minimizes bandwidth consumption by modifying the labels of the nodes in the multicast tree. The time complexity of LOHA is O(n3). The multicast trees obtained by LOHA is compared with Breadth-First-Search(BFS) algorithm from two aspects such as the average forwarding node number and the average hop number. Experimental results show the multicast tree obtained by LOHA consumes less bandwidth. |
| |
| Keywords: | Ad hoc network multicast tree heuristic algorithm bandwidth consumption |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
