Empirical study of clustering algorithms for wireless ad hoc networks

In this study we evaluate with experiments three generic clustering algorithms, namely the Lowest-ID, the Highest Degree and the Extended Robust Re-clustering Algorithm which is the one proposed. The aim is to investigate which are the factors that have significant effect on the re-clustering performance. We isolate those performance factors as being network conditions that we simulate with a particular focus on the node deployment pattern, the mobility pattern, the radio transmission range and the energy of the ad hoc nodes. For the evaluation of the re-clustering efficiency and for the comparison of the three algorithms we examined conventional re-clustering performance metrics, such as the cluster head modification rate and the number of the generated clusters but also reliability metrics, such as the cluster head availability probability and the end to end message delivery ratio. We draw generic outcomes that hold for the three algorithms and we also discuss the behavior of the proposed algorithm