中继辅助寄生共生无线网络的能源效率最大化

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Xi Song, Dongsheng Han, Liqin Shi, Yinghui Ye, Xiaoli Chu
{"title":"中继辅助寄生共生无线网络的能源效率最大化","authors":"Xi Song,&nbsp;Dongsheng Han,&nbsp;Liqin Shi,&nbsp;Yinghui Ye,&nbsp;Xiaoli Chu","doi":"10.1049/cmu2.70058","DOIUrl":null,"url":null,"abstract":"<p>Relay-assisted symbiotic radio (SR) has been recently proposed to overcome the blocking of the direct link from the primary transmitter (PT) or backscatter node (BN) to the destination node (DN). However, the energy efficiency (EE), which is an important performance metric for SR networks, has been largely ignored in existing studies of the relay-assisted SR. To fill the gap, this work maximizes the EE of a relay-assisted parasitic SR network, which comprises a PT, a BN, a relay node (RN), and a DN. More specifically, we formulate a mixed-integer programming optimization problem that maximizes the system EE by jointly optimizing the transmit power of the PT, the power reflection coefficient of the BN, the transmit power and the power allocation ratio at the RN as well as the successive interference cancellation (SIC) decoding order at the DN. We decompose the formulated non-convex problem into two subproblems corresponding to the two different SIC decoding orders, respectively. For each subproblem, we convert its objective function from a fractional form into a subtractive form by using a Dinkelbach-based method, and then utilize the block coordinate descent (BCD) method to further decouple it into two subsubproblems that are proved to be convex. Based on the obtained solutions, we devise an iterative algorithm to solve each subproblem by solving its two subsubproblems alternately. The optimal solution to the subproblem with a higher system EE returns a near-optimal solution to the original problem. Simulation results demonstrate the rapid convergence of the proposed algorithms and validate the significant advantages of our proposed algorithms over the baseline schemes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70058","citationCount":"0","resultStr":"{\"title\":\"Energy Efficiency Maximization for a Relay Assisted Parasitic Symbiotic Radio Network\",\"authors\":\"Xi Song,&nbsp;Dongsheng Han,&nbsp;Liqin Shi,&nbsp;Yinghui Ye,&nbsp;Xiaoli Chu\",\"doi\":\"10.1049/cmu2.70058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Relay-assisted symbiotic radio (SR) has been recently proposed to overcome the blocking of the direct link from the primary transmitter (PT) or backscatter node (BN) to the destination node (DN). However, the energy efficiency (EE), which is an important performance metric for SR networks, has been largely ignored in existing studies of the relay-assisted SR. To fill the gap, this work maximizes the EE of a relay-assisted parasitic SR network, which comprises a PT, a BN, a relay node (RN), and a DN. More specifically, we formulate a mixed-integer programming optimization problem that maximizes the system EE by jointly optimizing the transmit power of the PT, the power reflection coefficient of the BN, the transmit power and the power allocation ratio at the RN as well as the successive interference cancellation (SIC) decoding order at the DN. We decompose the formulated non-convex problem into two subproblems corresponding to the two different SIC decoding orders, respectively. For each subproblem, we convert its objective function from a fractional form into a subtractive form by using a Dinkelbach-based method, and then utilize the block coordinate descent (BCD) method to further decouple it into two subsubproblems that are proved to be convex. Based on the obtained solutions, we devise an iterative algorithm to solve each subproblem by solving its two subsubproblems alternately. The optimal solution to the subproblem with a higher system EE returns a near-optimal solution to the original problem. Simulation results demonstrate the rapid convergence of the proposed algorithms and validate the significant advantages of our proposed algorithms over the baseline schemes.</p>\",\"PeriodicalId\":55001,\"journal\":{\"name\":\"IET Communications\",\"volume\":\"19 1\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70058\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.70058\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.70058","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

中继辅助共生无线电(SR)最近被提出,以克服从主发射机(PT)或反向散射节点(BN)到目的节点(DN)的直接链路阻塞。然而,作为SR网络重要的性能指标,能效(EE)在现有的中继辅助SR研究中被很大程度上忽略了。为了填补这一空白,本研究最大限度地提高了中继辅助寄生SR网络的能效(EE),该网络包括一个PT、一个BN、一个中继节点(RN)和一个DN。更具体地说,我们制定了一个混合整数规划优化问题,通过共同优化PT的发射功率、BN的功率反射系数、RN的发射功率和功率分配比以及DN的连续干扰抵消(SIC)解码顺序来最大化系统EE。我们将公式化的非凸问题分解为两个子问题,分别对应两种不同的SIC解码顺序。对于每个子问题,我们使用基于dinkelbach的方法将其目标函数从分数形式转换为减法形式,然后使用块坐标下降(BCD)方法将其进一步解耦为两个证明为凸的子问题。基于得到的解,我们设计了一种迭代算法,通过交替求解子问题的两个子问题来求解每个子问题。具有较高系统EE的子问题的最优解返回原始问题的接近最优解。仿真结果证明了所提算法的快速收敛性,并验证了所提算法相对于基准方案的显著优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy Efficiency Maximization for a Relay Assisted Parasitic Symbiotic Radio Network

Relay-assisted symbiotic radio (SR) has been recently proposed to overcome the blocking of the direct link from the primary transmitter (PT) or backscatter node (BN) to the destination node (DN). However, the energy efficiency (EE), which is an important performance metric for SR networks, has been largely ignored in existing studies of the relay-assisted SR. To fill the gap, this work maximizes the EE of a relay-assisted parasitic SR network, which comprises a PT, a BN, a relay node (RN), and a DN. More specifically, we formulate a mixed-integer programming optimization problem that maximizes the system EE by jointly optimizing the transmit power of the PT, the power reflection coefficient of the BN, the transmit power and the power allocation ratio at the RN as well as the successive interference cancellation (SIC) decoding order at the DN. We decompose the formulated non-convex problem into two subproblems corresponding to the two different SIC decoding orders, respectively. For each subproblem, we convert its objective function from a fractional form into a subtractive form by using a Dinkelbach-based method, and then utilize the block coordinate descent (BCD) method to further decouple it into two subsubproblems that are proved to be convex. Based on the obtained solutions, we devise an iterative algorithm to solve each subproblem by solving its two subsubproblems alternately. The optimal solution to the subproblem with a higher system EE returns a near-optimal solution to the original problem. Simulation results demonstrate the rapid convergence of the proposed algorithms and validate the significant advantages of our proposed algorithms over the baseline schemes.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
×
引用
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学术官方微信