Correction, generalisation and validation of the "max-min d-cluster formation heuristic"

Abstract

The justification for using mutihop clusters may be found in [1]. In the well known heuristic proposed in [2], the d- dominating set of cluster heads is first selected by using nodes identifiers and then clusters are formed. In this paper we generalise this algorithm in order to select nodes depending of a given criterion (as the the degree, density or energy of nodes). The first section of this paper simplifies and proves the correctness of our generalised algorithm to select clusterheads. The cluster formation process proposed in [2] is extensively studied in the second section and is proved to be false. © IFIP International Federation for Information Processing 2007.