间歇连接移动Ad-Hoc网络中组播通信的主动恢复方案

Tomotaka Kimura, H. Premachandra
{"title":"间歇连接移动Ad-Hoc网络中组播通信的主动恢复方案","authors":"Tomotaka Kimura, H. Premachandra","doi":"10.1109/ICOIN.2019.8718145","DOIUrl":null,"url":null,"abstract":"We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"466 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Aggressive Recovery Scheme for Multicast Communication in Intermittently Connected Mobile Ad-Hoc Networks\",\"authors\":\"Tomotaka Kimura, H. Premachandra\",\"doi\":\"10.1109/ICOIN.2019.8718145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.\",\"PeriodicalId\":422041,\"journal\":{\"name\":\"2019 International Conference on Information Networking (ICOIN)\",\"volume\":\"466 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2019.8718145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2019.8718145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

研究了适合于间歇连接移动自组网中组播通信的恢复方案。在这些网络中,传统的路由方案不能正常工作。在这种情况下,存储结转路由被认为是一种很有前途的解决方案。在许多存储-转发路由方案中,即使消息到达其目标节点,一些节点仍存储其副本。为了解决这一问题,针对单播通信提出了许多恢复方案。然而,这些恢复方案不能正常工作于多播通信。本文提出了一种适用于组播通信的恢复方案。我们的恢复方案在接收到所有目标节点生成的所有反包之前积极地丢弃消息副本。通过仿真实验,我们证明了当消息在多个目标节点上传递时,我们的恢复方案比现有的恢复方案效果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Aggressive Recovery Scheme for Multicast Communication in Intermittently Connected Mobile Ad-Hoc Networks
We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Mobile Edge Computing (MEC)-Based VANET Data Offloading Using the Staying-Time-Oriented k-Hop Away Offloading Agent Cooperative Server-Client HTTP Adaptive Streaming System for Live Video Streaming An Efficient Gateway Routing Scheme for Disaster Recovery Scenario Gigabit Ethernet with Wireless Extension: OPNET Modelling and Performance Study Experimental Evaluation of Mobile Core Networks on Simultaneous Access from M2M/IoT Terminals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1