Name
Abstract | ||
|---|---|---|
We propose a rapid cluster formation algorithm using a thinning technique : rC-MHP(rapid Clustering inspired from Matérn Hard-Core Process). In order to prove its performance, it is compared with a well known cluster formation heuristic: Max-Min. Experimental results show that rC-MHP outperforms Max-Min in terms of messages needed to choose the cluster head, cluster head maintenance and memory requirement, comprehensively in sparse as well as in dense networks. We show that rC-MHP has a scalable behavior and it is very easy to implement. rC-MHP can be used as an efficient clustering technique. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-25575-5_17 | PERFORM |
Keywords | Field | DocType |
dense network,cluster head maintenance,cluster head,wireless sensor network,memory requirement,cluster formation heuristic,efficient clustering technique,rn hard-core process,rapid cluster formation algorithm,rapid clustering | Sensor node,Heuristic,Thinning,Computer science,Cluster analysis,Wireless sensor network,Scalability,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.37 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Monique Becker | 1 | 46 | 6.67 |
| Ashish Gupta | 2 | 1 | 0.37 |
| Michel Marot | 3 | 70 | 11.04 |
| Harmeet Singh | 4 | 26 | 4.77 |