A new routing algorithm in MANETs: Position based hybrid routing

Abstract

Ad hoc wireless networks consist of mobile nodes that communicate with each other without an infrastructure. A reduction in routing overload and efficient use of resources are two very important issues in these networks. In this study, a new routing algorithm called position based hybrid routing algorithm (PBHRA) was developed to optimize bandwidth usage of ad hoc networks. The main goal of PBHRA is effective use of bandwidth by reducing the routing overload. Additionally, the other goals of the algorithm are to extend battery life of the mobile devices by reducing the required number of operations for route determination and to reduce the amount of memory used. Although in the PBHRA, some features of both table driven and on-demand algorithms were used to achieve these goals at some stages, PBHRA algorithm is a completely different approach in terms of position information usage and GPS. The PBHRA was coded and simulated in MATLAB 7.0 to evaluate its performance and compared with other algorithms. The results showed that PBHRA performs better in terms of normalized routing load, packet delivery fraction and end-to-end packet delay compared to table driven, on demand, and position based algorithms.