Research Article
Flying Ad-Hoc Network Routing Protocol Based on Backward Algorithm
@INPROCEEDINGS{10.1007/978-3-031-70507-6_20, author={Zheng Yu and Jianguo Yu}, title={Flying Ad-Hoc Network Routing Protocol Based on Backward Algorithm}, proceedings={IoT as a Service. 9th EAI International Conference, IoTaaS 2023, Nanjing, China, October 27-29, 2023, Proceedings}, proceedings_a={IOTAAS}, year={2024}, month={10}, keywords={Flying Ad Hoc Network Backward Algorithm The Half Routing Void The Whole Routing Void}, doi={10.1007/978-3-031-70507-6_20} }- Zheng Yu
Jianguo Yu
Year: 2024
Flying Ad-Hoc Network Routing Protocol Based on Backward Algorithm
IOTAAS
Springer
DOI: 10.1007/978-3-031-70507-6_20
Abstract
To cope with the challenge of nodes moving at high speed, we propose a flying ad hoc routing protocol based on backward algorithm (FANET-BA). When selecting a relay node, the neighboring node who has the maximum path value will be selected as relay node based on the backward algorithm. When a node encounters a routing void, we categorize this problem into two cases namely the half routing void and the whole routing void, then propose solutions for them respectively. Simulation results show that compared with greedy perimeter stateless routing protocol (GPSR), FANET-BA improves throughput by about 89.0% and successful packet delivery rate by about 55.9%.
Copyright © 2023–2025 ICST
