A new dynamic load-aware based load-balanced routing for ad hoc networks

Abstract

This paper presents a novel dynamic load-aware based load-halanced routing (DLBL) algorithm for ad hoc networks. DLBL considers intermediate node routing load as the primary route selection metric while discovering a route, which can lead to less network congestion and bottlenecks. During the route maintaining periods, DLBL deals by a distributed mechanism with the congestion of active routes when nodes of the routes have their queue overload, at the same time with little overhead increment. When link breaks because of the node mobility or power off, etc, DLBL provides efticient path maintenance to patch up broken links to help get the robust route from the source to the destination. By presenting and analyzing simulation results, the DLBL is shown to result in good performance of packet delivery ratio and average end-to-end delay, while exhibiting many attractive features of distributed control to adapt to the dynamic ad hoc networks.

Adaptive load balancing scheme in ad hoc networks

“…One is based on 'Path' [4] , in which the load is balanced by selecting node with less number of active routes. Another is based on 'Delay' [5] , in which the load is balanced by attempting to avoid nodes with high delay.…”

E²AODV Protocol for Load Balancing in Ad-Hoc Networks

“…To ensure multiple path and node only accepts an alternate path to the destination if it has a lower hop count then the advertised hop count for that destination. The proposed adaptive load-balancing approach is carried out in route request procedure by Zheng (2004). When a source node wants to communicate with a destination node and has no available routing information about the destination, it will flood a route request to find a route by broadcasting a RREQ message.…”