Evaluation of Clustering Algorithms in Ad Hoc Mobile Networks

Abstract

Ad hoc mobile networks are free of any infrastructures and their nodes are not aware of the connections of the network locating in, since the structure of these networks is dynamic. To send data to other nodes, each node should detect the sending path and then save it. Due to their dynamic nature, these types of networks face design complexity and limitations such as a lack of specific infrastructure and the change of the infrastructure with passing the time, the limitation of energy, bandwidth, and the considerations of quality and secu- rity. Therefore, bandwidth optimization, power and energy control and an improvement in transmission quality are challenges of these types of networks in routing. To meet these challenges, the node clustering methods were welcomed for less energy consumption and longer network lifetime. In this paper, we deal with a systematic literature review of dif- ferent clustering methods and propose a general categorization for them. Furthermore, we compare the performance the methods as well as the related algorithms and their strengths and weaknesses. Finally, we rank the algorithms regarding the four parameters of trans- mission range, mobility speed, battery, and connectivity degree using the multi-criterion decision-making and analytical hierarchical process techniques.