改进了ODMRP,以便可靠地交付繁忙的流量

A. Ganguli, Sukumar Nandi, P. K. Meher
{"title":"改进了ODMRP,以便可靠地交付繁忙的流量","authors":"A. Ganguli, Sukumar Nandi, P. K. Meher","doi":"10.1109/TENCON.2003.1273411","DOIUrl":null,"url":null,"abstract":"An important issue in reliable multicasting in ad hoc networks is busty packet loss that arises when a link breaks due to node mobility. For a high data rate, a multicast receiver may miss a large number of packets until the route is reestablished, and recovering from such a loss may impose a huge overhead on the bandwidth-constrained ad hoc network. By the time a node detects loss, the requested data packets may no longer be available with other nodes, which only have a limited cache size. In on demand multicast routing protocol (ODMRP), the source periodically initiates a mechanism for multicast tree creation, through join queries. It is possible that a link goes down because of node mobility, and a member stops receiving data packets, until the next join query is received. In this work, we present an explicit join scheme for ODMRP, which allows a node to reconnect to the multicast tree through an alternative path, if the existing path goes down. The scheme has been simulated on global mobile simulator (GloMoSim), and has shown to be effective in removing the busty data losses due to link failures.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An improvement of ODMRP for reliable delivery of busty traffic\",\"authors\":\"A. Ganguli, Sukumar Nandi, P. K. Meher\",\"doi\":\"10.1109/TENCON.2003.1273411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An important issue in reliable multicasting in ad hoc networks is busty packet loss that arises when a link breaks due to node mobility. For a high data rate, a multicast receiver may miss a large number of packets until the route is reestablished, and recovering from such a loss may impose a huge overhead on the bandwidth-constrained ad hoc network. By the time a node detects loss, the requested data packets may no longer be available with other nodes, which only have a limited cache size. In on demand multicast routing protocol (ODMRP), the source periodically initiates a mechanism for multicast tree creation, through join queries. It is possible that a link goes down because of node mobility, and a member stops receiving data packets, until the next join query is received. In this work, we present an explicit join scheme for ODMRP, which allows a node to reconnect to the multicast tree through an alternative path, if the existing path goes down. The scheme has been simulated on global mobile simulator (GloMoSim), and has shown to be effective in removing the busty data losses due to link failures.\",\"PeriodicalId\":405847,\"journal\":{\"name\":\"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region\",\"volume\":\"150 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.2003.1273411\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2003.1273411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在自组织网络中可靠的多播的一个重要问题是,当链路由于节点移动而中断时,会出现繁忙的数据包丢失。对于较高的数据速率,在路由重新建立之前,组播接收方可能会丢失大量的数据包,而从这种丢失中恢复可能会给带宽受限的自组织网络带来巨大的开销。当一个节点检测到丢失时,请求的数据包可能不再可用于其他节点,这些节点只有有限的缓存大小。在按需多播路由协议(ODMRP)中,源通过连接查询周期性地启动多播树创建机制。有可能由于节点移动而导致链路断开,并且成员停止接收数据包,直到接收到下一个连接查询。在这项工作中,我们提出了ODMRP的显式连接方案,该方案允许节点通过替代路径重新连接到多播树,如果现有路径下降。该方案在全球移动模拟器(GloMoSim)上进行了仿真,结果表明该方案能够有效地消除由于链路故障导致的繁忙数据丢失。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improvement of ODMRP for reliable delivery of busty traffic
An important issue in reliable multicasting in ad hoc networks is busty packet loss that arises when a link breaks due to node mobility. For a high data rate, a multicast receiver may miss a large number of packets until the route is reestablished, and recovering from such a loss may impose a huge overhead on the bandwidth-constrained ad hoc network. By the time a node detects loss, the requested data packets may no longer be available with other nodes, which only have a limited cache size. In on demand multicast routing protocol (ODMRP), the source periodically initiates a mechanism for multicast tree creation, through join queries. It is possible that a link goes down because of node mobility, and a member stops receiving data packets, until the next join query is received. In this work, we present an explicit join scheme for ODMRP, which allows a node to reconnect to the multicast tree through an alternative path, if the existing path goes down. The scheme has been simulated on global mobile simulator (GloMoSim), and has shown to be effective in removing the busty data losses due to link failures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信