Multi-Period Mission Planning of UAVs for 5G Coverage in Rural Areas: a Heuristic Approach

J. Galán-Jiménez, L. Chiaraviglio, L. Amorosi, N. Blefari-Melazzi
{"title":"Multi-Period Mission Planning of UAVs for 5G Coverage in Rural Areas: a Heuristic Approach","authors":"J. Galán-Jiménez, L. Chiaraviglio, L. Amorosi, N. Blefari-Melazzi","doi":"10.1109/NOF.2018.8598123","DOIUrl":null,"url":null,"abstract":"Nowadays, at least two billion people are experiencing a complete lack of cellular coverage. Since the lack of cellular connectivity is mostly experienced in rural zones, it is of mandatory importance to design solutions to manage cellular architectures tailored to such zones. To this aim, we consider a new cellular 5G architecture, where the Base Stations (BSs) are carried by Unmanned Aerial Vehicles (UAVs). Specifically, we focus on the problem of planning the missions of the UAV-based BSs over the territory, with the goal of minimizing the energy consumed for moving the UAVs. After introducing the considered framework, which is based on a multi-period graph defined over a set of places and a set of Time Slots (TSs), we derive a simple algorithm, called GAUP, to solve the considered problem in a reasonable amount of time. Our results, obtained over a simple - yet representative - scenario, reveals that GAUP is able to efficiently manage the energy for moving the UAVs, while guaranteeing relatively low computation times.","PeriodicalId":319444,"journal":{"name":"2018 9th International Conference on the Network of the Future (NOF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 9th International Conference on the Network of the Future (NOF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOF.2018.8598123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Nowadays, at least two billion people are experiencing a complete lack of cellular coverage. Since the lack of cellular connectivity is mostly experienced in rural zones, it is of mandatory importance to design solutions to manage cellular architectures tailored to such zones. To this aim, we consider a new cellular 5G architecture, where the Base Stations (BSs) are carried by Unmanned Aerial Vehicles (UAVs). Specifically, we focus on the problem of planning the missions of the UAV-based BSs over the territory, with the goal of minimizing the energy consumed for moving the UAVs. After introducing the considered framework, which is based on a multi-period graph defined over a set of places and a set of Time Slots (TSs), we derive a simple algorithm, called GAUP, to solve the considered problem in a reasonable amount of time. Our results, obtained over a simple - yet representative - scenario, reveals that GAUP is able to efficiently manage the energy for moving the UAVs, while guaranteeing relatively low computation times.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
农村5G覆盖无人机多周期任务规划:一种启发式方法
如今,至少有20亿人完全没有手机覆盖。由于蜂窝连接的缺乏主要发生在农村地区,因此设计解决方案来管理适合这些地区的蜂窝架构是非常重要的。为此,我们考虑了一种新的蜂窝5G架构,其中基站(BSs)由无人机(uav)携带。具体来说,我们关注无人机导航系统在领土上的任务规划问题,目标是使无人机移动消耗的能量最小。在引入所考虑的框架之后,该框架基于在一组地点和一组时隙(ts)上定义的多周期图,我们推导了一个简单的算法,称为GAUP,以在合理的时间内解决所考虑的问题。我们在一个简单但具有代表性的场景中获得的结果表明,GAUP能够有效地管理移动无人机的能量,同时保证相对较低的计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Internet of Things Connectivity in Deep-Indoor Environments MDTCP: Towards a Practical Multipath Transport Protocol for Telco Cloud Datacenters Interface Counters in Segment Routing v6: a powerful instrument for Traffic Matrix Assessment An Evolutionary Multipath Routing Algorithm using SDN Extending Slices into Data Centers: the VIM on-demand model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1