回程(电信)
计算机科学
计算机网络
整数规划
基站
贪婪算法
软件部署
线性规划
无人机
分布式计算
无线
解算器
无线网络
算法
电信
生物
遗传学
程序设计语言
操作系统
作者
Javad Sabzehali,Vijay K. Shah,Qi Fan,Biplav Choudhury,Lingjia Liu,Jeffrey H. Reed
出处
期刊:IEEE Internet of Things Journal
[Institute of Electrical and Electronics Engineers]
日期:2022-11-01
卷期号:9 (21): 21548-21560
被引量:25
标识
DOI:10.1109/jiot.2022.3184323
摘要
Multi unmanned aerial vehicle (UAV) network is a promising solution to providing wireless coverage to ground users in challenging rural areas (such as Internet of Things (IoT) devices in farmlands), where the traditional cellular networks are sparse or unavailable. A key challenge in such networks is the 3-D placement of all UAV base stations (BSs) such that the formed multi-UAV network: 1) utilizes a minimum number of UAVs while ensuring—2) backhaul connectivity directly (or via other UAVs) to the nearby terrestrial BS; and 3) wireless coverage to all ground users in the area of operation. This joint backhaul-and-coverage-aware drone deployment (BoaRD) problem is largely unaddressed in the literature and, thus, is the focus of this article. We first formulate the BoaRD problem as integer linear programming (ILP). However, the problem is NP-hard and, therefore, we propose a low complexity algorithm with a provable performance guarantee to solve the problem efficiently. Our simulation study shows that the Proposed algorithm performs very close to that of the Optimal algorithm (solved using ILP solver) for smaller scenarios, where the area size and the number of users are relatively small. For larger scenarios, where the area size and the number of users are relatively large, the proposed algorithm greatly outperforms the baseline approaches—Backhaul-aware Greedy and random algorithm, respectively, by up to 17% and 95% in utilizing fewer UAVs while ensuring 100% ground-user coverage and backhaul connectivity for all deployed UAVs across all considered simulation setting.
科研通智能强力驱动
Strongly Powered by AbleSci AI