Adaptive Routing in Wireless Mesh Networks Using Hybrid Reinforcement Learning Algorithm

Mobile ad hoc network (MANET) is a collection of several wireless devices or mobile users that can communicate among themselves over wireless links in a peer to peer basis and thereby creating a dynamic, arbitrary graph. But some adverse characteristics of MANET like dynamic topology, limited bandwidth, link failure and energy constraints, imposes new demands on routing protocol. This paper aims to study the performance evaluation and comparison of three prominent routing protocols: Destination Sequence Distance Vector (DSDV), Ad-hoc On demand Distance Vector (AODV) and Optimized Link State Routing (OLSR), in a real life scenario. In a given scenario, students investigate the historical site in which number of packets being sends and number of nodes in the network affects the communication reliability. Extensive simulations are made to evaluate the performance of these protocols using various performance differential metrics like packet delivery ratio, total energy consumption and throughput using NS-3.29. In the end it is seen that in most simulation results, proactive routing protocols (DSDV, OLSR) performed significantly better than reactive routing protocols.

Wireless technology is emerging as a key technology for the future networks. Wireless mesh networks (WMNs) have emerged as an indispensable technology for deployment of wireless services for various applications in personal, enterprise, and metropolitan areas. Researchers are working actively in different fields of WMNs for providing better services. Routing protocols play a vital role in WMNs to provide reliable configuration and maintenance of topology of the network. Designing a suitable cost metric for routing protocols to provide quality links for data transmission is the backbone of WMNs. Many cost metrics have been proposed for WMNs and is still an active research topic as new performance metrics need to be discovered due to the dynamics of this field. This paper considers the genetic algorithm-based routing technique for WMN.We have studied the existing cost metrics and proposed a genetic algorithm technique for routing in WMN. To evaluate the genetic algorithm, and to determine the relative performance of the genetic algorithm in the context of routing in WMN, we carry out experiments on two test systems. We have evaluated the quality of the results produced by our algorithm with the traditional hop count metric results. Our results show that routing in WMN using genetic algorithm produces better results as compared to traditional hop count metric results. Finally, we carry out a detailed analysis of results, which help us in gaining an insight into the suitability of genetic algorithm for routing in WMN.

Reinforcement learning for QoS-guaranteed intelligent routing in Wireless Mesh Networks with heavy traffic load

Wireless sensor network (WSN) with several sensors is used to group measurements of certain physical quantities or environmental conditions, including sound, temperature, pressure, vibration, motion, or pollution, at various locations and ranges. In WSNs, several protocols address the issue of routing. Sensor nodes in WSN usually have limited energy resources and storage capacities. Therefore, the issue of energy usage in sensors and protocols is very important. This paper analyzes and compares the quality of service (QoS) performances of three important routing protocols of the mobile ad-hoc network (MANET) including Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), and destination sequenced distance vector (DSDV), in a smart building case study. The QoS evaluation metrics include residual energy of nodes, instant throughput (IT), average throughput (AT), packet delivery ratio (PDR), packet loss ratio (PLR), and route discovery latency (RDL) based on IEEE 802.15.4 MAC protocol standard. The simulation is carried out using NS2, and the WSN has 16 fixed and 4 mobility nodes with different speeds and paths. The simulation results illustrate that average throughput in AODV is 1.985118 (kbps), however, the figures for DSR and DSDV are 1.977780 and 1.720700 (kbps), respectively. PDR, also, in DSR stands at 1.0, but the figures for AODV and DSDV are lower with the range of 0.999572 and 0.997930, respectively. Overall, The DSR protocol provides a better performance compared to AODV and DSDV routing protocols in terms of PLR and PDR. Also, AODV has better efficiency in RDL and AT compared to other assumed protocols.

QoS routing problem in wireless mesh networks is a NP-complete problem, and it is hard to get the global solution with the traditional algorithm. In this paper, we adopt a novel dynamic ant genetic hybrid algorithm to solve QoS unicast routing problem for wireless mesh network, whose innovation are using the best melting point evaluation strategy to control the calling of the two algorithms dynamically. Simulation results show that the novel algorithm is superior to the genetic algorithm and the static ant genetic hybrid algorithm in quality and efficiency for QoS routing in wireless mesh network.

The ultimate goal of routing in wireless mesh networks (WMNs) is to find the “good” paths between the source and destination. Considering of the characteristics of this new networking paradigm, such as low mobility and less restriction from the energy effect, the focus is on the design and optimization of the technology to establish the path that can reflect this network feature. In this paper, an efficient routing algorithm is proposed based on decision-making sequence in WMNs, and the routing process is mapped into multi-stage decision process. We construct a mathematical model for it and present a multi-decision sequential routing method taking use of the idea of dynamic programming. In addition, a new metric (EEDT) for routing based on the information of MAC layer in WMNs is given, which optimized the two objectives- end to end delay and throughput. In the end, the multi-decision sequential routing algorithm (MDSR) is proposed that synthesized the suggesting method and new metric. The path selected by MDSR would be better based on the mathematical model, and it has lower delay of routing building. At the same time, EEDT can accurately capture the quality of the network links. Simulation results show that the proposed routing algorithm significantly improves the performance of the WMNs in terms of end-to-end delay and throughput.

This paper proposes a new multi-population based global optimization algorithm called Parallel Three Parent Genetic Algorithm (P3PGA). The proposed approach is an extension of 3PGA approach. Performance of the proposed algorithm was evaluated on the eleven CEC-2014 benchmark functions. We compared the performance of proposed P3PGA algorithm with 16 other algorithms. It was observed that out of the 11 benchmarks functions P3PGA outperformed all other 16 approaches on 5 benchmark functions. Out of 5, for 2 functions the best performance of P3PGA was also equaled by few other approaches. For the other 3 functions the performance of P3PGA was unmatched by any of the other 16 algorithms. Further, this paper proposes a new P3PGA based optimal route evaluation approach for routing in Wireless Mesh Networks. The proposed approach was implemented in MATLAB and simulated for various WMN sizes and scenarios. We compared its performance with 8 other approaches namely, Ad-hoc On Demand Distance Vector (AODV) approach, Dynamic Source Routing (DSR), Genetic Algorithm (GA), Biogeography Based Optimization (BBO), Firefly Algorithm (FA), Ant Colony Optimization (ACO), BAT and Big Bang-Big Crunch (BB-BC) based optimal cost route evaluation approaches. The P3PGA based approach outperformed all other 8 approaches for the WMNs sized 1000 nodes and above.

Routing is a critical component in wireless mesh networks. The inherent shared-medium nature of the wireless mesh networks, however, poses fundamental challenges to the design of effective routing policies that are optimal with respect to the resource utilization. Node churns and traffic fluctuations exacerbate such a problem. In this paper, we propose a novel adaptive routing algorithm for multiple subscribers in wireless mesh networks. We view a mesh network with multiple nodes as an entity that optimizes some global utility function constrained by the underlying MAC layer interference. By solving the optimization problem, the network is driven to an efficient operating point with a certain routing policies for each node. We then use this operating point information to adaptively find better paths, which is able to gear the network towards optimal routing. Further, we take the fluctuations of the network into consideration and thus render our algorithm more robust for a variety of network situations. Simulations demonstrate the efficiency and efficacy of our algorithm.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.

Mesh networks, motivated by wireless neighborhood networks are composed of static wireless nodes that have ample energy supply. Each of these wireless nodes can be equipped with multiple radios, called a multiradio/multichannel node, and each of the radios can be configured to a different channel to enhance network capacity. All wireless nodes cooperatively route each otherpsilas traffic to the Internet through one or more Internet Transit Access Points (TAPS), which are gateways to the Internet. Nodes may also communicate with each other directly through the mesh network without going through TAPS. Supporting communication among mesh nodes and TAPS requires the use of routing protocols that must be combined with a routing metric to determine which route among all possible routes between a pair of nodes will be used. The design of effective routing metrics, however, depends on the specific characteristics of the target network. For example, the severe energy constraints of sensor networks demand the design of energy efficient routing, while the mobility of nodes in ad hoc networks demand the design of protocols that can efficiently maintain connectivity. The unique combination of static nodes with the shared nature of the wireless medium in mesh networks also imposes specific requirements for the design of routing metrics. In this paper it was analyzed the proposed IPRA (Intelligent Portal Routing Algorithm) protocol and its performances in comparison with those offered by the AODV (Ad-hoc on Demand Vector) and DSDV (Destination Sequence Distance Vector) protocols.

Field Based Routing (FBR) is the next promising class of routing algorithms especially for wireless mesh networks. The inherent nature of shared medium wireless mesh networks, however, poses fundamental challenges to the design of effective routing policies that are optimal with respect to speed, time and resource utilization. In this paper, globally optimized routing algorithm for multiple subscribers in wireless mesh networks is proposed. Mesh network with multiple nodes will serve as an environment that optimizes some global utility function limited by the mobile nodes position in underlying MAC (Media Access Control) layer. By solving the optimization problem, the network is brought to a point of efficient operation with a certain routing policy for each node. This information will be the operating point that can be used to find better ways adaptive, which is able to steer the network towards the optimal routing. Global optimization of FBR is depicted through path estimation using PSO (Particle Swarm Optimization).

Wireless technology has become an essential part of this era’s human life and has the capability of connecting virtually to any place within the universe. A mesh network is a self healing wireless network, built through a number of distributed and redundant nodes to support variety of applications and provide reliability. Similarly, anycasting is an important service that might be used for a variety of applications. In this paper we have studied anycast routing in the wireless mesh networks and the anycast traffic from the gateway to the mesh network having multiple anycast groups. We have also studied the geocast traffic in which the packets reach to the group head via unicast traffic and then are broadcasted inside the group. Moreover, we have studied the intergroup communication between different anycast groups. The review of the related literature shows that no one has considered anycasting and geocasting from gateway to the mesh network while considering the multiple anycast groups and intergroup communication. The network is modeled, simulated and analyzed for its various parameters using OMNET++ simulator.

QoS routing in wireless mesh networks (WMNs) is a daunting task. Finding a path for a given flow depends not only on the bandwidth-delay requirements of that flow but also on the available bandwidth of all the nodes in that path and the amount of bandwidth consumption caused by that flow along its path. Contrary to the wired networks, these two parameters are not fixed and depend on the interference pattern of the network that in turn depends on the selected path itself. This converts the QoS routing in wireless mesh networks to a much harder problem. Existing methods use on-demand approach based on flooding of routing packets. This approach does not scale up to large networks. Field-based routing (FBR) is a promising approach to reduce the routing overhead for static route set up. However, it is not previously used for QoS routing. In this paper, we have developed a new FBR based QoS routing protocol for WMNs. Contribution of this paper is two folds. First, a one-pass field-based routing instead of regular two-pass approach is developed that significantly reduces the overhead of distributing routing information and computing the path and increases the QoS delivered to the flows. Secondly, a new routing metric named LU-IR is introduced that is shown to lower intra-flow and inter-flow interferences and results in increased network service capacity. The performance of the proposed algorithm is extensively studied through simulations. The results indicate that average delay of the flows is improved and the network throughput is increased compared to the existing schemes.

ITS hybrid Wireless Mesh Network (WMN) is special case of WMN containing relatively static mesh points and mobile mesh clients, which may suffer from random variations in channel and network condition and handoff problems due to mobility of mesh clients. This leads to poor performance in multi-hop WMN, especially with conventional non-flexible routing algorithms. To cope with instability of wireless links and fast handoff between mesh points for mobile mesh clients, a cross-layer routing that supports link quality optimization and stable routing is an effective way. The key technology is focusing on the choice of the route metrics. In this paper we propose a novel Link Quality and Stability-aware metric from MAC layer supporting Cross-layer Routing (LQSCR) for hybrid WMN. LQSCR selects the path which has best link quality and highest neighbor stability ratio to forward data. Analysis and simulation results show that LQSCR may achieves better performance in hybrid WMN in terms of end-to-end delay, jitter delay and packet delivery ratio in comparison to shortest path metric.

Several protocols for routing and forwarding in Wireless Mesh Networks (WMN) have been proposed, such as AODV, OLSR or B.A.T.M.A.N. However, providing support for e.g. flow-based routing where flows of one source take different paths through the network is hard to implement in a unified way using traditional routing protocols. OpenFlow is an emerging technology which makes network elements such as routers or switches programmable via a standardized interface. By using virtualization and flow-based routing, OpenFlow enables a rapid deployment of novel packet forwarding and routing algorithms, focusing on fixed networks. We propose an architecture that integrates OpenFlow with WMNs and provides such flow-based routing and forwarding capabilities. To demonstrate the feasibility of our OpenFlow based approach, we have implemented a simple solution to solve the problem of client mobility in a WMN which handles the fast migration of client addresses (e.g. IP addresses) between Mesh Access Points and the interaction with re-routing without the need for tunneling. Measurements from a real mesh testbed (KAUMesh) demonstrate the feasibility of our approach based on the evaluation of forwarding performance, control traffic and rule activation time.