OPTIMIZING THE PROCESS OF OLSR CLUSTERING BASED ON MOBILITY AND DENSITY IN AD HOC NETWORKS

The main ad hoc routing protocols that were proposed generally operate only on flat networks. However the IP networks have always been of a hierarchical nature, for scalability and manageability reasons. In this paper, we propose a novel clustering algorithm for OLSR based on the density and mobility of nodes. Our algorithm takes into account the node mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reduced and less mobile cluster heads that will serve for provide hierarchical routing using OLSR.