多无人机辅助地面网络的公平意识效用最大化

IF 5.3 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Open Journal of Vehicular Technology Pub Date : 2024-10-21 DOI:10.1109/OJVT.2024.3477268
Nishant Gupta;Satyam Agarwal;Aymen Fakhreddine
{"title":"多无人机辅助地面网络的公平意识效用最大化","authors":"Nishant Gupta;Satyam Agarwal;Aymen Fakhreddine","doi":"10.1109/OJVT.2024.3477268","DOIUrl":null,"url":null,"abstract":"Integrating unmanned aerial vehicles (UAVs) with terrestrial networks can enable high-speed communication in various applications. UAVs can serve as aerial base stations (ABSs), offering several benefits to the existing terrestrial networks, such as enhanced coverage, increased capacity, rapid deployment, and mobile communication support. However, this integration presents various technical challenges, including coordination, interference management, and dynamic allocation of resources. To address these key challenges, in this paper, we maximize the network utility by jointly optimizing the scheduling and cell association, transmit power of all base stations, and ABS deployment locations in the presence of co-channel interference. A two-stage approach is proposed to obtain a solution. In the first stage, we propose a heuristic solution by using the clustering algorithm to determine the initial ABS locations and user scheduling while ignoring the co-channel interference. In the second stage, we utilize the solution obtained in the first part and develop an interference-aware iterative scheme to jointly optimize user scheduling, resource allocation, and ABS placement. Given the non-convex nature of this problem, we employ the successive convex approximation technique to approximate the non-convex objectives and constraints. Numerical results show the proposed approach's insights and effectiveness over other schemes. Specifically, our proposed approach provides an average of 25% improvement over the benchmark schemes.","PeriodicalId":34270,"journal":{"name":"IEEE Open Journal of Vehicular Technology","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10726751","citationCount":"0","resultStr":"{\"title\":\"Fairness-Aware Utility Maximization for Multi-UAV-Aided Terrestrial Networks\",\"authors\":\"Nishant Gupta;Satyam Agarwal;Aymen Fakhreddine\",\"doi\":\"10.1109/OJVT.2024.3477268\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Integrating unmanned aerial vehicles (UAVs) with terrestrial networks can enable high-speed communication in various applications. UAVs can serve as aerial base stations (ABSs), offering several benefits to the existing terrestrial networks, such as enhanced coverage, increased capacity, rapid deployment, and mobile communication support. However, this integration presents various technical challenges, including coordination, interference management, and dynamic allocation of resources. To address these key challenges, in this paper, we maximize the network utility by jointly optimizing the scheduling and cell association, transmit power of all base stations, and ABS deployment locations in the presence of co-channel interference. A two-stage approach is proposed to obtain a solution. In the first stage, we propose a heuristic solution by using the clustering algorithm to determine the initial ABS locations and user scheduling while ignoring the co-channel interference. In the second stage, we utilize the solution obtained in the first part and develop an interference-aware iterative scheme to jointly optimize user scheduling, resource allocation, and ABS placement. Given the non-convex nature of this problem, we employ the successive convex approximation technique to approximate the non-convex objectives and constraints. Numerical results show the proposed approach's insights and effectiveness over other schemes. Specifically, our proposed approach provides an average of 25% improvement over the benchmark schemes.\",\"PeriodicalId\":34270,\"journal\":{\"name\":\"IEEE Open Journal of Vehicular Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10726751\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Open Journal of Vehicular Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10726751/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of Vehicular Technology","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10726751/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

将无人飞行器(UAV)与地面网络相结合,可以在各种应用中实现高速通信。无人飞行器可作为空中基站(ABS),为现有地面网络提供多种优势,如增强覆盖、提高容量、快速部署和移动通信支持。然而,这种整合带来了各种技术挑战,包括协调、干扰管理和资源的动态分配。为了应对这些关键挑战,本文通过联合优化调度和小区关联、所有基站的发射功率以及共信道干扰情况下的 ABS 部署位置,实现网络效用的最大化。本文提出了一种分两个阶段的解决方案。在第一阶段,我们提出了一种启发式解决方案,利用聚类算法确定初始 ABS 位置和用户调度,同时忽略同频干扰。在第二阶段,我们利用第一部分获得的解决方案,开发了一种干扰感知迭代方案,以联合优化用户调度、资源分配和 ABS 位置。鉴于该问题的非凸性质,我们采用了连续凸近似技术来近似非凸目标和约束条件。数值结果表明,与其他方案相比,我们提出的方法具有独到的见解和有效性。具体来说,我们提出的方法比基准方案平均提高了 25%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fairness-Aware Utility Maximization for Multi-UAV-Aided Terrestrial Networks
Integrating unmanned aerial vehicles (UAVs) with terrestrial networks can enable high-speed communication in various applications. UAVs can serve as aerial base stations (ABSs), offering several benefits to the existing terrestrial networks, such as enhanced coverage, increased capacity, rapid deployment, and mobile communication support. However, this integration presents various technical challenges, including coordination, interference management, and dynamic allocation of resources. To address these key challenges, in this paper, we maximize the network utility by jointly optimizing the scheduling and cell association, transmit power of all base stations, and ABS deployment locations in the presence of co-channel interference. A two-stage approach is proposed to obtain a solution. In the first stage, we propose a heuristic solution by using the clustering algorithm to determine the initial ABS locations and user scheduling while ignoring the co-channel interference. In the second stage, we utilize the solution obtained in the first part and develop an interference-aware iterative scheme to jointly optimize user scheduling, resource allocation, and ABS placement. Given the non-convex nature of this problem, we employ the successive convex approximation technique to approximate the non-convex objectives and constraints. Numerical results show the proposed approach's insights and effectiveness over other schemes. Specifically, our proposed approach provides an average of 25% improvement over the benchmark schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
9.60
自引率
0.00%
发文量
25
审稿时长
10 weeks
期刊最新文献
Digital Twin-Empowered Green Mobility Management in Next-Gen Transportation Networks Fairness-Aware Utility Maximization for Multi-UAV-Aided Terrestrial Networks LiFi for Industry 4.0: Main Features, Implementation and Initial Testing of IEEE Std 802.15.13 Partial Learning-Based Iterative Detection of MIMO Systems Decentralized and Asymmetric Multi-Agent Learning in Construction Sites
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1