随机条件下自供电无线多跳D2D设置的源速率规划:一种基于场景的迭代优化方法

IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Georgia Stavropoulou, Eleni Stai, Maria Diamanti, Symeon Papavassiliou
{"title":"随机条件下自供电无线多跳D2D设置的源速率规划:一种基于场景的迭代优化方法","authors":"Georgia Stavropoulou,&nbsp;Eleni Stai,&nbsp;Maria Diamanti,&nbsp;Symeon Papavassiliou","doi":"10.1016/j.comcom.2025.108299","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-hop Device-to-Device (D2D) communications are emerging as the foundation for numerous compelling 6G applications, enabling seamless information flow between distributed nodes. In the context of such uncertain wireless multi-hop D2D settings, jointly optimizing source data rates, routing, and transmission power decisions is both an essential task and a highly complex problem, particularly due to uncertainties introduced by the wireless channel states and the energy harvesting processes on the nodes. In the current literature, this problem is mostly tackled in a future agnostic sense, and/or using specific distributions to model the uncertainties. In contrast, in this paper, we compute a future energy and resource allocation plan of the network’s operation, using scenario-based optimization techniques to account for stochasticities. Scenarios can model generic distributions of uncertain quantities in a tractable manner. The formulated problem is inherently non-convex and to solve it, we propose CoNetPlan-E, a heuristic iterative method that at each iteration solves appropriately parameterized convex approximations of the original problem. We prove that CoNetPlan-E converges under realistic assumptions, while ensuring that the obtained solution at convergence is feasible for the original non-convex problem. Numerical evaluations showcase the effectiveness of the proposed method compared to existing baseline solutions, while considering three levels of increasing network topology complexity. Importantly, CoNetPlan-E is superior with respect to scalability and runtime while leading to close-to-optimal solutions as these are determined by the standard non-convex solver Ipopt.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"242 ","pages":"Article 108299"},"PeriodicalIF":4.3000,"publicationDate":"2025-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Source-rate planning in self-powered wireless multi-hop D2D settings under stochasticity: A scenario-based iterative optimization approach\",\"authors\":\"Georgia Stavropoulou,&nbsp;Eleni Stai,&nbsp;Maria Diamanti,&nbsp;Symeon Papavassiliou\",\"doi\":\"10.1016/j.comcom.2025.108299\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Multi-hop Device-to-Device (D2D) communications are emerging as the foundation for numerous compelling 6G applications, enabling seamless information flow between distributed nodes. In the context of such uncertain wireless multi-hop D2D settings, jointly optimizing source data rates, routing, and transmission power decisions is both an essential task and a highly complex problem, particularly due to uncertainties introduced by the wireless channel states and the energy harvesting processes on the nodes. In the current literature, this problem is mostly tackled in a future agnostic sense, and/or using specific distributions to model the uncertainties. In contrast, in this paper, we compute a future energy and resource allocation plan of the network’s operation, using scenario-based optimization techniques to account for stochasticities. Scenarios can model generic distributions of uncertain quantities in a tractable manner. The formulated problem is inherently non-convex and to solve it, we propose CoNetPlan-E, a heuristic iterative method that at each iteration solves appropriately parameterized convex approximations of the original problem. We prove that CoNetPlan-E converges under realistic assumptions, while ensuring that the obtained solution at convergence is feasible for the original non-convex problem. Numerical evaluations showcase the effectiveness of the proposed method compared to existing baseline solutions, while considering three levels of increasing network topology complexity. Importantly, CoNetPlan-E is superior with respect to scalability and runtime while leading to close-to-optimal solutions as these are determined by the standard non-convex solver Ipopt.</div></div>\",\"PeriodicalId\":55224,\"journal\":{\"name\":\"Computer Communications\",\"volume\":\"242 \",\"pages\":\"Article 108299\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0140366425002567\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366425002567","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

多跳设备到设备(D2D)通信正在成为许多引人注目的6G应用程序的基础,实现分布式节点之间的无缝信息流。在这种不确定的无线多跳D2D设置背景下,联合优化源数据速率、路由和传输功率决策既是一项基本任务,也是一个高度复杂的问题,特别是由于无线信道状态和节点上的能量收集过程带来的不确定性。在目前的文献中,这个问题主要是在未来的不可知论意义上解决的,和/或使用特定的分布来模拟不确定性。相比之下,在本文中,我们计算了网络运行的未来能源和资源分配计划,使用基于场景的优化技术来考虑随机性。场景可以以一种易于处理的方式对不确定数量的一般分布进行建模。该公式化问题本质上是非凸的,为了解决它,我们提出了CoNetPlan-E,一种启发式迭代方法,在每次迭代中适当地求解原始问题的参数化凸近似。我们证明了CoNetPlan-E在现实假设下收敛,同时保证了在收敛处得到的解对于原非凸问题是可行的。与现有的基线解决方案相比,数值评估显示了所提出方法的有效性,同时考虑了网络拓扑复杂性增加的三个层次。重要的是,CoNetPlan-E在可扩展性和运行时间方面具有优势,同时可以产生接近最优的解决方案,因为这些都是由标准的非凸求解器Ipopt确定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Source-rate planning in self-powered wireless multi-hop D2D settings under stochasticity: A scenario-based iterative optimization approach
Multi-hop Device-to-Device (D2D) communications are emerging as the foundation for numerous compelling 6G applications, enabling seamless information flow between distributed nodes. In the context of such uncertain wireless multi-hop D2D settings, jointly optimizing source data rates, routing, and transmission power decisions is both an essential task and a highly complex problem, particularly due to uncertainties introduced by the wireless channel states and the energy harvesting processes on the nodes. In the current literature, this problem is mostly tackled in a future agnostic sense, and/or using specific distributions to model the uncertainties. In contrast, in this paper, we compute a future energy and resource allocation plan of the network’s operation, using scenario-based optimization techniques to account for stochasticities. Scenarios can model generic distributions of uncertain quantities in a tractable manner. The formulated problem is inherently non-convex and to solve it, we propose CoNetPlan-E, a heuristic iterative method that at each iteration solves appropriately parameterized convex approximations of the original problem. We prove that CoNetPlan-E converges under realistic assumptions, while ensuring that the obtained solution at convergence is feasible for the original non-convex problem. Numerical evaluations showcase the effectiveness of the proposed method compared to existing baseline solutions, while considering three levels of increasing network topology complexity. Importantly, CoNetPlan-E is superior with respect to scalability and runtime while leading to close-to-optimal solutions as these are determined by the standard non-convex solver Ipopt.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信