A novel proactive routing method for mobile Ad hoc Networks

Abstract

In recent years, the Mobile Ad hoc Networks (MANETs) became more popular due to their multiple advantages such as the low setup cost, auto-configuration and auto-healing features. This kind of network is distinguished by its dynamic and distributed nature since it does not contain any form of centralized infrastructure. These characteristics have led to the emergence of new routing protocols specifically designed for dynamic topologies. Some protocols construct and maintain paths before they are needed (proactive protocols). However, this method generates a massive volume of overhead. Other protocols reduce the overhead by constructing paths only when it is necessary (reactive protocols). On the other hand, this method is not well adapted when the topological changes are frequent and can increase the transmission delay. Though the features presented by this type of network seem appealing, maintaining the network connectivity in a distributed fashion is a complicated task and could drain a significant piece of the network resources. Moreover, considering that the network members are usually embedded devices equipped with limited resources, it is vital to minimize the resources spent by the routing protocol. In this study we compare the various routing strategies designed for MANET and propose a proactive routing algorithm that consumes an acceptable quantity of the network members resources. Furthermore, we present how our protocol works and multiple tests to show the protocol reactions to the different topological parameters.