A PageRank Algorithm Based Data Transmission Protocol for FANETs
Broadcast serves as a crucial means for data transmission in wireless ad hoc networks (WANETs), yet it faces challenges such as information redundancy, network congestion, and transmission delay, especially in flying ad hoc networks (FANETs). To address these issues, this paper proposes a PageRank algorithm based data transmission protocol (PRADTP) with the aim of optimizing data transmission efficiency. The key idea of the protocol draws inspiration from the successful application of the PageRank algorithm in graph theory and search engines. By computing the PageRank value of each node and integrating it with the fuzzy Borda algorithm, the importance score of each node in the network is determined. Based on these scores, the protocol assigns broadcasting probabilities to each node, ensuring that nodes with higher scores have a higher probability of forwarding messages, thus guaranteeing wide data packet coverage. Meanwhile, nodes with lower scores are assigned lower forwarding probabilities to reduce the spread of redundant messages. The experimental results indicate that, under different node scales, various topologies, and degrees of topological sparsity, PRADTP has a promotion of over 10% in packet delivery success ratio, a reduction of over 60% in latency and lower average hop count than that of the compared protocols.
Authors
- Jun Cai (ORCID: https://orcid.org/0000-0002-1720-8444)
- Lu Gan (ORCID: https://orcid.org/0000-0003-2138-9564)
- Wanqiu Chen
- Jian Chen (ORCID: https://orcid.org/0000-0001-5230-7141)
- Xiaodong Yi (ORCID: https://orcid.org/0000-0003-2279-5417)
- Jia Yang
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/icct62411.2024.10946542
- Primary Topic
- IoT and Edge/Fog Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00