{"title":"基于深度学习的无线供电协作通信网络低复杂度中继选择","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":"{\"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}","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}
Deep Learning based Low Complexity Relay Selection for Wireless Powered Cooperative Communication Networks
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.