备份
计算机科学
软件部署
遗传算法
基站
搜救
无线
启发式
路径损耗
路径(计算)
分布式计算
实时计算
数学优化
计算机网络
人工智能
电信
机器学习
数学
数据库
机器人
操作系统
作者
Guanxiong Liu,Hazim Shakhatreh,Abdallah Khreishah,Xiwang Guo,Nirwan Ansari
标识
DOI:10.1109/sarnof.2018.8720417
摘要
Unmanned aerial vehicles (UAVs) are now widely used as backup base stations for the areas which lack of wire-less/cellular access. Since UAV does not depend on fundamental infrastructure, it plays an important role in emergency response and search & rescue. In the prior studies of the UAV-aided wireless coverage extension problem, it typically considers an outdoor scenario with Air-to-Ground path loss model. In this paper, we specify the problem with the use case of UAV-aided emergency rescue. In the new problem formulation, both indoor and outdoor path loss models are considered and the goal is to find an efficient deployment of minimum number of UAVs that guarantees the connection requirements. To solve this problem, we propose a heuristic approach which contains genetic based algorithm to arrange UAVs. During evaluation, our approach is compared with the brute-force search on randomly simulated emergencies. The results show that our approach could find efficient solution with much lower computation.
科研通智能强力驱动
Strongly Powered by AbleSci AI