Connectivity First Clustering Algorithm for Ad Hoc Networks
Liu Shizhou · Journal of Shenyang Jianzhu University · 2008
Due to transmitting power and channel restrictions,nodes need to cluster in wireless Ad Hoc networks.Clustering algorithm plays a key role in the performance of ad hoc networks.The goal of existing Highest Degree algorithm is to minimize the number of clusters.It can't guarantee connectivity.This paper presents a new algorithm called Connectivity First Clustering Algorithm which is based on HD Algorithm,and considers connectivity priority.In CF algorithm,nodes are divided into three types,such as member nodes,option nodes and free nodes.Gradually,free nodes change to member nodes or option nodes through expansion strategy.It's proved by evaluation that it can maintain domain connectivity well under the circumstances of low density.