Improving clustering techniques in wireless sensor networks using thinning process

Authors:
Monique Becker;Ashish Gupta;Michel Marot;Harmeet Singh
Affiliations:
CNRS---SAMOVAR---UMR 5157 --- TELECOM SudParis, Evry, France;CNRS---SAMOVAR---UMR 5157 --- TELECOM SudParis, Evry, France;CNRS---SAMOVAR---UMR 5157 --- TELECOM SudParis, Evry, France;CNRS---SAMOVAR---UMR 5157 --- TELECOM SudParis, Evry, France
Venue:
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
Year:
2010

Citing 6
Cited 0

Taming the underlying challenges of reliable multihop routing in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Experimental Study: Link Quality and Deployment Issues in Wireless Sensor Networks

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Correction, generalisation and validation of the "max-min d-cluster formation heuristic"

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Understanding topology challenges in the implementation of wireless sensor network for cold chain

RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
HybridLQI: Hybrid MultihopLQI for Improving Asymmetric Links in Wireless Sensor Networks

AICT '10 Proceedings of the 2010 Sixth Advanced International Conference on Telecommunications
An Aloha protocol for multihop mobile wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.