期刊文献+

基于地理信息Ad Hoc网络多播路由协议

Multicast Routing Protocol based on Geographic Location in Ad Hoc Networks
下载PDF
导出
摘要 利用地理位置信息提供的便利,针对Ad Hoc网络多播协议存在的不足,通过局部范围内构造网状多播树结构、减少链路长度、降低应答请求数目和预测节点移动情况等方面做了进一步优化。还介绍了协议的操作方法、协议格式和数据结构。仿真结果表明该协议有较好的数据传递率和较小的延迟。 In this paper, we propose several schemes to optimize the performance of multicast routing protocol in Ad Hoc networks taking advantage of geographic information, through constructing mesh multicast tree structure, reducing links distance, decreasing the number of reply, predicting mobility. In addition the algorithm, frame structure and table structure were presented. The simulations result shows that it can improve success transport ratio and reduce the latency.
作者 江有福
出处 《浙江海洋学院学报(自然科学版)》 CAS 2008年第2期177-182,191,共7页 Journal of Zhejiang Ocean University(Natural Science Edition)
关键词 AD Hoe网络 多播路由协议 地理位置 ad Hoc networks multicast routing protocol geographic location
  • 相关文献

参考文献9

  • 1ROYER E M, PERKINS C E. Multicast Operation of the Ad Hoc On-Demand Distance Vector Routing Protocol [J]. ACM MOBICOM, 1999, 8: 207-218.
  • 2JI L, CORSON M S. A Lightweight Adaptive Muhicast Algorithm[J]. GLOBECOM, 1998:1 036-1 042.
  • 3CHEN K, NAHRSTEDT K. Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET[J]. Proc INFOCOM, 2002:1 180-1 189.
  • 4LEE S J, SU W, GERLA M. On--demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks[J]. Intemet draft, draft-ieff-manet-odmrp-02.tx4 2002.
  • 5GARCIA-LUNA-ACEVES J J, Madruga E L. The Core-Assisted Mesh Pretocol[J]. IEEE JSAC, 1999, 8:1 380-1 394.
  • 6CHIANG C C, GERLA M, ZHANG L. Forwarding Group Muhicast Protocol (FGMP) for Muhihop, Mobile Wireless Networks[J]. Cluster Comp, Special Issue on Mobile Computing, 1998, 1(2): 187-196.
  • 7ROY S, KOUTSONIKOLAS D, DAS S, et al. High-throughput multicast routing metrics in wireless mesh networks [J]. Proc of ICOCS,2006, 48.
  • 8余燕平,仇佩亮.加权的基于多播节点的多播路由算法[J].电路与系统学报,2006,11(3):110-114. 被引量:1
  • 9江有福,吴伟志.一种基于地理位置的启发式Ad Hoc路由协议[J].计算机工程,2008,34(1):137-139. 被引量:7

二级参考文献22

  • 1汤晓,李贻斌,王彦堂,张娟.基于Mapinfo的最短路径混合搜索算法[J].山东理工大学学报(自然科学版),2006,20(2):81-84. 被引量:4
  • 2贺鹏,李建东,陈彦辉,周雷.基于Delaunay三角剖分的Ad Hoc网络路由算法[J].软件学报,2006,17(5):1149-1156. 被引量:14
  • 3SAHASRABUDDHE L H,MUKHERJEE B.Multicast Routing Algorithms and Protocols:A Tutorial[J].IEEE Network,2000.90-102.
  • 4ANG B,HOU J C.Multicast Routing and Its QoS Extension:Problems,Algorithms and Protocols[J].IEEE Network,2000.22-36.
  • 5SALALMA H F,REEVES D S,VINIOTIS Y.Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks[J].IEEE JSAC,1997,15(3):332-345.
  • 6WANG F K.Steiner Tree Problems[J].Networks,1992,22(1):55-89.
  • 7WINTER P.Steiner Problem in Networks:A Survey[J].Networks,1987,17:129-167.
  • 8KOU L,MARKOWSKY G,BERMAN L.A Fast Algorithm for Steiner Trees[J].Acta Informatica 1981,15:141-145.
  • 9TAKAHASHI H,MATSUYAMA A.An Approximate Solution for the Steiner Problem in Graphs[J].Math.Japonica,1980,24:573-577.
  • 10RAYWARD-SMITH V J.The Computation of nearly minimal Steiner trees in Graphs[J].Int.J.Math.Educ.Sci.Technol.,1983,14:15-23.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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