{"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.