Dynamic Routing Using Petal Ant Colony Optimization for Mobile Ad-hoc Networks

A Mobile Ad-hoc Network (MANET) is a temporary wireless network that configures itself as needed. Each MANET node has a finite number of resources and serves as both a node and a router at the same time. MANET nodes are mobile and move from one location to another. Because MANET nodes are dynamic, choosing an optimal node for data transfer is a difficult issue. Because packets must propagate in a multi-hop manner, they take a longer path and may endure a longer delay, causing them to become lost in the network. The network’s overall performance suffers as a result of the re-transmission of those lost packets. We propose a modified version of a nature-inspired algorithm called Petal Ant based Dynamic Routing (PADR) in this research study, which reconstructs data packets to traverse inside a given region and achieves minimal delay during data transmission. The PADR is simulated in Network Simulator (NS2) and compared against nature-inspired routing protocols like PAR and SARA, as well as traditional routing protocols like AODV.

@article{P2023,
  title     = {Dynamic Routing Using Petal Ant Colony Optimization for Mobile Ad-hoc Networks},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {10},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Sathyaprakash B. P and Manjunath Kotari},
  doi       = {10.14569/IJACSA.2023.0141084},
  url       = {https://doi.org/10.14569/IJACSA.2023.0141084}
}