TAFR: DTN的即时通讯讯息转渡计划

Xiaoyang Wu, Yingwen Chen, Ming Xu, Wei Peng
{"title":"TAFR: DTN的即时通讯讯息转渡计划","authors":"Xiaoyang Wu, Yingwen Chen, Ming Xu, Wei Peng","doi":"10.1109/ICCIS.2012.309","DOIUrl":null,"url":null,"abstract":"Partitioning network, especially some DTN, can use Message Ferry(MF) scheme to restore network connection. Message TTL describes the maximum delay tolerance of transmission and messages with out-of-date TTL should be dropped. In this paper, we will study the problem of how to design the ferry's moving route dynamically to get high message delivery ratio under the constraint of message TTL, which we call it TAFR problem as well as algorithms. We compare TAFRA to existing SIRA and Random Way point algorithm with different message TTLs and ferry number in two scenarios. The simulation shows that TAFRA can get nearly twice the delivery ratio than SIRA in low message TTL conditions, and 50% more delivery ratio with increasing ferry number. Furthermore, the simulation shows that TAFRA provides on-demand characteristics which are more suitable in some non-uniformly distribute message condition.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"TAFR: A TTL-aware Message Ferry Scheme in DTN\",\"authors\":\"Xiaoyang Wu, Yingwen Chen, Ming Xu, Wei Peng\",\"doi\":\"10.1109/ICCIS.2012.309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partitioning network, especially some DTN, can use Message Ferry(MF) scheme to restore network connection. Message TTL describes the maximum delay tolerance of transmission and messages with out-of-date TTL should be dropped. In this paper, we will study the problem of how to design the ferry's moving route dynamically to get high message delivery ratio under the constraint of message TTL, which we call it TAFR problem as well as algorithms. We compare TAFRA to existing SIRA and Random Way point algorithm with different message TTLs and ferry number in two scenarios. The simulation shows that TAFRA can get nearly twice the delivery ratio than SIRA in low message TTL conditions, and 50% more delivery ratio with increasing ferry number. Furthermore, the simulation shows that TAFRA provides on-demand characteristics which are more suitable in some non-uniformly distribute message condition.\",\"PeriodicalId\":269967,\"journal\":{\"name\":\"2012 Fourth International Conference on Computational and Information Sciences\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Computational and Information Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2012.309\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Computational and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2012.309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

分区网络,特别是某些DTN,可以使用Message Ferry(MF)方案来恢复网络连接。消息TTL描述了传输的最大延迟容忍,超过TTL的消息应该被丢弃。在本文中,我们将研究如何在消息TTL约束下动态设计渡轮的移动路线以获得较高的消息传递率的问题,我们称之为TAFR问题以及算法。在两种情况下,我们将TAFRA与现有的SIRA和随机路径点算法在不同的消息ttl和渡轮数量下进行了比较。仿真结果表明,在低报文TTL条件下,TAFRA的发送率是SIRA的近两倍,随着轮渡次数的增加,其发送率提高了50%。仿真结果表明,TAFRA提供了更适合于非均匀分布消息条件下的随需应变特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
TAFR: A TTL-aware Message Ferry Scheme in DTN
Partitioning network, especially some DTN, can use Message Ferry(MF) scheme to restore network connection. Message TTL describes the maximum delay tolerance of transmission and messages with out-of-date TTL should be dropped. In this paper, we will study the problem of how to design the ferry's moving route dynamically to get high message delivery ratio under the constraint of message TTL, which we call it TAFR problem as well as algorithms. We compare TAFRA to existing SIRA and Random Way point algorithm with different message TTLs and ferry number in two scenarios. The simulation shows that TAFRA can get nearly twice the delivery ratio than SIRA in low message TTL conditions, and 50% more delivery ratio with increasing ferry number. Furthermore, the simulation shows that TAFRA provides on-demand characteristics which are more suitable in some non-uniformly distribute message condition.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信