GA-based Energy Aware Path Planning Framework for Aerial Network Assistance

Yusuf Özçevik, Elif Bozkaya, Mertkan Akkoç, Muhammed Rasit Erol, B. Canberk
{"title":"GA-based Energy Aware Path Planning Framework for Aerial Network Assistance","authors":"Yusuf Özçevik, Elif Bozkaya, Mertkan Akkoç, Muhammed Rasit Erol, B. Canberk","doi":"10.4108/eai.13-4-2021.169186","DOIUrl":null,"url":null,"abstract":"Aerial networks have enormous potential to assist terrestrial communications under heavy tra ffi c requests for a predictable duration. However, such potential for improving both the performance and the coverage through the use of drones can face a major challenge in terms of power limitation. Hence, we consider the energy consumption characteristic of the components in such networks to provide energy aware flight path planning. For this purpose, a flight path planning scheme is proposed on an underlying topology graph that models the energy consumption of path traversals in the aerial network. In the proposed model, we o ff er to seek for the minimum energy consumption on a global problem domain during the entire operational time. Thus, we provide a concrete problem formulation and implement a flight path planning with Genetic Algorithms (GA) approach. Moreover, a novel end-system initiated handover procedure is illustrated to preserve connectivity of terrestrial users in the network architecture. In the end, the evaluation of the proposed model is conducted under three di ff erent scales of social event scenarios. A comparison with a dummy path planning scheme without energy awareness concerns is presented according to a set of parameters. The evaluation outcomes show that the proposed model is able to save 20% energy consumption, provides 15% less number of terrestrial replenishment, and 18% more average endurance for the topology. Besides, another energy aware path planning scheme in the literature o ff ering a deployment with Bellman Ford algorithm is also included in the evaluation to evaluate the feasibility of the proposed framework for the enhanced problem domain.","PeriodicalId":33474,"journal":{"name":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/eai.13-4-2021.169186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 4

Abstract

Aerial networks have enormous potential to assist terrestrial communications under heavy tra ffi c requests for a predictable duration. However, such potential for improving both the performance and the coverage through the use of drones can face a major challenge in terms of power limitation. Hence, we consider the energy consumption characteristic of the components in such networks to provide energy aware flight path planning. For this purpose, a flight path planning scheme is proposed on an underlying topology graph that models the energy consumption of path traversals in the aerial network. In the proposed model, we o ff er to seek for the minimum energy consumption on a global problem domain during the entire operational time. Thus, we provide a concrete problem formulation and implement a flight path planning with Genetic Algorithms (GA) approach. Moreover, a novel end-system initiated handover procedure is illustrated to preserve connectivity of terrestrial users in the network architecture. In the end, the evaluation of the proposed model is conducted under three di ff erent scales of social event scenarios. A comparison with a dummy path planning scheme without energy awareness concerns is presented according to a set of parameters. The evaluation outcomes show that the proposed model is able to save 20% energy consumption, provides 15% less number of terrestrial replenishment, and 18% more average endurance for the topology. Besides, another energy aware path planning scheme in the literature o ff ering a deployment with Bellman Ford algorithm is also included in the evaluation to evaluate the feasibility of the proposed framework for the enhanced problem domain.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于ga的空中网络援助能量感知路径规划框架
空中网络具有巨大的潜力,可以在可预测的持续时间内,在大量交通需求下协助地面通信。然而,通过使用无人机来提高性能和覆盖范围的潜力可能面临功率限制方面的重大挑战。因此,我们考虑这种网络中组件的能量消耗特性,以提供能量感知的飞行路径规划。为此,提出了一种基于底层拓扑图的飞行路径规划方案,该拓扑图对空中网络中路径遍历的能量消耗进行建模。在提出的模型中,我们试图在整个运行时间内寻求全局问题域上的最小能耗。因此,我们提供了一个具体的问题表述,并使用遗传算法(GA)方法实现了飞行路径规划。此外,还提出了一种新颖的端系统启动切换过程,以保持网络架构中地面用户的连通性。最后,在三种不同尺度的社会事件场景下对所提出的模型进行了评价。根据一组参数,与不考虑能量意识问题的虚拟路径规划方案进行了比较。评估结果表明,该模型可节省20%的能量消耗,减少15%的地面补给次数,提高18%的平均续航时间。此外,本文还将文献中另一种基于Bellman Ford算法部署的能量感知路径规划方案纳入评估,以评估所提框架在增强问题域的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.00
自引率
0.00%
发文量
15
审稿时长
10 weeks
期刊最新文献
ViMedNER: A Medical Named Entity Recognition Dataset for Vietnamese Distributed Spatially Non-Stationary Channel Estimation for Extremely-Large Antenna Systems On the Performance of the Relay Selection in Multi-hop Cluster-based Wireless Networks with Multiple Eavesdroppers Under Equally Correlated Rayleigh Fading Improving Performance of the Typical User in the Indoor Cooperative NOMA Millimeter Wave Networks with Presence of Walls Real-time Single-Channel EOG removal based on Empirical Mode Decomposition
×
引用
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