Performance analysis of WMNs by WMN-GA simulation system for different WMN architectures and TCP congestion-avoidance algorithms considering uniform distribution

Abstract

In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance for Transmission Control Protocol (TCP) Tahoe, Reno and NewReno for uniform distribution of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for both WMN architectures, the PDR values of TCP congestion-avoidance algorithms are almost the same. For Hybrid WMN architecture, the throughput of TCP Reno is better than other algorithms. However, for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. The delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The I/B WMN architecture, the fairness index of TCP congestion-avoidance algorithms is almost the same.