PAR: Petal ant routing algorithm for mobile ad hoc network

TL;DR

The paper introduces PAR, a petal ant routing algorithm for mobile ad hoc networks that reduces overhead during route discovery by optimizing broadcast transmissions, leading to more efficient path finding.

Contribution

PAR is an improved routing algorithm that reduces overhead in route discovery by optimizing FANT and BANT transmissions, outperforming existing methods like SARA, AODV, and AOMDV.

Findings

PAR reduces overhead by eliminating redundant FANT transmissions.

Simulation shows PAR outperforms ACO-based SARA and classical protocols.

PAR achieves more efficient route discovery with fewer broadcasts.

Abstract

During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets are the essential operations for finding the path between two ends. In such situations, intermediate node which may or may not belongs will participate in route discovery process, update routing table and rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions in route discover process. The algorithm is an improved version of SARA and has features extracted from petal routing. The algorithm is simulated on NS2, compared with ACO frame work called SARA and classical routing protocols such as AODV and AOMDV. The simulation results shows that PAR further reduces overhead by eliminating redundant FANT transmission compared to other routing algorithm.