A Novel High Performance Routing Algorithm for Mobile Multi-Hop Tunneling Networks

Abstract

By the increased number of mobile devices, the demand of high speed connection oriented tunneling networks also increases. But, in mobile tunneling networks, the full route will have to be reconstructed more frequently because of more frequent route failures, where the requirements for extra route reconstructions (RRC) will cause extra delay and a decreased system throughput. In this work, a novel routing algorithm, optimum path routing (OPR) is proposed to extend the route life time of mobile multi hop tunneling networks and to increase the system throughput. On the other hand, as the most recent works in the literature indicate that, one of the greatest challenges of tunneling networks is to provide the network flexibility by instant adaptation on changing network conditions to keep the delay at lowest levels even in case of high traffic loads or node failures. To solve the aforementioned flexibility problem of the tunneling networks, a novel algorithm applicable to all kinds of routing algorithms called “avoid congested nodes (ACN)” is proposed. The results show that, the OPR algorithm proposed to increase the route life has succeeded in decreasing the RRC delay by 84% and improving the throughput by 20.17% with respect to the Fastest Path routing algorithm in the literature. And the ACN algorithm, proposed to provide a rapid adaptation of the nodes to the changing traffic conditions, has also succeeded in carrying back the throughput of the network with traffic load from 75.5% of its best performance evaluated with no traffic to its 94%. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.