SimRouter: Message routing based on Similarity and Relative Probable Positions of nodes in DTNs

G. Kumar, Y. N. Singh
{"title":"SimRouter: Message routing based on Similarity and Relative Probable Positions of nodes in DTNs","authors":"G. Kumar, Y. N. Singh","doi":"10.1109/COMNETSAT53002.2021.9530787","DOIUrl":null,"url":null,"abstract":"Delay tolerant networks (DTNs) have the major challenge of unpredictable topology due to nodes’ mobility and intermittent connections between nodes. Researchers have proposed various routing schemes to route packets effectively and efficiently within the given constraints, but we are still far from a perfect protocol. We propose a novel multi-copy protocol SimRouter for such networks, leveraging the additional information about the network, to make the routing decisions. SimRouter uses relative probable positions of the nodes and their similarity to route messages effectively with low overhead. Each node estimates and stores the relative probable positions of other nodes and a vector containing the number of times other nodes came in contact with it. The decision whether to replicate a message to another node or not is taken considering the two factors. Firstly, how similar the two nodes are in terms of their contact history and secondly, the relative positions of the nodes with respect to the destination node. The proposed protocol outperforms the current state of art multi-copy protocols specifically for high traffic loads.","PeriodicalId":148136,"journal":{"name":"2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNETSAT53002.2021.9530787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Delay tolerant networks (DTNs) have the major challenge of unpredictable topology due to nodes’ mobility and intermittent connections between nodes. Researchers have proposed various routing schemes to route packets effectively and efficiently within the given constraints, but we are still far from a perfect protocol. We propose a novel multi-copy protocol SimRouter for such networks, leveraging the additional information about the network, to make the routing decisions. SimRouter uses relative probable positions of the nodes and their similarity to route messages effectively with low overhead. Each node estimates and stores the relative probable positions of other nodes and a vector containing the number of times other nodes came in contact with it. The decision whether to replicate a message to another node or not is taken considering the two factors. Firstly, how similar the two nodes are in terms of their contact history and secondly, the relative positions of the nodes with respect to the destination node. The proposed protocol outperforms the current state of art multi-copy protocols specifically for high traffic loads.
simmrouter:基于DTNs中节点的相似度和相对可能位置的消息路由
容忍延迟网络由于节点的移动性和节点之间的间歇性连接而面临不可预测的拓扑结构的主要挑战。研究人员已经提出了各种路由方案,在给定的约束条件下有效地路由数据包,但我们离完美的协议还很远。我们提出了一种新的多副本协议simmrouter,利用网络的附加信息来做出路由决策。simmrouter使用节点的相对可能位置及其相似性以低开销有效地路由消息。每个节点估计并存储其他节点的相对可能位置,以及包含其他节点与其接触次数的向量。在决定是否将消息复制到另一个节点时,需要考虑两个因素。首先,两个节点在接触历史上的相似程度,其次,节点相对于目标节点的相对位置。提出的协议优于当前的多副本协议,特别是在高流量负载下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信