Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2012, Article ID 781275, 10 pages
Research Article

Cluster Density of Dependent Thinning Distributed Clustering Class of Algorithms in Ad Hoc Deployed Wireless Networks

Department of Electronic and Telecommunication Engineering, University of Moratuwa, Moratuwa 10400, Sri Lanka

Received 21 October 2011; Accepted 13 February 2012

Academic Editor: Youyun Xu

Copyright © 2012 Sankalpa Gamwarige and Chulantha Kulasekere. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Distributed clustering is widely used in ad hoc deployed wireless networks. Distributed clustering algorithms like DMAC, HEED, MEDIC, ANTCLUST-based, and EDCR produce well-distributed Cluster Heads (CHs) using dependent thinning techniques where a node’s decision to be a CH depends on the decision of its neighbors. An analytical technique to determine the cluster density of this class of algorithms is proposed. This information is required to set the algorithm parameters before a wireless network is deployed. Simulation results are presented in order to verify the analytical findings.