Comparative Study of Clustering Based Algorithm in Mobile Ad-Hoc Network
Harjeet Singh Chauhan

Prof. Harjeet Singh Chauhan, Registrar, B.M. Group of Institution, Gurgaon (Haryana), India.
Manuscript received on 21 July 2013 | Revised Manuscript received on 28 July 2013 | Manuscript published on 30 July 2013 | PP: 110-113 | Volume-2 Issue-3, July 2013 | Retrieval Number: C0717072313/2013©BEIESP
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: Today Energy efficiency is a critical issue in mobile ad hoc networks (MANETs) for increasing the lifetime of the individual nodes as well as the overall network. Mobile ad-hoc network has become a very important field of study for students and researchers owing to its wide application. In mobile ad-hoc network all nodes are responsible for routing and forwarding of packets, hence all nodes are required to act selflessly for proper functioning of mobile ad-hoc network. In the we present the study of low power clustering algorithm. In this paper present the survey of clustering algorithms in MANET. In particular, the algorithms under consideration are single hop representatives of the energy constrained ad hoc network. The emphasis is given mostly on the cluster formation principles and the cluster maintenance parameters of the algorithms. Simulation results are discussed to describe the effect of transmission range and the size of the network on the parameters like cluster density, frequency of reelection, frequency of cluster changes in the dynamic network. Partitioning the mobile nodes is a NP-hard problem. The lowest id, highest connectivity and weighted cluster algorithm to make it more intrusting.
Keywords: MANET, Lowest Id Theorem, Highest Connective Algorithm, Weight Cluster Algorithm.

Scope of the Article: Software Engineering Case Study and Experience Reports