Neighbor Coverage and Bandwidth Aware Multiple Disjoint Path Discovery in Wireless Mesh Networks

Abstract

With the ease of appending new nodes without re-installing the whole network, the Internet of Things (IoT) builds several smart applications on Wireless Mesh Network (WMN). One of the important aspects of integrating WMN and smart IoT applications is to provide an energy-e cient and reliable routing protocol. Seeking the communication route that delivers the high-quality stream quickly over WMN is an important issue, but the maximum utilization of a single high-quality path leads to poor throughput and large communication delay, including route discovery and data forwarding delay. The broadcasting mechanism creates redundant transmissions of control packets into the network and reinitializes the blind route discovery process due to link disconnections leading to network resource constraints and high delay during the route discovery process. Moreover, the congestion in the communication route incurs data transmission latency. This paper proposes the Multiple Disjoint Path Determination (MDPD) mechanism based on-demand routing in WMN to formulate the path discovery and data transmission latency. Reducing the neighbor list into the uncommon neighbor set reduces the unnecessary latency in route discovery, and deriving high capacity multiple disjoint communication routes reduce the communication delay in the proposed work. The proposed work employs the queue dynamics in queuing delay, which mainly provides adaptability to the dynamics in network capacity and e cient diversity paths to the gateway node to infer the available bandwidth and optimize the network tra c. To fully utilize the advantage of heterogeneous routers, it disables the ooding of control packets across the stable mesh routers, excluding the initial route discovery process, because it enables the available route storage system in each mesh router. Hence, the proposed work e ciently supports wireless broadband internet access with reduced delay and control overhead. The simulation results demonstrate the fast detection of the multiple disjoint routes and data tra c optimization over the discovered disjoint routes in the proposed MDPD mechanism over WMN.

Effective Routing Using Multi-Objective Levy flight- Artificial Rabbit Optimization Algorithm for Wireless Mesh Networks

“…Anita and Sasikumar [21] have introduced a multiple disjoint path determination (MDPD) scheme which was based on demand routing in WMN to articulate route discovery and latency at the time of transmitting data. The MDPD utilized queue dynamics while queuing delay that offers adaptability to the network and provides efficiency to optimize the network traffic.…”