A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoring
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F04274644%3A_____%2F24%3A%230001109" target="_blank" >RIV/04274644:_____/24:#0001109 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S131915782400123X?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S131915782400123X?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jksuci.2024.102034" target="_blank" >10.1016/j.jksuci.2024.102034</a>
Alternative languages
Result language
angličtina
Original language name
A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoring
Original language description
Nowadays, the use of drones as a fundamental element of smart cities has attracted the attention of many researchers to monitor and control the traffic of vehicles. Because of the high flexibility of multi-drone systems, like flying ad hoc networks (FANETs), they provide various services and improve modern life in smart cities. However, due to the unique features of FANET, especially the high speed of drones and rapid changes in network topology, communication reliability is a serious challenge in this network. Hence, traditional routing protocols, such as optimized link state routing (OLSR) scheme, cannot work well in these networks. In this paper, a smart filtering-based adaptive optimized link state routing (SFA-OLSR) scheme is proposed in FANETs. To increase adaptability to the FANET environment, SFA-OLSR provides a new solution to adjust the hello broadcast period so that each flying node specifies its broadcast period based on a new scale called cosine similarity between real and predicted positions. Furthermore, in SFA-OLSR, each flying node develops a filtering algorithm based on two parameters, namely link lifetime and remaining energy. The purpose of this algorithm is to reduce the size of the single-hop neighboring set of each flying node and minimize the search space when finding multi-point relays (MPRs). This increases the convergence speed of the algorithm. Then, SFA-OLSR exploits the sparrow search algorithm (SSA) to single out the best MPRs. This algorithm introduces a multi-objective function by focusing on three components, including energy, link lifespan, and neighbor degree. Lastly, the simulation process of SFA-OLSR is performed by the NS3 simulator. This process evaluates the performance of the proposed method and three schemes, namely Gangopadhyay et al., P-OLSR, and OLSR-ETX. These evaluations show that SFA-OLSR has a good performance in terms of three scales, namely packet delivery ratio, delay, and throughput, but its overhead is more than other methods.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of King Saud University - Computer and Information Sciences
ISSN
1319-1578
e-ISSN
2213-1248
Volume of the periodical
36
Issue of the periodical within the volume
4
Country of publishing house
SA - THE KINGDOM OF SAUDI ARABIA
Number of pages
18
Pages from-to
1-18
UT code for WoS article
001256285200001
EID of the result in the Scopus database
2-s2.0-85190815125