A Model for Self-Adaptive Routing Optimization in Mobile Ad-Hoc Network

A Model for Self-Adaptive Routing Optimization in Mobile Ad-Hoc Network

Akinboro A. Solomon, Ayobami Taiwo Olusesi
Copyright: © 2019 |Pages: 17
DOI: 10.4018/IJSIR.2019010104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This study designs, simulates and assesses the performance of a Self-Adaptive Partitioned Particle Swarm Optimization (SAP-PSO) routing model in a MANET. The model automatically groups nodes into partitions and obtains the local best for each partition. The local best for each partition communicates with each other to form the global best. The model was simulated and benchmarked with the Traditional PSO (T-PSO) and the Ant Colony Optimization (ACO) using global best and computational time as performance metrics. Simulation results showed that the T-PSO and SAP-PSO does not have any significant difference in performance when there is no intermediate node on the network. The T-PSO outperformed both ACO and SAP-PSO models when intermediate nodes on the network were few. When a large number of intermediate nodes are present on the network, the proposed SAP-PSO performed better than PSO and ACO. This makes SAP-PSO a better routing optimization when large numbers of intermediate nodes are on the network and the search space is complex.
Article Preview
Top

A review of literatures on optimization routing protocols development has been done. The literatures revealed that none of them addressed the issue of self-adaptability in MANET using PSO.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 3 Issues (2023)
Volume 13: 4 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing