Message dropping policy in congested social Delay Tolerant Networks

Tossaphol Settawatcharawanit, S. Yamada, M. Haque, K. Rojviboonchai
{"title":"Message dropping policy in congested social Delay Tolerant Networks","authors":"Tossaphol Settawatcharawanit, S. Yamada, M. Haque, K. Rojviboonchai","doi":"10.1109/JCSSE.2013.6567330","DOIUrl":null,"url":null,"abstract":"Congestion in DTNs happens when the forwarding path to destination does not exist and a node runs out of buffer space. Several works have shown that the situation is hard to mitigate. Consequently, to choose the right message to drop is a crucial task. Moreover, there has not been much attention to the buffer management policy in the Social-DTNs contexts. Therefore, an efficient buffer management policy for Social-DTNs is needed to achieve a better performance for communication in challenging disruptive scenarios. In this paper, we propose a novel message dropping policy for Social-DTNs. Our proposed policy utilizes social relation of nodes to avoid dropping meaningful messages in congested social-DTNs. We have implemented and evaluated our policy on the ONE simulator, and used real contact traces obtained during a conference. Our evaluation results show that our proposed policy can significantly reduce the number of overhead and can outperform the traditional policy under investigated scenarios.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Congestion in DTNs happens when the forwarding path to destination does not exist and a node runs out of buffer space. Several works have shown that the situation is hard to mitigate. Consequently, to choose the right message to drop is a crucial task. Moreover, there has not been much attention to the buffer management policy in the Social-DTNs contexts. Therefore, an efficient buffer management policy for Social-DTNs is needed to achieve a better performance for communication in challenging disruptive scenarios. In this paper, we propose a novel message dropping policy for Social-DTNs. Our proposed policy utilizes social relation of nodes to avoid dropping meaningful messages in congested social-DTNs. We have implemented and evaluated our policy on the ONE simulator, and used real contact traces obtained during a conference. Our evaluation results show that our proposed policy can significantly reduce the number of overhead and can outperform the traditional policy under investigated scenarios.
拥塞社会容忍延迟网络中的消息丢弃策略
当到达目的地的转发路径不存在且节点的缓冲空间不足时,就会发生ddn中的拥塞。几项研究表明,这种情况很难缓解。因此,选择正确的信息是一项至关重要的任务。此外,社会- dtns背景下的缓冲管理政策没有得到太多关注。因此,为了在具有挑战性的破坏性场景中实现更好的通信性能,需要一种有效的social - ddn缓冲管理策略。在本文中,我们提出了一种新的社会化dtns消息丢弃策略。我们提出的策略利用节点的社会关系来避免在拥塞的社交型ddn中丢弃有意义的消息。我们已经在ONE模拟器上实施和评估了我们的策略,并使用了在会议期间获得的真实接触痕迹。我们的评估结果表明,我们提出的策略可以显著减少开销,并且在所调查的场景下优于传统策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信