Fault-tolerant topology construction and down-link rate maximization in air-ground integrated networks

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2024-09-20 DOI:10.1016/j.comnet.2024.110817
Xijian Luo, Jun Xie, Liqin Xiong, Yaqun Liu, Yuan He
{"title":"Fault-tolerant topology construction and down-link rate maximization in air-ground integrated networks","authors":"Xijian Luo,&nbsp;Jun Xie,&nbsp;Liqin Xiong,&nbsp;Yaqun Liu,&nbsp;Yuan He","doi":"10.1016/j.comnet.2024.110817","DOIUrl":null,"url":null,"abstract":"<div><div>Due to the advantages in flexible deployment, fast communication recovery and high quality of service (QoS), unmanned aerial vehicles (UAVs) have been widely used in wireless communications and networking. However, existing works have not sufficiently solved the problem of reliable and survivable connectivity of UAV networks. In this paper, we investigate the deployment of multiple UAVs, cooperating with a ground mobile station (GMS), to provide wireless coverage for ground users. Under the constraints of satisfying different QoS of users and the resource limitation of UAVs, our aim is to minimize the number of deployed UAVs and maximize the sum down-link rate of all users. In order to ensure the survivability of the deployed UAV networks, we also constraint that each UAV has at least two disjoint paths to GMS to form a fault-tolerant topology. Unfortunately, the formulate problem is intractable and cannot be solved directly. To solve this problem, we decouple the original problem into two subproblems: (1) minimized fault-tolerant topology construction concerning user demands; (2) maximized down-link rate with access policy optimization. Then, we propose a heuristic link-cost minimization method and a potential-game-based user rate maximization method to solve the two subproblems, respectively. The effectiveness of the solution is validated through simulations. Meanwhile, ours also outperforms some baselines in minimized UAVs, down-link transmission rate as well as running time.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624006492","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the advantages in flexible deployment, fast communication recovery and high quality of service (QoS), unmanned aerial vehicles (UAVs) have been widely used in wireless communications and networking. However, existing works have not sufficiently solved the problem of reliable and survivable connectivity of UAV networks. In this paper, we investigate the deployment of multiple UAVs, cooperating with a ground mobile station (GMS), to provide wireless coverage for ground users. Under the constraints of satisfying different QoS of users and the resource limitation of UAVs, our aim is to minimize the number of deployed UAVs and maximize the sum down-link rate of all users. In order to ensure the survivability of the deployed UAV networks, we also constraint that each UAV has at least two disjoint paths to GMS to form a fault-tolerant topology. Unfortunately, the formulate problem is intractable and cannot be solved directly. To solve this problem, we decouple the original problem into two subproblems: (1) minimized fault-tolerant topology construction concerning user demands; (2) maximized down-link rate with access policy optimization. Then, we propose a heuristic link-cost minimization method and a potential-game-based user rate maximization method to solve the two subproblems, respectively. The effectiveness of the solution is validated through simulations. Meanwhile, ours also outperforms some baselines in minimized UAVs, down-link transmission rate as well as running time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
空地一体化网络中的容错拓扑构建和下行链路速率最大化
由于具有部署灵活、通信恢复快和服务质量(QoS)高等优势,无人机(UAV)已被广泛应用于无线通信和网络领域。然而,现有的研究还没有充分解决无人机网络的可靠和可生存连接问题。在本文中,我们研究了多架无人机与地面移动站(GMS)合作部署,为地面用户提供无线覆盖的问题。在满足用户不同 QoS 和无人机资源限制的约束条件下,我们的目标是最小化部署的无人机数量,最大化所有用户的下行链路速率总和。为了确保部署的无人机网络的生存能力,我们还限制每个无人机至少有两条不相交的路径通往 GMS,以形成容错拓扑。遗憾的是,这个问题难以解决,无法直接求解。为了解决这个问题,我们将原问题分解为两个子问题:(1) 与用户需求相关的容错拓扑结构最小化;(2) 与接入策略优化相关的下行链路速率最大化。然后,我们提出了一种启发式链路成本最小化方法和一种基于潜能博弈的用户速率最大化方法来分别解决这两个子问题。通过仿真验证了解决方案的有效性。同时,在无人机最小化、下行链路传输速率和运行时间方面,我们的方案也优于一些基线方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
GWPF: Communication-efficient federated learning with Gradient-Wise Parameter Freezing Slice admission control in 5G wireless communication with multi-dimensional state space and distributed action space: A sequential twin actor-critic approach Quantitative analysis of segmented satellite network architectures: A maritime surveillance case study Machine learning-driven integration of terrestrial and non-terrestrial networks for enhanced 6G connectivity Evaluating integration methods of a quantum random number generator in OpenSSL for TLS
×
引用
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