Efficient Data Transfer by Mobility Adjustment Algorithm for Clustered Mobile Ad-Hoc Networks

Mobile Ad-hoc NETwork (MANET) is a prevalent deployable network for easy plug-in and it is widely applied for many real time scenarios. Clustering is a well known solution for efficient communication among nodes with least control overheads. The communication link breaks between nodes when a node moves beyond the transmission range of another node because of mobility. Frequent link breaks happen because of nodes mobility which cannot be controlled without increasing the network control overheads. The authors propose an Mobility Adjustment Routing (MAR) routing algorithm for establishing a stable path between the source and the destination. In this approach the choice of cluster heads based on the smallest weight age, node mobility and remaining battery power are used as a metric for weight computation. The cluster head and the gate way nodes forward RREQ packets to set up a path between the source and the destination which proves efficient communication, before forwarding a RREQ packet cluster the head/gateway node compares its mobility value with RREQ and updates the least value in RREQ. The destination node advertises the least mobility value to the remaining nodes in the path with the help of RREP packet, therefore stable paths are found without increasing the network control overheads. The simulation results done with the help of network simulator 2 show that the algorithm proposed performs well even at higher traffic load compared to existing algorithms.