Deployment Algorithm For Minimum Unmanned Aerial Vehicles Towards Optimal Coverage And Interconnections

2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW)(2018)

引用 3|浏览19
暂无评分
摘要
Unmanned aerial vehicles (UAVs) are playing an important role in serving ground users as base stations (BSs) during temporary events, or after terrestrial BSs fail. UAV deployment is a fundamental and vital problem which directly affects the coverage capacity and user experience. Especially, while deploying a UAV backbone network, the cost and the quality of service (QoS) of the ground users as well as the connectivity among UAVs need to be considered jointly. In this paper, the deployment problem is modeled as minimizing the amount of deployed UAVs while guaranteeing the coverage capacity and connectivity among UAVs. Further, a novel UAV deployment scheme is proposed where a heuristic algorithm is adopted to delete locations from the initially defined candidate UAV locations iteratively, and UAVs are deployed at the remaining locations finally. The simulation results show that our UAV deployment scheme can achieve minimum deployed UAVs while ensuring QoS requirements and a robust network among UAVs.
更多
查看译文
关键词
Unmanned aerial vehicles (UAVs), deployment, base stations, coverage, interconnection
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要