Evaluating Routing Algorithms Across Different Wireless Mesh Network Topologies Using Ns-3 Simulator

Wireless Mesh Networks are gaining traction as a solution for delivering reliable connectivity without centralized infrastructure. They operate through wireless node interconnections, forming self-configuring networks ideal for scenarios where wired networks are impractical. Routing is crucial in Wireless Mesh Networks to ensure efficient communication among nodes. However, the suitability of routing algorithms for Wireless Mesh Network’s topology requires further investigation. This paper proposes an investigation into the effectiveness of routing algorithms like AODV, DSDV, and OLSR across various Wireless Mesh Networks topologies using NS-3 simulation. It also aims to determine the optimal number of nodes and protocols to maximize throughput and minimize packet loss within a limited area. Through rigorous NS-3 simulations, the study demonstrates that AODV, DSDV, and OLSR exhibit differing effectiveness across random, mesh grid, and Fruchterman-Reingold topologies. These results emphasize the importance of considering topology-specific factors when selecting and optimizing routing protocols for Wireless Mesh Networks. In summary, Wireless Mesh Networks offer decentralized connectivity, but the effectiveness of routing algorithms in different topologies remains understudied. This investigation addresses this gap by evaluating routing algorithms across various topologies, shedding light on their suitability and performance in Wireless Mesh Networks.