Channel Knowledge Map (CKM)-Assisted Multi-UAV Wireless Network: CKM Construction and UAV Placement

Haoyun Li;Peiming Li;Gaoyuan Cheng;Jie Xu;Junting Chen;Yong Zeng
{"title":"Channel Knowledge Map (CKM)-Assisted Multi-UAV Wireless Network: CKM Construction and UAV Placement","authors":"Haoyun Li;Peiming Li;Gaoyuan Cheng;Jie Xu;Junting Chen;Yong Zeng","doi":"10.23919/JCIN.2023.10272353","DOIUrl":null,"url":null,"abstract":"Channel knowledge map (CKM) has recently emerged as a viable new solution to facilitate the placement and trajectory optimization for unmanned aerial vehicle (UAV) communications, by exploiting the site- and location-specific radio propagation information. This paper investigates a CKM-assisted multi-UAV wireless network, by focusing on the construction and utilization of CKMs for multi-UAV placement optimization. First, we consider the CKM construction problem when data measurements for only a limited number of points are available. Towards this end, we exploit a data-driven interpolation technique, namely the Kriging method, to construct CKMs to characterize the signal propagation environments. Next, we study the multi-UAV placement optimization problem by utilizing the constructed CKMs, in which the multiple UAVs aim to optimize their placement locations to maximize the weighted sum rate with their respectively associated ground base stations (GBSs). However, the weighted sum rate function based on the CKMs is generally non-differentiable, which renders the conventional optimization techniques relying on function derivatives inapplicable. To tackle this issue, we propose a novel iterative algorithm based on derivative-free optimization, in which a series of quadratic functions are iteratively constructed to approximate the objective function under a set of interpolation conditions, and accordingly, the UAVs' placement locations are updated by maximizing the approximate function subject to a trust region constraint. Finally, numerical results are presented to validate the performance of the proposed designs. It is shown that the Kriging method can construct accurate CKMs for UAVs. Furthermore, the proposed derivative-free placement optimization design based on the Kriging-constructed CKMs achieves a weighted sum rate that is close to the optimal exhaustive search design based on ground-truth CKMs, but with much lower implementation complexity. In addition, the proposed design is shown to significantly outperform other benchmark schemes.","PeriodicalId":100766,"journal":{"name":"Journal of Communications and Information Networks","volume":"8 3","pages":"256-270"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications and Information Networks","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10272353/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Channel knowledge map (CKM) has recently emerged as a viable new solution to facilitate the placement and trajectory optimization for unmanned aerial vehicle (UAV) communications, by exploiting the site- and location-specific radio propagation information. This paper investigates a CKM-assisted multi-UAV wireless network, by focusing on the construction and utilization of CKMs for multi-UAV placement optimization. First, we consider the CKM construction problem when data measurements for only a limited number of points are available. Towards this end, we exploit a data-driven interpolation technique, namely the Kriging method, to construct CKMs to characterize the signal propagation environments. Next, we study the multi-UAV placement optimization problem by utilizing the constructed CKMs, in which the multiple UAVs aim to optimize their placement locations to maximize the weighted sum rate with their respectively associated ground base stations (GBSs). However, the weighted sum rate function based on the CKMs is generally non-differentiable, which renders the conventional optimization techniques relying on function derivatives inapplicable. To tackle this issue, we propose a novel iterative algorithm based on derivative-free optimization, in which a series of quadratic functions are iteratively constructed to approximate the objective function under a set of interpolation conditions, and accordingly, the UAVs' placement locations are updated by maximizing the approximate function subject to a trust region constraint. Finally, numerical results are presented to validate the performance of the proposed designs. It is shown that the Kriging method can construct accurate CKMs for UAVs. Furthermore, the proposed derivative-free placement optimization design based on the Kriging-constructed CKMs achieves a weighted sum rate that is close to the optimal exhaustive search design based on ground-truth CKMs, but with much lower implementation complexity. In addition, the proposed design is shown to significantly outperform other benchmark schemes.
通道知识图谱(CKM)辅助多无人机无线网络:CKM构建与无人机布局
信道知识图(CKM)最近成为一种可行的新解决方案,通过利用特定地点和位置的无线电传播信息,促进无人机(UAV)通信的放置和轨迹优化。本文研究了ckm辅助下的多无人机无线网络,重点研究了ckm在多无人机布局优化中的构建和利用。首先,我们考虑只有有限数量点的数据测量时的CKM构建问题。为此,我们利用数据驱动的插值技术,即Kriging方法,来构建ckm来表征信号传播环境。其次,利用所构建的ckm模型研究了多无人机的布局优化问题,其中多无人机的目标是优化其布局位置,使其与各自关联的地面基站的加权和率最大化。然而,基于ckm的加权和率函数通常是不可微的,这使得传统的依赖函数导数的优化技术不适用。为了解决这一问题,提出了一种基于无导数优化的迭代算法,该算法在一组插值条件下迭代构造一系列二次函数来逼近目标函数,从而在信任域约束下通过逼近函数最大化来更新无人机的放置位置。最后,给出了数值结果来验证所提设计的性能。结果表明,Kriging方法可以准确地构建无人机的ckm。此外,本文提出的基于kriging构造的ckm的无导数放置优化设计,其加权和率接近基于基真ckm的最优穷举搜索设计,但实现复杂性要低得多。此外,所提出的设计被证明明显优于其他基准方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信