A comparison between the PoolODMRP and the PatchODMRP

Cai Shaobin, Y. Xiaozong, Yao Wenbin
{"title":"A comparison between the PoolODMRP and the PatchODMRP","authors":"Cai Shaobin, Y. Xiaozong, Yao Wenbin","doi":"10.1109/ICON.2003.1266277","DOIUrl":null,"url":null,"abstract":"Abstrocf-As a new Ad Hoc multicast protocol, the PoolODMRF' defines pool nodes, which aren't forwarding nodes, however, can receive data, to collect route information from their received data, and to know which sources they are connected to. In the PoolODMRP, when a forwarding node detects that a link failure results in its failure to receive data from some sources, it sends out a Local Query. Each neighbor of it checks whether it connects to the sources defined in the Local Query. If it does, the neighbor answers with a Local Reply. The forwarding node selects the neighbor that connects to the sources earliest, and informs it to be a forwarding node. In this way, PoolODMRP can realize one-hop local recovery. The simulation results show that its data deliver ratio is similar to that of PatchODMRP 111, but its local control overhead is 19.2% of that of PatchODMRP, its control overhead is only 41.2% of that of PatchODMRF', and its data overhead is only 64.7% of that of PatchODMP.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Abstrocf-As a new Ad Hoc multicast protocol, the PoolODMRF' defines pool nodes, which aren't forwarding nodes, however, can receive data, to collect route information from their received data, and to know which sources they are connected to. In the PoolODMRP, when a forwarding node detects that a link failure results in its failure to receive data from some sources, it sends out a Local Query. Each neighbor of it checks whether it connects to the sources defined in the Local Query. If it does, the neighbor answers with a Local Reply. The forwarding node selects the neighbor that connects to the sources earliest, and informs it to be a forwarding node. In this way, PoolODMRP can realize one-hop local recovery. The simulation results show that its data deliver ratio is similar to that of PatchODMRP 111, but its local control overhead is 19.2% of that of PatchODMRP, its control overhead is only 41.2% of that of PatchODMRF', and its data overhead is only 64.7% of that of PatchODMP.
PoolODMRP和PatchODMRP的比较
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信