RAINs: Recursive algorithm for impostor node selection to balance the load in MANETs

The MANET is established by group of mobile and independent nodes connected by wireless links. MANETs nodes are responsible of not only forwarding packets but can also perform computations. Source to destination packet forwarding is attempted using multi-hoping mechanism. In Clusterhead (CH) formation, Clusterhead participates in all communication via and within the cluster boundaries. In that case, CH may face the bottleneck problem and as nodes in MANETs are equipped with low battery, low computation, low bandwidth, self configuring features. In this scenario, load balancing is the critical issue for Clusterhead in terms of its performance and quality of services. This paper proposed a new algorithm which is recursive and efficient to select the neighbor potential nodes, which assist the Clusterhead and agree to share the load if Clusterhead is overloaded/ overburdened.