An improved congestion control algorithm based on social awareness in Delay Tolerant Networks

Kun Wang, Huang Guo, Lei Shu, B. Liu
{"title":"An improved congestion control algorithm based on social awareness in Delay Tolerant Networks","authors":"Kun Wang, Huang Guo, Lei Shu, B. Liu","doi":"10.1109/ICC.2014.6883579","DOIUrl":null,"url":null,"abstract":"The routing efficiency in Delay Tolerant Networks (DTN) with social characteristics degrades owing to intermittent connection and high latency. Additionally, congestion is another issue because of the limited resources of nodes. To solve these problems, an improved Socially Aware Congestion Control algorithm (SACC) is proposed. In this algorithm, the social features and the congestion level of the node are utilized to construct a Social Congestion Metric (SCM). In the forwarding process, messages are forwarded to the nodes with higher SCM. When the congestion occurs, the node calculates the social links of itself with every message's destination node, and then drops the message with minimum social link rather than random dropping. Simulation results show that in the acceptable range of delay tolerance, the proposed algorithm improves the delivery probability, decreases the dropping probability and reduces the overhead.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2014.6883579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

The routing efficiency in Delay Tolerant Networks (DTN) with social characteristics degrades owing to intermittent connection and high latency. Additionally, congestion is another issue because of the limited resources of nodes. To solve these problems, an improved Socially Aware Congestion Control algorithm (SACC) is proposed. In this algorithm, the social features and the congestion level of the node are utilized to construct a Social Congestion Metric (SCM). In the forwarding process, messages are forwarded to the nodes with higher SCM. When the congestion occurs, the node calculates the social links of itself with every message's destination node, and then drops the message with minimum social link rather than random dropping. Simulation results show that in the acceptable range of delay tolerance, the proposed algorithm improves the delivery probability, decreases the dropping probability and reduces the overhead.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
延迟容忍网络中基于社会感知的改进拥塞控制算法
在具有社交特性的容忍延迟网络(Delay tolerance network, DTN)中,间歇性连接和高延迟会降低路由效率。此外,由于节点资源有限,拥塞是另一个问题。为了解决这些问题,提出了一种改进的社会感知拥塞控制算法(SACC)。该算法利用节点的社会特征和拥塞程度来构建社会拥塞度量(SCM)。在转发过程中,消息被转发到SCM较高的节点。当发生拥塞时,节点与每条消息的目的节点计算自身的社交链接,然后以最小的社交链接丢弃消息,而不是随机丢弃。仿真结果表明,在可接受的延迟容忍范围内,该算法提高了投送概率,降低了丢包概率,降低了开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed DTX alignment with memory Throughput maximization with channel acquisition in energy harvesting systems Energy exchange among base stations in a Cellular Network through the Smart Grid Smart grid enabled mobile networks: Jointly optimizing BS operation and power distribution Distance-based energy-efficient opportunistic forwarding in mobile delay tolerant networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1