{"title":"Exploring Long-Term Commensalism: Throughput Maximization for Symbiotic Radio Networks","authors":"Yuzhe Chen;Yanjun Li;Chung Shue Chen;Kaikai Chi","doi":"10.1109/TMC.2024.3495015","DOIUrl":null,"url":null,"abstract":"Symbiotic radio (SR), combining the advantages of cognitive radio and ambient backscatter communication (AmBC), stands as a promising solution for spectrum-and-energy-efficient wireless communications. In an SR network, backscatter devices (BDs) share the spectrum resources with the primary transmitter (PT) by utilizing the incident radio frequency (RF) signal from PT for uplink non-orthogonal multiple access (NOMA) transmission. The primary receiver (PR) decodes the signals of PT and BDs via the successive interference cancellation (SIC) technique. Our goal is to establish a long-term commensalistic relationship between PT and BDs. We address the problem of maximizing the long-term average sum rate of BDs while ensuring a minimum average rate for the PT by optimizing the power reflection coefficients of the BDs. We explicitly consider practical constraints such as the required power difference among signals for SIC decoding and the unknown future channel state information (CSI). We prove the NP-hardness of the offline version of the problem and subsequently employ the Lyapunov optimization technique to convert the original problem into a series of sub-problems in each individual time slot that can be solved in an online manner without relying on future CSI. We then utilize the successive convex optimization (SCO) technique to solve the non-convex sub-problems. Extensive simulations validate that our proposed Lyapunov-SCO algorithm achieves superior performance in terms of the average sum rate of BDs while ensuring PT’s required average rate. In addition, we provide discussions on extending the proposed solution to SR networks with multiple PT-PR pairs, high-mobility BDs, and enhancing fairness among BDs.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 3","pages":"2376-2393"},"PeriodicalIF":7.7000,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10748359/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Symbiotic radio (SR), combining the advantages of cognitive radio and ambient backscatter communication (AmBC), stands as a promising solution for spectrum-and-energy-efficient wireless communications. In an SR network, backscatter devices (BDs) share the spectrum resources with the primary transmitter (PT) by utilizing the incident radio frequency (RF) signal from PT for uplink non-orthogonal multiple access (NOMA) transmission. The primary receiver (PR) decodes the signals of PT and BDs via the successive interference cancellation (SIC) technique. Our goal is to establish a long-term commensalistic relationship between PT and BDs. We address the problem of maximizing the long-term average sum rate of BDs while ensuring a minimum average rate for the PT by optimizing the power reflection coefficients of the BDs. We explicitly consider practical constraints such as the required power difference among signals for SIC decoding and the unknown future channel state information (CSI). We prove the NP-hardness of the offline version of the problem and subsequently employ the Lyapunov optimization technique to convert the original problem into a series of sub-problems in each individual time slot that can be solved in an online manner without relying on future CSI. We then utilize the successive convex optimization (SCO) technique to solve the non-convex sub-problems. Extensive simulations validate that our proposed Lyapunov-SCO algorithm achieves superior performance in terms of the average sum rate of BDs while ensuring PT’s required average rate. In addition, we provide discussions on extending the proposed solution to SR networks with multiple PT-PR pairs, high-mobility BDs, and enhancing fairness among BDs.
期刊介绍:
IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.