期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Ad hoc网络中基于标号的组播路由算法 被引量：3

Multicast Routing Algorithm Based on Label in Ad hoc Network
下载PDF
导出
摘要 针对Ad hoc网络中最小带宽消耗组播路由问题,给出一个基于标号优化的启发式算法(LOHA),介绍标号规则及修改节点间邻接关系规则,通过修改组播树中节点的标号来减少树中的转发节点数,从而最小化带宽消耗。该算法的时间复杂度为O(n3),从转发节点个数和平均跳数2个方面比较LOHA及广度优先搜索算法所生成的组播树。实验结果表明,LOHA得到的组播树带宽消耗较少。 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.
作者 刘涛 林琳 周贤伟 彭莱
机构地区 北京科技大学信息工程学院通信工程系
出处 《计算机工程》 CAS CSCD 北大核心 2010年第2期108-109,112,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60773074) 国家"863"计划基金资助项目(2007AA01Z213)
关键词 Ad HOC网络 组播树 启发式算法 带宽消耗 Ad hoc network multicast tree heuristic algorithm bandwidth consumption
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献3

  • 1Pedro M. Heuristic Algorithms for Minimum Bandwidth Consumption Multicast Routing in Wireless Mesh Networks[D]. Murcia, Spain: University of Murcia, 2005.
  • 2Das B, Sivakumar E, Bharghavan V. Routing in Ad-hoc Networks Using a Virtual Backbone[C]//Proc. of the 6th International Conference on Computer Communications and Networks. LosVegas, Nevada, USA: [s. n.], 1997.
  • 3Wu Jie, Li Hailan. On Calculating Connected Dominating Set for Efficient Routing in Ad-hoc Wireless Networks[C]//Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. Seattle, USA: [s. n.], 1999.

同被引文献16

  • 1姚兰.基于最小生成树的时延约束多播路由算法[J].湖南城市学院学报（自然科学版）,2005,14(1):43-45. 被引量：1
  • 2Royer E M,Perkins C E.Multicast Operation of the Ad-hoc On-demand Distance Vector Routing Protocol[C]//Proc.of International Conference on Mobile Computing and Networking.Washington D.C.,USA:ACM Press,1999:207-218.
  • 3Lee S J,Gerla M,Chiang Ching-Chuan.On-demand Multicast Routing Protocol[C]//Proc.of International Conference on Wireless Communications and Networking.[S.l.]:IEEE Press,1999:1298-1302.
  • 4Vaishampayan R,Garcia J J,Aceves L.Robust Tree-based Multicasting in Ad hoc Networks[C]//Proc.of International Conference on Multihop Wireless Networks.[S.l.]:IEEE Press,2004:647-652.
  • 5Zou Likun,Zhang Qishan,Liu Jianwei.An Improved Weightbased Clustering Algorithm in MANETs[C]//Proc.of International Conference on Wireless Communications,Networking and Mobile Computing.[S.l.]:IEEE Press,2008.
  • 6Ahmed D T, Shirmohammadi S. Architectural Analysis of Multicast Routing Protocols for Wireless Ad Hoc Networks[C]// Proc. of ICN’07. Sainte-Luce, Martinique, France: [s. n.], 2007.
  • 7SáSilva J, Camilo T, Rodrigues A, et al. Multicast in Wireless Sensor Networks——The Next Step[C]//Proc. of Wireless Com- munications and Networking Conference. [S. l.]: IEEE Press, 2007.
  • 8Ko Y B, Vaidya N H. Geocasting in Mobile Ad Hoc Networks: Location-based Multicast Algorithms[C]//Proc. of the 2nd Workshop on Mobile Computer Systems and Applications. Washington D. C., USA: IEEE Computer Society, 1999: 101-110.
  • 9Gerla M, Yi Yunjun. Team Communications Among Autonomous Sensor Swarms[J]. ACM SIGMOD Record, 2004, 31(1): 20-25.
  • 10Huang Qingfeng, Lu Chenyang, Roman G C. Mobicast: Just- in-time Multicast for Sensor Networks Under Spatiotemporal Constraints[C]//Proc. of the 1st International Conference on Embedded Networked Sensor Systems. [S. l.]: ACM Press, 2003: 442-457.

引证文献3

二级引证文献1

计算机工程
2010年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部