Dominating Set Based Clustering Algorithm for Mobile Adhoc Network
A. K. Das1, B. Kalita2
1A. K .Das, Department of Computer Application, GIMT Guwahati, Assam, India.
2B Kalita Dept. of Computer Applications, Assam Don Bosco University, Guwahati, Assam, India.

Manuscript received on November 17., 2019. | Revised Manuscript received on November 24 2019. | Manuscript published on 30 November, 2019. | PP: 12824-12829 | Volume-8 Issue-4, November 2019. | Retrieval Number: D7930118419/2019©BEIESP | DOI: 10.35940/ijrte.D7930.118419

Open Access | Ethics and Policies | Cite  | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: 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.
Keywords: Mobile Adhoc Network (MANET), Connected Dominating Set (CDS), Unit Disk Graph (UDG), Clustering Co efficient.
Scope of the Article: Clustering.