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

Authors:
Alexandre Delye De Clauzade De Mazieux;Michel Marot;Monique Becker
Affiliations:
GET, INT, UMR Evry Cedex, France;GET, INT, UMR Evry Cedex, France;GET, INT, UMR Evry Cedex, France
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 0
Cited 3

Reducing collision probability on a shared medium using a variational method

ACM SIGMETRICS Performance Evaluation Review
Improving clustering techniques in wireless sensor networks using thinning process

PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
Onto scalable Ad-hoc networks: Deferred Routing

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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 clusterheads 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.