Multipath Routing Protocol: For Wireless Ad-hoc Networks Based on Fibonacci

Sun, Haiyun; Del-Valle-Soto, Carolina

doi:10.34028/iajit/23/4/8

Multipath Routing Protocol: For Wireless Ad-hoc Networks Based on Fibonacci

Journal

The International Arab Journal of Information Technology

Publisher

Zarqa University

Date Issued

2026-07-04

Author(s)

Sun, Haiyun

Del-Valle-Soto, Carolina

Facultad de Ingeniería - CampGDL

Type

Article

DOI

10.34028/iajit/23/4/8

URL

https://scripta.up.edu.mx/handle/20.500.12552/13225

Abstract

A WANET, which stands for Wireless Ad hoc Network, is a temporary network in which nodes are connected to each other via wireless links and there is no central management. Due to its adaptive structure, WANET is very useful in situations when quick communication link setup is necessary. On the other hand, Channel Contention (CC), degrades the performance of WANET and is a major contributor to packet drops. To solve the CC problem, this paper proposes a routing protocol called Multipath Channel Contention Based Routing (MCCBR). Using MCCBR, several paths are discovered for data transmission that have minimal contention between the source and destination. Then the packets are distributed over the discovered routes based on the Fibonacci sequence. The process of searching for new paths for transmission is initiated when the number of found paths becomes less than 50%. The proposed routing protocol was tested and verified using NS2 simulator. The performance of MCCBR was evaluated against the Ad hoc On Demand Distance Vector (AODV) and Channel Contention Based Routing (CCBR) protocols. MCCBR outperformed AODV and CCBR in terms of Packet Delivery Ratio (PDR), End-to-End (E2E) delay, and normalized Media Access Control (MAC) overhead. © 2026, Zarka Private University. All rights reserved.