Robust joint multiple resources allocation algorithm for cooperative underwater acoustic communication networks

IF 2.5 4区 计算机科学 Q3 TELECOMMUNICATIONS
Song Han, Aijia Li, Xiaotong Jiang, Xinbin Li, Zhixin Liu, Lei Yan, Tongwei Zhang
{"title":"Robust joint multiple resources allocation algorithm for cooperative underwater acoustic communication networks","authors":"Song Han,&nbsp;Aijia Li,&nbsp;Xiaotong Jiang,&nbsp;Xinbin Li,&nbsp;Zhixin Liu,&nbsp;Lei Yan,&nbsp;Tongwei Zhang","doi":"10.1002/ett.5038","DOIUrl":null,"url":null,"abstract":"<p>In this article, a joint relay selection, power control and time allocation problem is studied to maximize the energy efficiency for the cooperative underwater acoustic communication networks. The joint optimization problem is full of challenges due to the strong coupling of multiple resources and the uncertain characteristics of the underwater acoustic communication scenario. To address this issue, the worst-case method is employed to transform an original uncertain problem into a deterministic problem. Furthermore, we propose the block coordinate descent-based method to decouple the strongly coupling multi-resource allocation problem into three relatively independent sub-problems. The coupling of multiple resources is completely decoupled, thereby greatly reducing the solving difficulty. In addition, given that the sub-problems with the fractional objective function are still non-convex and hard to solve, the Dinkelbach-based method is proposed to transform the fractional objective function into a subtractive form. At last, the relay selection sub-problem is transformed into a integer programming problem, and the time allocation sub-problem is transformed into a linear programming problem, whose optimal solutions can be obtained by some well-established solution methods. The power allocation problem is transformed into a convex optimization problem, which can be solved by the Lagrangian dual method. Finally, in the proposed iteration structure, the three sub-problems are alternatingly solved until convergence. Simulation results are presented to demonstrate the efficiency and robustness of the proposed algorithm.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 10","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Emerging Telecommunications Technologies","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ett.5038","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this article, a joint relay selection, power control and time allocation problem is studied to maximize the energy efficiency for the cooperative underwater acoustic communication networks. The joint optimization problem is full of challenges due to the strong coupling of multiple resources and the uncertain characteristics of the underwater acoustic communication scenario. To address this issue, the worst-case method is employed to transform an original uncertain problem into a deterministic problem. Furthermore, we propose the block coordinate descent-based method to decouple the strongly coupling multi-resource allocation problem into three relatively independent sub-problems. The coupling of multiple resources is completely decoupled, thereby greatly reducing the solving difficulty. In addition, given that the sub-problems with the fractional objective function are still non-convex and hard to solve, the Dinkelbach-based method is proposed to transform the fractional objective function into a subtractive form. At last, the relay selection sub-problem is transformed into a integer programming problem, and the time allocation sub-problem is transformed into a linear programming problem, whose optimal solutions can be obtained by some well-established solution methods. The power allocation problem is transformed into a convex optimization problem, which can be solved by the Lagrangian dual method. Finally, in the proposed iteration structure, the three sub-problems are alternatingly solved until convergence. Simulation results are presented to demonstrate the efficiency and robustness of the proposed algorithm.

Abstract Image

合作式水下声学通信网络的鲁棒联合多资源分配算法
本文研究了一个联合中继选择、功率控制和时间分配问题,以最大化合作水下声学通信网络的能量效率。由于多种资源的强耦合性和水下声学通信场景的不确定性特征,联合优化问题充满挑战。针对这一问题,我们采用了最坏情况法,将原来的不确定问题转化为确定性问题。此外,我们还提出了基于块坐标下降的方法,将强耦合的多资源分配问题解耦为三个相对独立的子问题。多个资源的耦合被完全解耦,从而大大降低了求解难度。此外,考虑到分数目标函数的子问题仍然是非凸求解,因此提出了基于 Dinkelbach 的方法,将分数目标函数转化为减函数形式。最后,将中继选择子问题转化为整数编程问题,将时间分配子问题转化为线性编程问题,通过一些成熟的求解方法可以得到其最优解。功率分配问题被转化为一个凸优化问题,可用拉格朗日对偶法求解。最后,在所提出的迭代结构中,三个子问题交替求解,直至收敛。仿真结果表明了所提算法的效率和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.90
自引率
13.90%
发文量
249
期刊介绍: ransactions on Emerging Telecommunications Technologies (ETT), formerly known as European Transactions on Telecommunications (ETT), has the following aims: - to attract cutting-edge publications from leading researchers and research groups around the world - to become a highly cited source of timely research findings in emerging fields of telecommunications - to limit revision and publication cycles to a few months and thus significantly increase attractiveness to publish - to become the leading journal for publishing the latest developments in telecommunications
×
引用
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学术官方微信