一种基于动态拓扑势和社会关系的移动社交容忍延迟网络路由协议

Xuening Qin, G. Xie, Jinchun Gao
{"title":"一种基于动态拓扑势和社会关系的移动社交容忍延迟网络路由协议","authors":"Xuening Qin, G. Xie, Jinchun Gao","doi":"10.1109/CITS.2017.8035282","DOIUrl":null,"url":null,"abstract":"The design of routing protocol in mobile social delay tolerant networks is a tricky issue due to lack of stable end-to-end path, frequent link disconnection and changeable network topology. This paper proposes a novel routing algorithm based on dynamic topological potential and social relationship (DTPSR) between nodes for mobile social delay tolerant networks. In DTPSR, we define three metrics to describe the status of a node, the direct and indirect relationship between nodes respectively. Then these metrics are used to construct different utility functions and determine the optimal relay node for different situations. The extensive simulations prove that DTPSR significantly improves the delivery ratio while reducing the transmission delay and relay hops without excessive increase in computation and storage overhead. This indicates that DTPSR algorithm can find the optimal relay node more accurately.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A dynamic topological potential and social relationship based routing protocol for mobile social delay tolerant networks\",\"authors\":\"Xuening Qin, G. Xie, Jinchun Gao\",\"doi\":\"10.1109/CITS.2017.8035282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of routing protocol in mobile social delay tolerant networks is a tricky issue due to lack of stable end-to-end path, frequent link disconnection and changeable network topology. This paper proposes a novel routing algorithm based on dynamic topological potential and social relationship (DTPSR) between nodes for mobile social delay tolerant networks. In DTPSR, we define three metrics to describe the status of a node, the direct and indirect relationship between nodes respectively. Then these metrics are used to construct different utility functions and determine the optimal relay node for different situations. The extensive simulations prove that DTPSR significantly improves the delivery ratio while reducing the transmission delay and relay hops without excessive increase in computation and storage overhead. This indicates that DTPSR algorithm can find the optimal relay node more accurately.\",\"PeriodicalId\":314150,\"journal\":{\"name\":\"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CITS.2017.8035282\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2017.8035282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在移动社交容延迟网络中,由于端到端路径不稳定、链路断开频繁、网络拓扑多变,路由协议的设计成为一个棘手的问题。提出了一种基于节点间动态拓扑势和社会关系(DTPSR)的移动社交容忍网络路由算法。在DTPSR中,我们分别定义了三个度量来描述节点的状态、节点之间的直接关系和间接关系。然后利用这些指标构造不同的效用函数,确定不同情况下的最优中继节点。大量的仿真证明,DTPSR在不增加计算和存储开销的情况下,显著提高了传输比,减少了传输延迟和中继跳数。这表明DTPSR算法可以更准确地找到最优中继节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A dynamic topological potential and social relationship based routing protocol for mobile social delay tolerant networks
The design of routing protocol in mobile social delay tolerant networks is a tricky issue due to lack of stable end-to-end path, frequent link disconnection and changeable network topology. This paper proposes a novel routing algorithm based on dynamic topological potential and social relationship (DTPSR) between nodes for mobile social delay tolerant networks. In DTPSR, we define three metrics to describe the status of a node, the direct and indirect relationship between nodes respectively. Then these metrics are used to construct different utility functions and determine the optimal relay node for different situations. The extensive simulations prove that DTPSR significantly improves the delivery ratio while reducing the transmission delay and relay hops without excessive increase in computation and storage overhead. This indicates that DTPSR algorithm can find the optimal relay node more accurately.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信