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

Sankalpa Gamwarige | Zendy; Chulantha Kulasekere | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Sankalpa Gamwarige,

Chulantha Kulasekere

Publication year - 2012

Publication title -

journal of computer networks and communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.355

H-Index - 23

eISSN - 2090-715X

pISSN - 2090-7141

DOI - 10.1155/2012/781275

Subject(s) - computer science , cluster analysis , wireless ad hoc network , node (physics) , mobile ad hoc network , cluster (spacecraft) , class (philosophy) , algorithm , distributed algorithm , wireless , wireless sensor network , computer network , wireless network , distributed computing , set (abstract data type) , data mining , artificial intelligence , telecommunications , structural engineering , engineering , programming language

Distributed clustering is widely used in ad hoc deployedwireless networks. Distributed clustering algorithms likeDMAC, HEED, MEDIC, ANTCLUST-based, and EDCR producewell-distributed Cluster Heads (CHs) using dependent thinningtechniques where a node’s decision to be a CH depends on thedecision of its neighbors. An analytical technique to determinethe cluster density of this class of algorithms is proposed. Thisinformation is required to set the algorithm parameters beforea wireless network is deployed. Simulation results are presentedin order to verify the analytical findings

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research