PatchODMRP: ad-hoc组播路由协议

Meejeong Lee, Y. Kim
{"title":"PatchODMRP: ad-hoc组播路由协议","authors":"Meejeong Lee, Y. Kim","doi":"10.1109/ICOIN.2001.905505","DOIUrl":null,"url":null,"abstract":"We propose an ad-hoc multicast routing protocol, referred to as PatchODMRP. PatchODMRP extends the ODMRP (on-demand multicast routing protocol), which is a mesh-based multicast routing protocol proposed for ad-hoc networks. In ODMRP, the nodes that are on the shortest paths between the multicast group members are selected as forwarding group (FG) nodes, and form a forwarding mesh for the multicast group. The ODMRP reconfigures the forwarding mesh periodically to adapt it to the node movements. When the number of sources in the multicast group is small, usually the forwarding mesh is formed sparsely and it can be very vulnerable to mobility. In this case, very frequent mesh reconfigurations are required in ODMRP, resulting in a large control overhead. To deal with this problem in a more efficient way, PatchODMRP deploys a local patching scheme instead of having very frequent mesh reconfigurations. In PatchODMRP, each FG node keeps checking if there is a symptom of mesh separation around itself. When an FG node finds such a symptom, it tries to patch itself to the mesh with local flooding of control messages. Through a course of simulation experiments, the performance of PatchODMRP is compared to the performance of ODMRP. The simulation results show that PatchODMRP improves the data delivery ratio, and reduces the control overheads. It has also been shown that the performance gain is larger when the degree of node mobility is bigger.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"PatchODMRP: an ad-hoc multicast routing protocol\",\"authors\":\"Meejeong Lee, Y. Kim\",\"doi\":\"10.1109/ICOIN.2001.905505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an ad-hoc multicast routing protocol, referred to as PatchODMRP. PatchODMRP extends the ODMRP (on-demand multicast routing protocol), which is a mesh-based multicast routing protocol proposed for ad-hoc networks. In ODMRP, the nodes that are on the shortest paths between the multicast group members are selected as forwarding group (FG) nodes, and form a forwarding mesh for the multicast group. The ODMRP reconfigures the forwarding mesh periodically to adapt it to the node movements. When the number of sources in the multicast group is small, usually the forwarding mesh is formed sparsely and it can be very vulnerable to mobility. In this case, very frequent mesh reconfigurations are required in ODMRP, resulting in a large control overhead. To deal with this problem in a more efficient way, PatchODMRP deploys a local patching scheme instead of having very frequent mesh reconfigurations. In PatchODMRP, each FG node keeps checking if there is a symptom of mesh separation around itself. When an FG node finds such a symptom, it tries to patch itself to the mesh with local flooding of control messages. Through a course of simulation experiments, the performance of PatchODMRP is compared to the performance of ODMRP. The simulation results show that PatchODMRP improves the data delivery ratio, and reduces the control overheads. It has also been shown that the performance gain is larger when the degree of node mobility is bigger.\",\"PeriodicalId\":332734,\"journal\":{\"name\":\"Proceedings 15th International Conference on Information Networking\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 15th International Conference on Information Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2001.905505\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 15th International Conference on Information Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2001.905505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60

摘要

我们提出了一个ad-hoc组播路由协议,称为PatchODMRP。PatchODMRP是对ODMRP(按需组播路由协议)的扩展,ODMRP是针对ad-hoc网络提出的一种基于网格的组播路由协议。在ODMRP中,选择组播组成员之间最短路径上的节点作为转发组节点,构成组播组的转发网格。ODMRP定期重新配置转发网格,使其适应节点的移动。当组播组中的源数量较少时,通常会形成稀疏的转发网格,并且极易受到迁移的影响。在这种情况下,ODMRP中需要非常频繁的网格重新配置,从而导致很大的控制开销。为了更有效地处理这个问题,PatchODMRP部署了一个本地补丁方案,而不是非常频繁的网格重新配置。在PatchODMRP中,每个FG节点不断检查自己周围是否有网格分离的症状。当FG节点发现这种症状时,它会尝试将自己与控制消息的本地泛滥修补到网格中。通过一系列的仿真实验,比较了PatchODMRP和ODMRP的性能。仿真结果表明,PatchODMRP提高了数据传输率,降低了控制开销。研究还表明,节点迁移程度越大,性能增益越大。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PatchODMRP: an ad-hoc multicast routing protocol
We propose an ad-hoc multicast routing protocol, referred to as PatchODMRP. PatchODMRP extends the ODMRP (on-demand multicast routing protocol), which is a mesh-based multicast routing protocol proposed for ad-hoc networks. In ODMRP, the nodes that are on the shortest paths between the multicast group members are selected as forwarding group (FG) nodes, and form a forwarding mesh for the multicast group. The ODMRP reconfigures the forwarding mesh periodically to adapt it to the node movements. When the number of sources in the multicast group is small, usually the forwarding mesh is formed sparsely and it can be very vulnerable to mobility. In this case, very frequent mesh reconfigurations are required in ODMRP, resulting in a large control overhead. To deal with this problem in a more efficient way, PatchODMRP deploys a local patching scheme instead of having very frequent mesh reconfigurations. In PatchODMRP, each FG node keeps checking if there is a symptom of mesh separation around itself. When an FG node finds such a symptom, it tries to patch itself to the mesh with local flooding of control messages. Through a course of simulation experiments, the performance of PatchODMRP is compared to the performance of ODMRP. The simulation results show that PatchODMRP improves the data delivery ratio, and reduces the control overheads. It has also been shown that the performance gain is larger when the degree of node mobility is bigger.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信