TY - JOUR
T1 - An energy-aware routing scheme based on a virtual relay tunnel in flying ad hoc networks
AU - Hosseinzadeh, Mehdi
AU - Ali, Saqib
AU - Mohammed, Adil Hussein
AU - Lansky, Jan
AU - Mildeova, Stanislava
AU - Yousefpoor, Mohammad Sadegh
AU - Yousefpoor, Efat
AU - Hassan Ahmed, Omed
AU - Rahmani, Amir Masoud
AU - Mehmood, Asif
N1 - Publisher Copyright:
© 2024 The Author(s)
PY - 2024/3/1
Y1 - 2024/3/1
N2 - Flying ad hoc networks (FANETs) tackle diverse challenges, for example, dynamic topological structure, high mobility of nodes, low density, and energy restrictions. These challenges make problems in designing reliable and stable routing in FANETs. Hence, the design of a routing algorithm is essential for transferring data between drones. In this paper, an energy-aware routing scheme based on a virtual relay tunnel (EARVRT) is proposed in flying ad hoc networks. EARVRT includes a virtual relay tunnel (VRT) that manages relay nodes in the route discovery process and lowers network overhead. Moreover, three metrics, namely route energy, hop counts, and a new metric called path correlation are regarded in the path selection operation. Note that correlation is defined with regard to two scales, including the cosine similarity of two nodes and their distance. EARVRT is evaluated according to delay, network longevity, consumed energy, and packet delivery rate. Then, our scheme is compared with three methods, namely LoCaL, O-LAR, and PSO-GLFR. These results show the superiority and success of EARVRT in comparison with other algorithms.
AB - Flying ad hoc networks (FANETs) tackle diverse challenges, for example, dynamic topological structure, high mobility of nodes, low density, and energy restrictions. These challenges make problems in designing reliable and stable routing in FANETs. Hence, the design of a routing algorithm is essential for transferring data between drones. In this paper, an energy-aware routing scheme based on a virtual relay tunnel (EARVRT) is proposed in flying ad hoc networks. EARVRT includes a virtual relay tunnel (VRT) that manages relay nodes in the route discovery process and lowers network overhead. Moreover, three metrics, namely route energy, hop counts, and a new metric called path correlation are regarded in the path selection operation. Note that correlation is defined with regard to two scales, including the cosine similarity of two nodes and their distance. EARVRT is evaluated according to delay, network longevity, consumed energy, and packet delivery rate. Then, our scheme is compared with three methods, namely LoCaL, O-LAR, and PSO-GLFR. These results show the superiority and success of EARVRT in comparison with other algorithms.
KW - Artificial Intelligence (AI)
KW - Drone
KW - Flying ad hoc networks (FANETs)
KW - Routing
KW - Wireless network
UR - http://www.scopus.com/inward/record.url?scp=85187307696&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85187307696&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/d7a2cc4a-4f4d-3417-bf86-99d8d9518598/
U2 - 10.1016/j.aej.2024.02.006
DO - 10.1016/j.aej.2024.02.006
M3 - Article
AN - SCOPUS:85187307696
SN - 1110-0168
VL - 91
SP - 249
EP - 260
JO - Alexandria Engineering Journal
JF - Alexandria Engineering Journal
ER -