延迟容忍网络中具有拥塞和自私意识的社会路由

Sepehr Keykhaie, M. Rostaei
{"title":"延迟容忍网络中具有拥塞和自私意识的社会路由","authors":"Sepehr Keykhaie, M. Rostaei","doi":"10.1109/ICCKE.2017.8167918","DOIUrl":null,"url":null,"abstract":"Delay Tolerant Network (DTN) is a type of network that permanent connections between nodes are not always available. Routing in DTN uses store-carry-and-forward scheme, where nodes store and carry data until a suitable message carrier appears. Positive social characteristics such as centrality and friendship can be used to make a better routing decision in DTN. However, negative social characteristics such as selfishness may decrease the network performance. Selfish nodes for their individual or social benefits, do not contribute in message relaying when the device resources like battery level are low. Moreover, to achieve a better network performance we need to consider buffer congestion at the rely node. In this paper, we propose Congestion Aware and Selfishness Aware Social Routing protocol (CASASR) which by using social characteristics and awareness of buffer congestion and selfish behavior in the network selects a better relay. Using Poisson process, we find a utility value to select a relay node with a higher chance to deliver the message to the destination in the remained message TTL. In addition, we take into account the social and individual selfish behavior of nodes to adjust energy level available for message relaying. Comparison of our algorithm against several well-known algorithm shows that CASASR performs better in terms of delivery ratio and delivery overhead.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Congestion- and selfishness-aware social routing in delay tolerant networks\",\"authors\":\"Sepehr Keykhaie, M. Rostaei\",\"doi\":\"10.1109/ICCKE.2017.8167918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delay Tolerant Network (DTN) is a type of network that permanent connections between nodes are not always available. Routing in DTN uses store-carry-and-forward scheme, where nodes store and carry data until a suitable message carrier appears. Positive social characteristics such as centrality and friendship can be used to make a better routing decision in DTN. However, negative social characteristics such as selfishness may decrease the network performance. Selfish nodes for their individual or social benefits, do not contribute in message relaying when the device resources like battery level are low. Moreover, to achieve a better network performance we need to consider buffer congestion at the rely node. In this paper, we propose Congestion Aware and Selfishness Aware Social Routing protocol (CASASR) which by using social characteristics and awareness of buffer congestion and selfish behavior in the network selects a better relay. Using Poisson process, we find a utility value to select a relay node with a higher chance to deliver the message to the destination in the remained message TTL. In addition, we take into account the social and individual selfish behavior of nodes to adjust energy level available for message relaying. Comparison of our algorithm against several well-known algorithm shows that CASASR performs better in terms of delivery ratio and delivery overhead.\",\"PeriodicalId\":151934,\"journal\":{\"name\":\"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE.2017.8167918\",\"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 7th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2017.8167918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

容忍延迟网络(Delay tolerance Network, DTN)是一种节点间的永久连接并不总是可用的网络类型。DTN中的路由采用存储-携带-转发模式,节点存储和携带数据,直到合适的消息载体出现。积极的社会特征,如中心性和友谊可以用来做出更好的DTN路由决策。然而,消极的社会特征,如自私,可能会降低网络性能。当设备资源(如电池电量)较低时,自私节点为其个人或社会利益而不参与消息中继。此外,为了获得更好的网络性能,我们需要考虑依赖节点的缓冲区拥塞。本文提出了一种基于拥塞感知和自利感知的社会路由协议(CASASR),该协议利用网络的社会特性和对缓冲区拥塞和自利行为的感知来选择更好的中继。使用泊松过程,我们找到一个实用值来选择一个中继节点,该节点在剩余的消息TTL中有更高的机会将消息传递到目的地。此外,我们还考虑节点的社会行为和个体自私行为来调整消息中继的可用能量水平。与几种知名算法的比较表明,CASASR在交付率和交付开销方面表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Congestion- and selfishness-aware social routing in delay tolerant networks
Delay Tolerant Network (DTN) is a type of network that permanent connections between nodes are not always available. Routing in DTN uses store-carry-and-forward scheme, where nodes store and carry data until a suitable message carrier appears. Positive social characteristics such as centrality and friendship can be used to make a better routing decision in DTN. However, negative social characteristics such as selfishness may decrease the network performance. Selfish nodes for their individual or social benefits, do not contribute in message relaying when the device resources like battery level are low. Moreover, to achieve a better network performance we need to consider buffer congestion at the rely node. In this paper, we propose Congestion Aware and Selfishness Aware Social Routing protocol (CASASR) which by using social characteristics and awareness of buffer congestion and selfish behavior in the network selects a better relay. Using Poisson process, we find a utility value to select a relay node with a higher chance to deliver the message to the destination in the remained message TTL. In addition, we take into account the social and individual selfish behavior of nodes to adjust energy level available for message relaying. Comparison of our algorithm against several well-known algorithm shows that CASASR performs better in terms of delivery ratio and delivery overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信