Ring Clustering Algorithm for wireless ad hoc networks

Abstract

This paper presents a new connected dominating set clustering algorithm called the Ring-Clustering Algorithm (RCA) for the formation of virtual backbones in wireless ad hoc networks. Since determining the minimum connected dominated set is an NP-hard problem, RCA heuristically finds the Connected Dominated Set (CDS). The algorithm uses one-hop neighboring data to determine ring-nodes, which are responsible for establishing the CDS. The simulation study shows that RCA is more effective in reducing the size of CDS against recently proposed algorithms.