{"title":"高能效全双工随机存取网络的协调链路自适应","authors":"Huu-Hung Tran;Ji-Hoon Yun","doi":"10.1109/TGCN.2024.3407764","DOIUrl":null,"url":null,"abstract":"In this paper, we develop a coordinated link adaptation scheme to maximize the energy efficiency of a full-duplex (FD) random access network when self-interference cancellation (SIC) is imperfect. First, we model the energy consumption of an FD link and formulate an energy-consumption-per-bit minimization problem with the constellation size of the link as a problem variable. Via numerical results, the model shows that the optimal constellation size of an FD link strongly depends on not only the communication distance but also the SIC capability and data length. Then, we extend the formulation to the energy-consumption minimization problem for an FD random access network. A conservative delay budget for saturated traffic conditions is obtained in terms of the constellation sizes of the associated devices. Finally, the network coordination problem for the constellation sizes is formulated as a nonlinear problem with integer constraints on the constellation sizes, and a solution algorithm for this problem is designed, employing the successive convex approximation method. A comparative evaluation with representative conventional schemes demonstrates that the proposed scheme significantly outperforms the conventional schemes in terms of the energy consumption per bit for a wide range of network environments.","PeriodicalId":13052,"journal":{"name":"IEEE Transactions on Green Communications and Networking","volume":"8 4","pages":"1692-1706"},"PeriodicalIF":5.3000,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Coordinated Link Adaptation for an Energy-Efficient Full-Duplex Random Access Network\",\"authors\":\"Huu-Hung Tran;Ji-Hoon Yun\",\"doi\":\"10.1109/TGCN.2024.3407764\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we develop a coordinated link adaptation scheme to maximize the energy efficiency of a full-duplex (FD) random access network when self-interference cancellation (SIC) is imperfect. First, we model the energy consumption of an FD link and formulate an energy-consumption-per-bit minimization problem with the constellation size of the link as a problem variable. Via numerical results, the model shows that the optimal constellation size of an FD link strongly depends on not only the communication distance but also the SIC capability and data length. Then, we extend the formulation to the energy-consumption minimization problem for an FD random access network. A conservative delay budget for saturated traffic conditions is obtained in terms of the constellation sizes of the associated devices. Finally, the network coordination problem for the constellation sizes is formulated as a nonlinear problem with integer constraints on the constellation sizes, and a solution algorithm for this problem is designed, employing the successive convex approximation method. A comparative evaluation with representative conventional schemes demonstrates that the proposed scheme significantly outperforms the conventional schemes in terms of the energy consumption per bit for a wide range of network environments.\",\"PeriodicalId\":13052,\"journal\":{\"name\":\"IEEE Transactions on Green Communications and Networking\",\"volume\":\"8 4\",\"pages\":\"1692-1706\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Green Communications and Networking\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10543178/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Green Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10543178/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
在本文中,我们开发了一种协调链路适应方案,以在自干扰消除(SIC)不完善的情况下最大化全双工(FD)随机接入网络的能效。首先,我们建立了 FD 链路的能耗模型,并以链路的星座大小为问题变量,提出了每比特能耗最小化问题。通过数值结果,模型表明 FD 链路的最佳星座大小不仅与通信距离密切相关,还与 SIC 能力和数据长度密切相关。然后,我们将公式扩展到 FD 随机接入网络的能量消耗最小化问题。根据相关设备的星座大小,我们得到了饱和流量条件下的保守延迟预算。最后,我们将星座大小的网络协调问题表述为一个对星座大小有整数约束的非线性问题,并采用连续凸近似法设计了该问题的求解算法。与具有代表性的传统方案进行的比较评估表明,在各种网络环境下,拟议方案在每比特能耗方面明显优于传统方案。
Coordinated Link Adaptation for an Energy-Efficient Full-Duplex Random Access Network
In this paper, we develop a coordinated link adaptation scheme to maximize the energy efficiency of a full-duplex (FD) random access network when self-interference cancellation (SIC) is imperfect. First, we model the energy consumption of an FD link and formulate an energy-consumption-per-bit minimization problem with the constellation size of the link as a problem variable. Via numerical results, the model shows that the optimal constellation size of an FD link strongly depends on not only the communication distance but also the SIC capability and data length. Then, we extend the formulation to the energy-consumption minimization problem for an FD random access network. A conservative delay budget for saturated traffic conditions is obtained in terms of the constellation sizes of the associated devices. Finally, the network coordination problem for the constellation sizes is formulated as a nonlinear problem with integer constraints on the constellation sizes, and a solution algorithm for this problem is designed, employing the successive convex approximation method. A comparative evaluation with representative conventional schemes demonstrates that the proposed scheme significantly outperforms the conventional schemes in terms of the energy consumption per bit for a wide range of network environments.