Scheduling and Relay Selection for Full-Duplex Wireless Powered Cooperative Communication Networks

M. S. Iqbal, Syed Adil Abbas Kazmi, Yalçin Sadi, S. Coleri
{"title":"Scheduling and Relay Selection for Full-Duplex Wireless Powered Cooperative Communication Networks","authors":"M. S. Iqbal, Syed Adil Abbas Kazmi, Yalçin Sadi, S. Coleri","doi":"10.1109/ICCC51575.2020.9345137","DOIUrl":null,"url":null,"abstract":"In this manuscript, we consider a full-duplex wireless powered cooperative communication system where the users communicate with a hybrid access point through relays. We formulate an optimization problem with the objective to minimize the total transmission time through user scheduling and relay selection while considering the traffic demand, energy causality and initial battery levels of the users. The formulated optimization problem is a mixed integer non-linear programming problem, hence difficult to solve for the global optimal solution. As a solution strategy, we decompose the problem into sub problems: time allocation, scheduling and relay selection. In the time allocation problem; the schedule and relays are assumed to be pre-known, we derive the optimal solution by using the optimality analysis. For the scheduling problem; we assume that users know their relays, we determine the optimal schedule. For the relay selection problem; users transmit their information in a pre-determined order, we determine the optimal relays for each user. For the overall scheduling and relay selection problem, we propose a heuristic algorithm which iteratively determines the scheduling and relay selection in polynomial time by using the optimal solutions of the individual relay selection and scheduling problems. Through simulations, we demonstrate that the scheduling length can be significantly reduced through proper scheduling and relay selection. The proposed algorithm performs very close to the optimal solution for different maximum user transmit power, network densities, initial battery levels and hybrid access point power levels.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC51575.2020.9345137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this manuscript, we consider a full-duplex wireless powered cooperative communication system where the users communicate with a hybrid access point through relays. We formulate an optimization problem with the objective to minimize the total transmission time through user scheduling and relay selection while considering the traffic demand, energy causality and initial battery levels of the users. The formulated optimization problem is a mixed integer non-linear programming problem, hence difficult to solve for the global optimal solution. As a solution strategy, we decompose the problem into sub problems: time allocation, scheduling and relay selection. In the time allocation problem; the schedule and relays are assumed to be pre-known, we derive the optimal solution by using the optimality analysis. For the scheduling problem; we assume that users know their relays, we determine the optimal schedule. For the relay selection problem; users transmit their information in a pre-determined order, we determine the optimal relays for each user. For the overall scheduling and relay selection problem, we propose a heuristic algorithm which iteratively determines the scheduling and relay selection in polynomial time by using the optimal solutions of the individual relay selection and scheduling problems. Through simulations, we demonstrate that the scheduling length can be significantly reduced through proper scheduling and relay selection. The proposed algorithm performs very close to the optimal solution for different maximum user transmit power, network densities, initial battery levels and hybrid access point power levels.
全双工无线供电协作通信网络的调度与中继选择
在本文中,我们考虑了一个全双工无线供电的协作通信系统,其中用户通过中继与混合接入点通信。在考虑用户的交通需求、能量因果关系和初始电池电量的情况下,通过用户调度和中继选择,以最小化总传输时间为目标,构造了优化问题。该优化问题是一个混合整数非线性规划问题,难以求解全局最优解。作为一种解决策略,我们将问题分解为时间分配、调度和中继选择等子问题。在时间分配问题上;假设调度和继电器是已知的,利用最优性分析得到最优解。对于调度问题;我们假设用户知道他们的中继,我们确定最优调度。对于继电器的选择问题;用户以预先确定的顺序传输他们的信息,我们为每个用户确定最佳中继。针对全局调度和中继选择问题,提出了一种启发式算法,利用单个中继选择和调度问题的最优解,在多项式时间内迭代确定调度和中继选择。通过仿真,我们证明了通过合理的调度和中继选择可以显著缩短调度长度。在不同的最大用户传输功率、网络密度、初始电池电量和混合接入点功率水平下,该算法的性能非常接近最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信