Routing in Wireless Mesh Network: A New Metaheuristic Based Routing Approach

Routing is a challenging issue of WMNs due to the dynamic nature of the network. In WMNs, a node can leave or join the network at any time. So, there is a need for an efficient routing algorithm in WMNs that should quickly discover the path. The development of different networking environments has a significant effect on WMNs routing. This paper proposes a new Butterfly Optimization algorithm (BOA) based routing approach for Wireless Mesh Networks. The proposed BOA routing approach was implemented using MATLAB, and its performance was compared with Ad Hoc On-Demand Distance Vector(AODV), Ant Colony Optimization(ACO), BAT optimization algorithm, Dynamic Source Routing(DSR), and Biogeography-based optimization(BBO)based routing approaches on 500, 1000, 1500, and 2000 dynamic node scenarios. From the results, We observe that the proposed Butterfly based routing approach outperforms the existing five routing approaches.

COMPARISON OF HOP COUNT ON WIRELESS MESH NETWORK

Wireless Mesh Network (MWN) is a self-configured and self-organized network that can typically be implemented on 802.11 hardware. It consists of several nodes that make up the network backbone in a multi-story and sealed room, in contrast to building a hall or a place without bulkheads. This experiment uses an odd and even number scheme with a maximum number of routers of 8 pieces. In a sealed room, the performance of the method of installation of the number of strange Hops is better than the number of even Hops, with throughput calculation of 2665.19 KB, delay 0.25 s, data lost 0.60 %, and jitter 0.01 s and the best scheme that is with the number of Hops as much as five pieces, with the calculation of the number of throughput 7001.88 KB, delay 0.51s, data lost 0.47%, and jitter 0.002 s. In the free spaces, it can produce the better performance of the even hop count calculation scheme than the odd hop count by building throughput 16709.8 KB, delay 0.2 s, data lost 0.08 %, and jitter 0.03 s. and the best scheme that is with the number of throughput 68975,2 KB, wait for 0.0148 s, data lost 0 %, and jitter 0.0014 s. WMN performance in unshared space is more maximized than the version in a sealed area, with throughput values of 11786.82 kbps, delay of 2.08 ms, and data lost by 0.08 %, and jitter 0.03 s.it can produce the better performance of the even hop count calculation scheme than the odd hop count by producing throughput 16709.8 KB, delay 0.2 s, data lost 0.08 %, and jitter 0.03 s. and the best scheme that is with the number of throughput 68975,2 KB, wait for 0.0148 s, data lost 0 %, and jitter 0.0014 s. WMN performance in unshared space is more maximized than the version in sealed space, with throughput values of 11786.82 kbps, delay of 2.08 ms, and data lost by 0.08 %, and jitter 0.03 s. and data lost by 0.08%, and jitter 0.03s.

Mobility models for next generation wireless mesh network

<span>Wireless mesh network (WMN) is a new trend in wireless communication promising greater flexibility, reliability, and performance over traditional wireless local area network (WLAN). Test bed analysis and emulation plays an essential role in valuation of software defined wireless network and node mobility is the prominent feature of next generation software defined wireless network. In this study, the mobility models employed for moving mobile stations in software defined wireless network are explored. Moreover, the importance of mobility model within software defined wireless mesh network for enhancing the performance through handover-based load balancing is analyzed. The mobility models for the next generation software defined wireless network are explored. Furthermore, we have presented the mobility models in the mininet-Wi-Fi test bed, and evaluated the performance of Gauss Marko’s mobility model.</span>