Xi Song, Dongsheng Han, Liqin Shi, Yinghui Ye, Xiaoli Chu
{"title":"Energy Efficiency Maximization for a Relay Assisted Parasitic Symbiotic Radio Network","authors":"Xi Song, Dongsheng Han, Liqin Shi, Yinghui Ye, 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}
引用次数: 0
Abstract
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 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