CAMT:用于自组织网络的核心辅助组播树

M. U. Farooq, N. Tapus
{"title":"CAMT:用于自组织网络的核心辅助组播树","authors":"M. U. Farooq, N. Tapus","doi":"10.1109/ROEDUNET-RENAM.2014.6955327","DOIUrl":null,"url":null,"abstract":"Generally, the multicast routing protocols for mobile ad hoc networks (MANETs) build and maintain a group shared (tree or mesh-based) multicast delivery structure, which results in inefficient propagation of multicast traffic. In this article, a source tree based multicast routing protocol CAMT is proposed. CAMT employs only a fraction of nodes (core nodes) to disseminate their own and their neighbors' multicast interests to the network, while assuring the representation of all multicast receivers in these messages. As a result, only a small number of multicast group interest messages are generated. Moreover, CAMT benefits from the multipoint relay (MPR) optimizations to minimize retransmissions of these messages. Based on the information learnt through these messages, any multicast sender can generate a shortest path tree (rooted at itself), spanning across all core nodes interested in a particular multicast group. Simulation results indicate that the proposed protocol performs well under different network conditions.","PeriodicalId":340048,"journal":{"name":"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference","volume":"225 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"CAMT: Core assisted multicast tree for ad hoc networks\",\"authors\":\"M. U. Farooq, N. Tapus\",\"doi\":\"10.1109/ROEDUNET-RENAM.2014.6955327\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generally, the multicast routing protocols for mobile ad hoc networks (MANETs) build and maintain a group shared (tree or mesh-based) multicast delivery structure, which results in inefficient propagation of multicast traffic. In this article, a source tree based multicast routing protocol CAMT is proposed. CAMT employs only a fraction of nodes (core nodes) to disseminate their own and their neighbors' multicast interests to the network, while assuring the representation of all multicast receivers in these messages. As a result, only a small number of multicast group interest messages are generated. Moreover, CAMT benefits from the multipoint relay (MPR) optimizations to minimize retransmissions of these messages. Based on the information learnt through these messages, any multicast sender can generate a shortest path tree (rooted at itself), spanning across all core nodes interested in a particular multicast group. Simulation results indicate that the proposed protocol performs well under different network conditions.\",\"PeriodicalId\":340048,\"journal\":{\"name\":\"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference\",\"volume\":\"225 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROEDUNET-RENAM.2014.6955327\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 RoEduNet Conference 13th Edition: Networking in Education and Research Joint Event RENAM 8th Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROEDUNET-RENAM.2014.6955327","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

通常,移动自组网(manet)的组播路由协议建立和维护一种组共享的(基于树或网格的)组播传输结构,这导致了组播流量的低效率传播。提出了一种基于源树的组播路由协议CAMT。CAMT仅使用一小部分节点(核心节点)将自己和邻居的组播兴趣传播到网络中,同时确保这些消息中所有组播接收者的表示。因此,只生成少量的组播组兴趣消息。此外,CAMT还受益于多点中继(MPR)优化,以最大限度地减少这些消息的重传。基于从这些消息中学习到的信息,任何多播发送方都可以生成一个最短路径树(以自身为根),该树跨越对特定多播组感兴趣的所有核心节点。仿真结果表明,该协议在不同的网络条件下都具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CAMT: Core assisted multicast tree for ad hoc networks
Generally, the multicast routing protocols for mobile ad hoc networks (MANETs) build and maintain a group shared (tree or mesh-based) multicast delivery structure, which results in inefficient propagation of multicast traffic. In this article, a source tree based multicast routing protocol CAMT is proposed. CAMT employs only a fraction of nodes (core nodes) to disseminate their own and their neighbors' multicast interests to the network, while assuring the representation of all multicast receivers in these messages. As a result, only a small number of multicast group interest messages are generated. Moreover, CAMT benefits from the multipoint relay (MPR) optimizations to minimize retransmissions of these messages. Based on the information learnt through these messages, any multicast sender can generate a shortest path tree (rooted at itself), spanning across all core nodes interested in a particular multicast group. Simulation results indicate that the proposed protocol performs well under different network conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信