The purpose is to minimize the number of clusters formed
in the network and in this way obtain dominating sets of
smaller sizes. Clusters in the K- CONID approach are
formed by a cluster head and all nodes that are at distance at most k-hops from the cluster head At the beginning of the algorithm, a node starts a flooding process in which a clustering request is send to all other nodes