Coverage Optimization for UAV Base Stations using Simulated Annealing

Nicholas Hao Zheng Lim, Ying Loong Lee, Mau-Luen Tham, Yoong Choon Chang, Allyson Gek Hong Sim, Donghong Qin
{"title":"Coverage Optimization for UAV Base Stations using Simulated Annealing","authors":"Nicholas Hao Zheng Lim, Ying Loong Lee, Mau-Luen Tham, Yoong Choon Chang, Allyson Gek Hong Sim, Donghong Qin","doi":"10.1109/MICC53484.2021.9642136","DOIUrl":null,"url":null,"abstract":"Conventional terrestrial base stations (BSs) are prone to natural disasters and they are not flexible to cater to the sudden surge in the number of users in various locations within their coverage area. Therefore, unmanned aerial vehicle (UAV)-carried BSs (UAV-BSs) have been proposed to overcome this problem, thanks to their advantages in flexible UAV-BS placement and simple deployment. However, the positioning of the UAV-BSs for maximum coverage with satisfactory received data rate is a challenging task. Therefore, the objective of this study is to develop a UAV-BS placement scheme which maximizes the communication coverage. To this end, we formulate the UAVBS placement optimization problem to maximize the coverage of multiple UAV-BSs in a given area, while taking into account the collision avoidance between the UAV-BSs. Then, an artificial intelligence technique known as simulated annealing is used to develop an algorithm to solve the optimization problem. Simulation results have shown that the proposed algorithm outperforms static UAV-BS placement in terms of quality of service and throughput.","PeriodicalId":370324,"journal":{"name":"2021 IEEE 15th Malaysia International Conference on Communication (MICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 15th Malaysia International Conference on Communication (MICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MICC53484.2021.9642136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Conventional terrestrial base stations (BSs) are prone to natural disasters and they are not flexible to cater to the sudden surge in the number of users in various locations within their coverage area. Therefore, unmanned aerial vehicle (UAV)-carried BSs (UAV-BSs) have been proposed to overcome this problem, thanks to their advantages in flexible UAV-BS placement and simple deployment. However, the positioning of the UAV-BSs for maximum coverage with satisfactory received data rate is a challenging task. Therefore, the objective of this study is to develop a UAV-BS placement scheme which maximizes the communication coverage. To this end, we formulate the UAVBS placement optimization problem to maximize the coverage of multiple UAV-BSs in a given area, while taking into account the collision avoidance between the UAV-BSs. Then, an artificial intelligence technique known as simulated annealing is used to develop an algorithm to solve the optimization problem. Simulation results have shown that the proposed algorithm outperforms static UAV-BS placement in terms of quality of service and throughput.
基于模拟退火的无人机基站覆盖优化
传统的地面基站容易受到自然灾害的影响,而且无法灵活应付其覆盖范围内不同地点的用户突然激增的情况。因此,UAV-BSs (unmanned aerial vehicle - carry -BSs, UAV-BSs)由于其UAV- bs放置灵活、部署简单等优点而被提出来克服这一问题。然而,定位UAV-BSs以获得最大覆盖范围和满意的接收数据速率是一项具有挑战性的任务。因此,本研究的目标是开发一种最大化通信覆盖的无人机- bs放置方案。为此,我们制定了UAVBS布局优化问题,以在给定区域内最大限度地覆盖多个UAV-BSs,同时考虑UAV-BSs之间的避碰。然后,使用人工智能技术模拟退火来开发算法来解决优化问题。仿真结果表明,该算法在服务质量和吞吐量方面优于静态无人机- bs布局。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书