Ant Colony Optimization of Licklider Transmission Protocol Based on Unequal Error Protection Fountain Code

Haonan Cao, Zijing Cheng, Yang Zhao, Yali Liu, Xiaoman Zhang
{"title":"Ant Colony Optimization of Licklider Transmission Protocol Based on Unequal Error Protection Fountain Code","authors":"Haonan Cao, Zijing Cheng, Yang Zhao, Yali Liu, Xiaoman Zhang","doi":"10.1109/ICCSN.2019.8905293","DOIUrl":null,"url":null,"abstract":"Licklider Transmission Protocol (LTP) based on Fountain code can solve the problem of repeated retransmission and huge delay caused by Automatic Repeat-reQuest (ARQ), but cannot provide the unequal error protection (UEP) for different reliability requirements of the red data and green data in LTP. Therefore, LTP based on UEP fountain code (UEP LTP) is proposed and optimized by using ant colony optimization (ACO). Firstly, a coding method of UEP LTP is obtained by studying LTP and fountain encoding principle, which determines selection probability of first window is the key factor affecting the performance of UEP LTP. Then, ACO principle is studied and improved, and the ACO model of UEP LTP is established. Combined with and-or tree analysis, the optimal selection probability curve of first window and optimal LTP bit error performance are obtained. ACO and and-or tree simulation results show that UEP LTP has excellent UEP performance by using optimal selection probability curve of first window. The theoretical error rate of red data can reach 10−11.5057 when green data is 10−3.9978.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2019.8905293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Licklider Transmission Protocol (LTP) based on Fountain code can solve the problem of repeated retransmission and huge delay caused by Automatic Repeat-reQuest (ARQ), but cannot provide the unequal error protection (UEP) for different reliability requirements of the red data and green data in LTP. Therefore, LTP based on UEP fountain code (UEP LTP) is proposed and optimized by using ant colony optimization (ACO). Firstly, a coding method of UEP LTP is obtained by studying LTP and fountain encoding principle, which determines selection probability of first window is the key factor affecting the performance of UEP LTP. Then, ACO principle is studied and improved, and the ACO model of UEP LTP is established. Combined with and-or tree analysis, the optimal selection probability curve of first window and optimal LTP bit error performance are obtained. ACO and and-or tree simulation results show that UEP LTP has excellent UEP performance by using optimal selection probability curve of first window. The theoretical error rate of red data can reach 10−11.5057 when green data is 10−3.9978.
基于不等错误保护喷泉码的Licklider传输协议蚁群优化
基于Fountain code的Licklider Transmission Protocol (LTP)可以解决自动重复请求(ARQ)带来的重复重传和巨大延迟问题,但不能针对LTP中红绿数据的不同可靠性要求提供不等错误保护(UEP)。为此,提出了基于UEP喷泉码的LTP (UEP LTP),并采用蚁群算法对其进行了优化。首先,通过对LTP和喷泉编码原理的研究,得到了UEP LTP的编码方法,确定了第一窗口的选择概率是影响UEP LTP性能的关键因素。然后,对蚁群算法原理进行了研究和改进,建立了UEP LTP的蚁群算法模型。结合and-or树分析,得到了第一窗口的最优选择概率曲线和最优LTP误码性能。蚁群算法和and-or树仿真结果表明,采用第一窗口最优选择概率曲线的UEP LTP具有优异的UEP性能。当绿色数据为10−3.9978时,红色数据的理论误差率可达10−11.5057。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信