Study of Load Balanced Routing Protocols in Mobile Ad hoc Networks

Mobile ad hoc network is a collection of wireless mobile nodes, such devices as PDAs, mobile phones, laptops etc. that are connected over a wireless medium. There is no pre-existing communication infrastructure (no access points, no base stations) and the nodes can freely move and self-organize into a network topology. Such a network can contain two or more nodes. Hence, balancing the load in a MANET is important because The nodes in MANET have limited communication resources such as bandwidth, buffer space, battery power. This paper discusses various load metric and various load balancing routing protocols for efficient data transmission in MANETs. Keywords: Load Balancing, Mobile Ad hoc Networks, Routing

Fuzzy based load and energy aware multipath routing for mobile ad hoc networks

Routing is a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic topology and lack of central administration. As a consequence of un-predictable topology changes of such networks, routing protocols employed need to accurately capture the delay, load, available bandwidth and residual node energy at various locations of the network for effective energy and load balancing. This paper presents a fuzzy logic based scheme that ensures delay, load and energy aware routing to avoid congestion and minimise end-to-end delay in MANETs. In the proposed approach, forwarding delay, average load, available bandwidth and residual battery energy at a mobile node are given as inputs to a fuzzy inference engine to determine the traffic distribution possibility from that node based on the given fuzzy rules. Based on the output from the fuzzy system, traffic is distributed over fail-safe multiple routes to reduce the load at a congested node. Through simulation results, we show that our approach reduces end-to-end delay, packet drop and average energy consumption and increases packet delivery ratio for constant bit rate (CBR) traffic when compared with the popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol

QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

Adaptive Load Balancing Ad Hoc Routing Scheme Inspired by True Slime Mold, Journal of Telecommunications and Information Technology, 2019, nr 1

Engineering neo-biomimetics, i.e. imitation models based on body structures and behavior of living organisms, relied upon to solve complex problems, have been studied in various fields. In distributed networks, such as ad-hoc networks and wireless sensor networks, the behavior of a variety of true slime molds which are capable of constructing multipath flow networks based on the amount of body, has been studied. Ad hoc networks only consist of mobile terminals (nodes) that can relay packets along an established route. However, link relations and the available bandwidth of the nodes change dynamically due to the mobility of nodes. In addition, the speed of communication between nodes also varies due to node positions and their communication-related quality. Thus, practical use of ad-hoc networks still remains an issue, because it is difficult to establish stable routes under such environments. This study aims to propose an adaptive load balancing routing technique that adaptively diversifies the transmission paths based on the available bandwidth, residual battery life, and the data transmission volume, by applying a mathematical model of slime mold routing, known as the physarum solver. We confirm the effectiveness of its adaptive behavior in dynamic environments using computer simulations

A Load-Balancing and Push-out Scheme for Supporting QoS in MANETs

Currently, mobile ad hoc networks (MANETs) lack load-balancing capabilities, and thus, they fail to provide good performance especially in the case of a large volume of traffic. Ad hoc networks lack also service differentiation. However, in these wireless environments, where channel conditions are variable and bandwidth is scarce, the differentiated services developed for the Internet are suboptimal without lower layers' support. The IEEE 802.11 standard for Wireless LANs is the most widely used WLAN standard today. It has a mode of operation that can be used to provide service differentiation, but it has been shown to perform badly. In this paper, we present a simple but very effective method for support Quality of Service, by the use of load-balancing and push-out scheme. This approach offers to the mobile node: the ability to alleviate congestion by traffic distribution of excessive load, and to support priority of packets in the single MAC buffer. We evaluate the performance of our algorithm and compare it with the original IEEE 802.11b protocol. Simulation results show that this new approach reduces packet loss rate and increases throughput as well as provides service differentiation in the MAC layer

Light Load Path Selection Techniques for Control Congestion in MANET (ENBA)

The nodes have limited bandwidth and processing capability. The routing protocols cannot handle the congestion due to heavy load in mobile ad hoc networks. Several routes are established in the network, and some intermediate nodes are common. The dynamic behaviour of the network creates problems for strong link establishment. The routing protocol establishes the connection between the sender and receiver. The efficient routing approach uses the concept of load balancing to reduce packet loss in a network. The heavy load on the network affects the node’s buffer capacity and link capacity. The research proposed the Effective Network Behavior Analyze (ENBA) for route sections to control congestion in MANET. This paper’s effort is driven by the idea of considering several aspects of the routing design of Mobile Ad hoc Networks (MANETs) in a unified manner. ENBA is a routing strategy that uses the shortest path for routing and balances the load by managing incoming and outgoing packets on links and nodes. In this routing scheme, the shortest path measures the buffer capacity of the nodes with higher TTL values selected for sending the data packets in the network. The link capacity is based on the flow of packets in the network. Queue optimisation is a continuous optimisation in which we count the number of packets incoming and decide the link reliability in a dynamic network. The performance of ENBA is compared with the Ad hoc On-demand Multipath Distance Vector -Modified (AOMDV-M) routing protocol. The ENDA strategy outperforms the competition in terms of performance over a shorter period. In the proposed technique, performance matrices like PDR, overhead, and delay provide better results than the previous AOMDV-M routing approach

Identifying Design Requirements for Wireless Routing Link Metrics

In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show that how the computational burden of a metric degrades the performance of the respective protocol and how a metric has to trade-off between different performance parameters