Improved dynamic channel allocation algorithm based on ant colony intelligence for P2P service

Zhengping Li, Didi Zhang, Jin Ren, Changliu Niu, J. Zhao, Baotong An, Yihua Meng
{"title":"Improved dynamic channel allocation algorithm based on ant colony intelligence for P2P service","authors":"Zhengping Li, Didi Zhang, Jin Ren, Changliu Niu, J. Zhao, Baotong An, Yihua Meng","doi":"10.1109/ComComAp.2014.7017190","DOIUrl":null,"url":null,"abstract":"In multiple hops network, there would be competition among the Peer to Peer (P2P) links when the amount of the P2P links was large. This paper proposed a novel dynamic channel allocation (DCA) algorithm based on ant colony intelligence (ACI) to solve the problem of multi-hop network competition among the P2P links. Theory analysis showed than the shorter of the average length of the routes of the P2P services, the higher of the system throughput. By offering the P2P services with short length of route high priority to access the channels, the proposed algorithm could improve the network throughput and guarantee the Quality of Service (QoS) of P2P service in the network. Theoretical and simulation results showed that the proposed algorithm could effectively enhance both the overall throughput of the network, and the channel utilization rate. At the same time, the QoS of network also had a lot of improvement.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Computers, Communications and IT Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComComAp.2014.7017190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In multiple hops network, there would be competition among the Peer to Peer (P2P) links when the amount of the P2P links was large. This paper proposed a novel dynamic channel allocation (DCA) algorithm based on ant colony intelligence (ACI) to solve the problem of multi-hop network competition among the P2P links. Theory analysis showed than the shorter of the average length of the routes of the P2P services, the higher of the system throughput. By offering the P2P services with short length of route high priority to access the channels, the proposed algorithm could improve the network throughput and guarantee the Quality of Service (QoS) of P2P service in the network. Theoretical and simulation results showed that the proposed algorithm could effectively enhance both the overall throughput of the network, and the channel utilization rate. At the same time, the QoS of network also had a lot of improvement.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于蚁群智能的P2P动态信道分配改进算法
在多跳网络中,当P2P链路数量较大时,P2P链路之间会产生竞争。提出了一种基于蚁群智能(ACI)的动态信道分配(DCA)算法,以解决P2P链路间的多跳竞争问题。理论分析表明,P2P业务的平均路由长度越短,系统吞吐量越高。该算法通过提供路由长度短、优先级高的P2P业务访问通道,提高了网络吞吐量,保证了网络中P2P业务的服务质量(QoS)。理论和仿真结果表明,该算法可以有效地提高网络的整体吞吐量和信道利用率。同时,网络的QoS也有了很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast acquisition method of navigation receiver based on folded PMF-FFT Web service sub-chain recommendation leveraging graph searching Path prediction based on second-order Markov chain for the opportunistic networks A novel UEP resource allocation scheme for layered source transmission in COFDM systems Energy efficient scheduling with probability and task migration considerations for soft real-time systems
×
引用
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