Chunyuan Tian, Yanzhi Hu, Shengbin Lin, Liteng Hong, Zhiyong Shi
{"title":"面向动态用户的多无人机- bs网络快速分层优化算法","authors":"Chunyuan Tian, Yanzhi Hu, Shengbin Lin, Liteng Hong, Zhiyong Shi","doi":"10.1016/j.adhoc.2025.104001","DOIUrl":null,"url":null,"abstract":"<div><div>In response to dynamic user requirements, unmanned aerial vehicles can act as airborne base stations (UAV-BSs) and adopt real-time position adjustment tactics to offer access services. Nevertheless, the frequent movements of UAV-BSs heighten the complexity of network adjustments and diminish battery durability. To tackle this challenge, this paper proposes a fast hierarchical optimization algorithm. By jointly optimizing frequency allocation, power optimization, and position deployment, the algorithm intends to maximize the number of users receiving high-quality-of-service (QoS) communications. When real-time monitoring detects that the user's communication quality falls below the threshold, the algorithm triggers optimization of power and frequency parameters. To solve the non-convex optimization problem, the Block Coordinate Descent (BCD) algorithm and Genetic Algorithm (GA) are employed in an alternating computational process to obtain optimal solution. If a portion of users has not been restored above the threshold after adjusting these parameters, the re-deployment of the positions of the multi-UAV-BS will be triggered, and all parameters will be re-optimized. Simulation results show that the proposed algorithm not only presents robust convergence but also achieves a 95.5 % user coverage rate. Compared with single-objective optimization methods, the proposed algorithm shows superior performance.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"178 ","pages":"Article 104001"},"PeriodicalIF":4.8000,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast hierarchical optimization algorithm for multi-UAV-BS network for dynamic users\",\"authors\":\"Chunyuan Tian, Yanzhi Hu, Shengbin Lin, Liteng Hong, Zhiyong Shi\",\"doi\":\"10.1016/j.adhoc.2025.104001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In response to dynamic user requirements, unmanned aerial vehicles can act as airborne base stations (UAV-BSs) and adopt real-time position adjustment tactics to offer access services. Nevertheless, the frequent movements of UAV-BSs heighten the complexity of network adjustments and diminish battery durability. To tackle this challenge, this paper proposes a fast hierarchical optimization algorithm. By jointly optimizing frequency allocation, power optimization, and position deployment, the algorithm intends to maximize the number of users receiving high-quality-of-service (QoS) communications. When real-time monitoring detects that the user's communication quality falls below the threshold, the algorithm triggers optimization of power and frequency parameters. To solve the non-convex optimization problem, the Block Coordinate Descent (BCD) algorithm and Genetic Algorithm (GA) are employed in an alternating computational process to obtain optimal solution. If a portion of users has not been restored above the threshold after adjusting these parameters, the re-deployment of the positions of the multi-UAV-BS will be triggered, and all parameters will be re-optimized. Simulation results show that the proposed algorithm not only presents robust convergence but also achieves a 95.5 % user coverage rate. Compared with single-objective optimization methods, the proposed algorithm shows superior performance.</div></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":\"178 \",\"pages\":\"Article 104001\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870525002495\",\"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":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870525002495","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Fast hierarchical optimization algorithm for multi-UAV-BS network for dynamic users
In response to dynamic user requirements, unmanned aerial vehicles can act as airborne base stations (UAV-BSs) and adopt real-time position adjustment tactics to offer access services. Nevertheless, the frequent movements of UAV-BSs heighten the complexity of network adjustments and diminish battery durability. To tackle this challenge, this paper proposes a fast hierarchical optimization algorithm. By jointly optimizing frequency allocation, power optimization, and position deployment, the algorithm intends to maximize the number of users receiving high-quality-of-service (QoS) communications. When real-time monitoring detects that the user's communication quality falls below the threshold, the algorithm triggers optimization of power and frequency parameters. To solve the non-convex optimization problem, the Block Coordinate Descent (BCD) algorithm and Genetic Algorithm (GA) are employed in an alternating computational process to obtain optimal solution. If a portion of users has not been restored above the threshold after adjusting these parameters, the re-deployment of the positions of the multi-UAV-BS will be triggered, and all parameters will be re-optimized. Simulation results show that the proposed algorithm not only presents robust convergence but also achieves a 95.5 % user coverage rate. Compared with single-objective optimization methods, the proposed algorithm shows superior performance.
期刊介绍:
The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to:
Mobile and Wireless Ad Hoc Networks
Sensor Networks
Wireless Local and Personal Area Networks
Home Networks
Ad Hoc Networks of Autonomous Intelligent Systems
Novel Architectures for Ad Hoc and Sensor Networks
Self-organizing Network Architectures and Protocols
Transport Layer Protocols
Routing protocols (unicast, multicast, geocast, etc.)
Media Access Control Techniques
Error Control Schemes
Power-Aware, Low-Power and Energy-Efficient Designs
Synchronization and Scheduling Issues
Mobility Management
Mobility-Tolerant Communication Protocols
Location Tracking and Location-based Services
Resource and Information Management
Security and Fault-Tolerance Issues
Hardware and Software Platforms, Systems, and Testbeds
Experimental and Prototype Results
Quality-of-Service Issues
Cross-Layer Interactions
Scalability Issues
Performance Analysis and Simulation of Protocols.