TY - GEN
T1 - Correction, generalisation and validation of the "max-min d-cluster formation heuristic"
AU - De Mazieux, Alexandre Delye De Clauzade
AU - Marot, Michel
AU - Becker, Monique
PY - 2007/12/24
Y1 - 2007/12/24
N2 - 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.
AB - 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.
M3 - Conference contribution
AN - SCOPUS:37249078680
SN - 9783540726050
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1149
EP - 1152
BT - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - 6th International IFIP-TC6 Networking Conference, Proceedings
T2 - 6th International IFIP-TC6 Networking Conference on NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet
Y2 - 14 May 2007 through 18 May 2007
ER -