Open AccessDominating Set Based Clustering Algorithm for Mobile Adhoc Network
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d7930.118419
Subject(s) - mobile ad hoc network , computer science , cluster analysis , computer network , wireless ad hoc network , node (physics) , distributed computing , hierarchical clustering of networks , overhead (engineering) , data mining , correlation clustering , cure data clustering algorithm , wireless , artificial intelligence , engineering , telecommunications , structural engineering , network packet , operating system
A group of mobile nodes using a common wireless media forms a dynamic multihop network known as Mobile Ad-Hoc network (MANET). Creating substructure (cluster) of the mobile adhoc network, basically divides the network into sub network. It has been observed that clustering of large size MANET improves the system performance to a large extent. Clustering allows the MANET to organize it in some hierarchy which reduces control overhead and make it scalable. This paper, gives a new scheme of clustering the MANET that uses the concept of dominating set. The cluster so formed by the proposed method is more stable (less mobile) than the earlier existing algorithms .Here the dominating nodes will be considered as the cluster head of a particular cluster. The non dominating nodes will select the most qualified dominating node as their cluster head and will join the cluster. The quality of the node is measured by its clustering co efficient