2-hop Clustering to accomplish semi-static structure in

Abstract

Most researches today trend to clustering in ad hoc networks for building hierarchies to solve management problems in flat architectures. Clustering aims to elect suitable nodes as representatives to lead the network, called Cluster Heads (CHs). Frequent topology changes occur due to nodes mobility and failure. Although re-clustering is invoked to maintain the clusters, many cases involve destroying the cluster when the CH moves to another region or fails and hence building new cluster/s is needed which negatively affects the stability of the network and its ability to provide services. In this research, I developed a 2-hop clustering solution to accomplish a semi-static structure. This is accomplished by reassigning the CHs according to the number of 1-hop neighbors. The node that has the highest number of 1-hop neighbors that are in the 1-hop range of the CH has the highest connectivity with the members and hence it is the best node to replace the CH when moves or fails. Simulation results show accomplishing semi-static structure and enhancing the performance of the ad hoc network. Keywords: Ad hoc networks, Cluster, Connectivity Number