An Adaptive Grey Wolf Optimization Algorithm for Secrecy Rate Optimization in Interference Limited Wireless Networks

Md. Samiur Rahman, M. Haque, Zubayer Kabir Eisham, M. T. Kawser, Mohammad Rubbyat Akram, Samin Z. Rahman
{"title":"An Adaptive Grey Wolf Optimization Algorithm for Secrecy Rate Optimization in Interference Limited Wireless Networks","authors":"Md. Samiur Rahman, M. Haque, Zubayer Kabir Eisham, M. T. Kawser, Mohammad Rubbyat Akram, Samin Z. Rahman","doi":"10.1109/ICTP53732.2021.9744155","DOIUrl":null,"url":null,"abstract":"Throughout the revolving generations of cellular technologies, data security has been one of the biggest concerns. In an interference-limited wireless network, this security concern becomes quite vital due to the intervention of eavesdroppers in the network. As a result, the max-min secrecy throughput problem becomes one of the most significant optimization problems in the fields of wireless communication and network security. Nature-inspired optimization algorithms are quite vital tools for this kind of optimization problem. In this paper, a problem-specific adaptive version of the Grey Wolf Optimization Algorithm has been used to solve this max-min throughput problem, and the performance of the proposed algorithm has been compared with the existing methods and with a few existing meta-heuristic algorithms. The balance between the exploration and the exploitation phase has been controlled to enhance the convergence speed to yield the optimal solution in the lowest possible time.","PeriodicalId":328336,"journal":{"name":"2021 IEEE International Conference on Telecommunications and Photonics (ICTP)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Telecommunications and Photonics (ICTP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTP53732.2021.9744155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Throughout the revolving generations of cellular technologies, data security has been one of the biggest concerns. In an interference-limited wireless network, this security concern becomes quite vital due to the intervention of eavesdroppers in the network. As a result, the max-min secrecy throughput problem becomes one of the most significant optimization problems in the fields of wireless communication and network security. Nature-inspired optimization algorithms are quite vital tools for this kind of optimization problem. In this paper, a problem-specific adaptive version of the Grey Wolf Optimization Algorithm has been used to solve this max-min throughput problem, and the performance of the proposed algorithm has been compared with the existing methods and with a few existing meta-heuristic algorithms. The balance between the exploration and the exploitation phase has been controlled to enhance the convergence speed to yield the optimal solution in the lowest possible time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
干扰受限无线网络保密率优化的自适应灰狼优化算法
在蜂窝技术的发展过程中,数据安全一直是最大的问题之一。在限制干扰的无线网络中,由于网络中窃听者的介入,安全问题变得尤为重要。因此,最大最小保密吞吐量问题成为无线通信和网络安全领域中最重要的优化问题之一。受自然启发的优化算法是解决这类优化问题的重要工具。本文采用了一种针对特定问题的自适应灰狼优化算法来解决这一最大最小吞吐量问题,并将该算法的性能与现有方法和一些现有的元启发式算法进行了比较。控制了勘探阶段和开采阶段之间的平衡,提高了收敛速度,以便在最短的时间内得到最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Device simulation of a highly efficient CZTS solar cell with CuS as hole transport layer Resonant Tunneling Diode Based Photodetectors Design Rules for Telecom Applications A Plasmonic Biosensor Based on Dual D-Shaped Photonic Crystal Fiber A Case Study on Information Fusion Modelling in Email Archives Low Loss Triple Cladding Antiresonant Hollow Core Fiber
×
引用
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