Deep Learning based Low Complexity Relay Selection for Wireless Powered Cooperative Communication Networks

Aysun Gurur Onalan, S. Coleri
{"title":"Deep Learning based Low Complexity Relay Selection for Wireless Powered Cooperative Communication Networks","authors":"Aysun Gurur Onalan, S. Coleri","doi":"10.1109/BalkanCom58402.2023.10167900","DOIUrl":null,"url":null,"abstract":"Energy harvesting relays significantly improve network performance in Wireless Powered Cooperative Communication Networks (WPCCNs). The relay selection problem in WPCCNs is commonly solved by iterative algorithms with high runtimes, which is unpractical for real-life applications. This paper proposes a low complexity solution based on deep learning to solve the relay selection problem with the objective of minimum schedule length in multi-source-multi-relay WPCCNs. We formulate the relay selection problem as a novel multi-class classification problem whose classes represent all possible relay selection combinations for all sources. To solve this classification problem, a feed-forward deep neural network (DNN) architecture is designed. The inputs are the channel gains and parameters derived from these gains based on the optimality conditions of the problem. The output is the relay selection for all sources represented by a class. Conventional supervised Machine Learning (ML) algorithms, including Decision Tree, Random Forest, Support Vector Machine, and K-Nearest Neighbour, are also implemented for benchmark comparisons. The proposed network outperforms the benchmark ML algorithms and previous iterative heuristic algorithms regarding precision, recall, fl-score, accuracy, and optimality gap in schedule length with lower runtime.","PeriodicalId":363999,"journal":{"name":"2023 International Balkan Conference on Communications and Networking (BalkanCom)","volume":" 46","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Balkan Conference on Communications and Networking (BalkanCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BalkanCom58402.2023.10167900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Energy harvesting relays significantly improve network performance in Wireless Powered Cooperative Communication Networks (WPCCNs). The relay selection problem in WPCCNs is commonly solved by iterative algorithms with high runtimes, which is unpractical for real-life applications. This paper proposes a low complexity solution based on deep learning to solve the relay selection problem with the objective of minimum schedule length in multi-source-multi-relay WPCCNs. We formulate the relay selection problem as a novel multi-class classification problem whose classes represent all possible relay selection combinations for all sources. To solve this classification problem, a feed-forward deep neural network (DNN) architecture is designed. The inputs are the channel gains and parameters derived from these gains based on the optimality conditions of the problem. The output is the relay selection for all sources represented by a class. Conventional supervised Machine Learning (ML) algorithms, including Decision Tree, Random Forest, Support Vector Machine, and K-Nearest Neighbour, are also implemented for benchmark comparisons. The proposed network outperforms the benchmark ML algorithms and previous iterative heuristic algorithms regarding precision, recall, fl-score, accuracy, and optimality gap in schedule length with lower runtime.
基于深度学习的无线供电协作通信网络低复杂度中继选择
能量收集中继显著提高了无线供电协作通信网络(wpccn)的网络性能。wpccn中的中继选择问题通常采用高运行时间的迭代算法来解决,这在实际应用中是不实用的。针对多源多中继wpccn中以最小调度长度为目标的中继选择问题,提出了一种基于深度学习的低复杂度解决方案。我们将中继选择问题表述为一个新的多类分类问题,其类表示所有源的所有可能的中继选择组合。为了解决这一分类问题,设计了一种前馈深度神经网络(DNN)架构。输入是通道增益和基于问题的最优性条件的由这些增益导出的参数。输出是由一个类表示的所有源的中继选择。传统的监督机器学习(ML)算法,包括决策树、随机森林、支持向量机和k近邻,也被用于基准比较。所提出的网络在精度、召回率、fl-score、准确性和调度长度的最优性差距方面优于基准ML算法和以前的迭代启发式算法,并且运行时间更短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信