EMASS: A Novel Energy, Safety and Mobility Aware-based Clustering Algorithm for FANETs
| dc.contributor.author | Aissa, Mohamed | |
| dc.contributor.author | Abdelhafidh, Maroua | |
| dc.contributor.author | Mnaouer, Adel Ben | |
| dc.date.accessioned | 2021-08-10T12:39:29Z | |
| dc.date.available | 2021-08-10T12:39:29Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | The Unmanned Aerial Vehicles (UAVs), organized as a Flying Ad-hoc NETwork (FANET), are used to make effective remote monitoring in diverse applications. Due to their high mobility, their energy consumption is increasingly affected leading to reduced network stability and communication efficiency. The design of node clustering of a FANET needs to consider the number of UAVs in the vicinity (transmission range) in order to ensure an adaptive reliable routing. Novel clustering schemes have been employed to deal with the highly dynamic flying behavior of UAVs and to maintain network stability. In this context, a new clustering algorithm is proposed to address the fast mobility of UAVs and provide safe inter-UAV distance, stable communication and extended network lifetime. The main contributions of this paper are first to extend and improve important metrics used in two well-known algorithms in the literature namely: The Bio-Inspired Clustering Scheme for FANETs (BICSF) and the Energy Aware Link-based Clustering (EALC). Then, exploiting the improved metrics, an Energy and Mobility-aware Stable and Safe Clustering (EMASS) algorithm, built upon new schemes useful for ensuring stability and safety in FANETs, is proposed. The simulation results showed that the EMASS algorithm outperformed the BICSF and the EALC algorithms in terms of better cluster stability, guaranteed safety, higher packet deliverability, improved energy saving and lower delays. © 2013 IEEE. | en_US |
| dc.identifier.citation | Aissa, M., Abdelhafidh, M., Abdelhafidh, M., & Mnaouer, A. B. (2021). EMASS: A novel energy, safety and mobility aware-based clustering algorithm for FANETs. IEEE Access, 9, 105506 - 105520. https://doi.org/10.1109/ACCESS.2021.3097323 | en_US |
| dc.identifier.issn | 21693536 | |
| dc.identifier.uri | https://doi.org/10.1109/ACCESS.2021.3097323 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12519/417 | |
| dc.language.iso | en | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
| dc.relation | Authors Affiliations : Aissa, M., Universty of Nizwa, Nizwa, Sultanate of Oman.; Abdelhafidh, M., Laboratory of Signals, systeMs, aRtificial Intelligence and neTworkS, Digital Research Center of Sfax, Sfax University, Tunisia., Canadian University Dubai, Dept. of Computer Engineering and Computational Science, Dubai, UAE.; Abdelhafidh, M., Laboratory of Signals, systeMs, aRtificial Intelligence and neTworkS, Digital Research Center of Sfax, Sfax University, Tunisia., Canadian University Dubai, Dept. of Computer Engineering and Computational Science, Dubai, UAE.; Mnaouer, A.B., Canadian University Dubai, Dept. of Computer Engineering and Computational Science, Dubai, UAE. | |
| dc.relation.ispartofseries | IEEE Access;Volume 9 | |
| dc.rights | Creative Common Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) License | |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.subject | Ad hoc networks | en_US |
| dc.subject | Clustering algorithm | en_US |
| dc.subject | Clustering algorithms | en_US |
| dc.subject | Energy consumption | en_US |
| dc.subject | Flying Ad-hoc NETwork (FANET) | en_US |
| dc.subject | Mobility | en_US |
| dc.subject | Network topology | en_US |
| dc.subject | Reliability | en_US |
| dc.subject | Routing | en_US |
| dc.subject | Routing protocols | en_US |
| dc.subject | Safe-inter-UAV distance | en_US |
| dc.subject | Stability | en_US |
| dc.subject | Stability criteria | en_US |
| dc.subject | Unmanned Aerial Vehicle (UAV) | en_US |
| dc.title | EMASS: A Novel Energy, Safety and Mobility Aware-based Clustering Algorithm for FANETs | en_US |
| dc.type | Article | en_US |