A Proactive Joint Strategy on Trajectory and Caching for UAV-Assisted Networks: A Data-Driven Distributionally Robust Approach

Xuanheng Li, Jiahong Liu, Nan Zhao, Nianmin Yao
{"title":"A Proactive Joint Strategy on Trajectory and Caching for UAV-Assisted Networks: A Data-Driven Distributionally Robust Approach","authors":"Xuanheng Li, Jiahong Liu, Nan Zhao, Nianmin Yao","doi":"10.1109/iccc52777.2021.9580368","DOIUrl":null,"url":null,"abstract":"With the soaring growth of data traffic, unmanned aerial vehicle (UAV) based edge caching has been regarded as a promising solution to alleviate network congestion and enable users to obtain their desired contents with reduced delay. For the UAV-based edge caching, how to jointly plan the trajectory and caching strategy is the key, which determines how much benefit can achieve accordingly. Such a joint strategy design highly depends on the content demands in the network. However, the content demands are usually heterogeneous both temporally and spatially, and hardly known in advance. Such demand uncertainty makes the joint strategy design extremely challenging. In this paper, aiming at maximizing the reduced delay brought by the UAV-based edge caching, we propose a proactive joint trajectory and caching strategy under uncertain content demands. We formulate it into a risk-averse stochastic optimization problem to guarantee the maximal benefit with a high probability. Furthermore, considering the fact that the precise distributional information might be unavailable in practice, we focus on the worst case and develop a data-driven distributionally robust solution, making the strategy trustworthy. Simulation results demonstrate the effectiveness of the proposed strategy.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"9 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

With the soaring growth of data traffic, unmanned aerial vehicle (UAV) based edge caching has been regarded as a promising solution to alleviate network congestion and enable users to obtain their desired contents with reduced delay. For the UAV-based edge caching, how to jointly plan the trajectory and caching strategy is the key, which determines how much benefit can achieve accordingly. Such a joint strategy design highly depends on the content demands in the network. However, the content demands are usually heterogeneous both temporally and spatially, and hardly known in advance. Such demand uncertainty makes the joint strategy design extremely challenging. In this paper, aiming at maximizing the reduced delay brought by the UAV-based edge caching, we propose a proactive joint trajectory and caching strategy under uncertain content demands. We formulate it into a risk-averse stochastic optimization problem to guarantee the maximal benefit with a high probability. Furthermore, considering the fact that the precise distributional information might be unavailable in practice, we focus on the worst case and develop a data-driven distributionally robust solution, making the strategy trustworthy. Simulation results demonstrate the effectiveness of the proposed strategy.
无人机辅助网络的轨迹和缓存的主动联合策略:数据驱动的分布式鲁棒方法
随着数据流量的飞速增长,基于无人机(UAV)的边缘缓存被认为是缓解网络拥塞、使用户能够以更低的延迟获得所需内容的一种很有前途的解决方案。对于基于无人机的边缘缓存,如何联合规划轨迹和缓存策略是关键,决定了相应的效益能达到多少。这种联合策略的设计高度依赖于网络中的内容需求。然而,内容需求通常在时间和空间上都是异质的,很难事先知道。这种需求的不确定性使得联合战略设计极具挑战性。为了最大限度地降低无人机边缘缓存带来的延迟,本文提出了一种不确定内容需求下的主动联合轨迹和缓存策略。我们将其转化为一个规避风险的随机优化问题,以保证高概率的最大效益。此外,考虑到在实践中可能无法获得精确的分布信息,我们将重点放在最坏情况下,并开发了一个数据驱动的分布鲁棒解决方案,使该策略值得信赖。仿真结果验证了该策略的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信