Recently, extensive research efforts have been devoted to the design of clustering algorithms to organize all the hosts in a mobile ad hoc network into a clustering architecture. Clustering is an important research topic because clustering makes it possible to guarantee basic levels of system performance, such as throughput and delay, in the presence of both mobility and a large number of mobile. MANETS have a limitation of battery power, cluster formation is expensive in terms of power depletion of nodes. This is due to the large number of messages passed during the process of cluster formation. A large variety of approaches for ad hoc clustering have been presented, whereby different approaches typically focus on different performance metrics. In this paper, we use the hop count based approach for binding a node to a cluster. We minimize the explicit message passing in cluster formation. We also used the route message of a proactive routing protocol for keeping track of nodes in cluster. Our scheme also involves low latency in the cluster formation phase. In addition, we choose the cluster gateway during cluster formation avoiding the need to explicitly discover the gateways, thus reducing further the transmission overheads. In this paper, we will propose an efficient clustering algorithm that can establish a stable clustering architecture by keeping a host with weak battery power from being elected as a cluster head. Addition to this we will focus authentication of node. Computer simulations show that clustering architectures generated by our clustering algorithm are more stable than those generated by other clustering algorithms.

1. J. Wu and Hill, “On Calculating Connected Dominating Set for Efficient Routing in Adhoc Wireless Networks”, Proc 3rd Int'l. Wksp. Discrete Algorithms and Methods for Mobile Comp. and Commun. 1999 pp. 7 – 14.
2. Y.Z.P Chen and A.L Liestman, “Approximating Minimum Size Weakly – Connected Dominating Sets for Clustering Mobile Adhoc Networks”, in Proc 3rd ACM Int'l. Symp. Mobile Adhoc Net. & Comp, June 2002, pp. 165 – 72.
3. Vikas Kawadia and P.R.Kumar, “Power Control and Clustering in Adhoc Networks”, IEEE Proc. INFOCOM conference 2003, pp 459 - 469.
4. J.Wuetal, “On Calculating Power Aware Connected Dominating Sets for Efficient Routing in Adhoc Wireless Networks”, J. Commun. and Networks vol 4, no . 1, Mar 2002, pp 59 – 70.
5. P. Basu, N. Khan, and T.D.C. Little, “A Mobility Based Metric for Clustering in Mobile Adhoc Networks”, in Proc. IEEE ICDCSW'01, Apr 2001, pp. 413 – 18.
6. M. Chatterjee, S. K Das, and D. Turgut, “An On-Demand Weighted Clustering Algorithm (WCA) for Adhoc Networks”, in Proc 6th ISADS'03, Apr 2003.
7. “Markov Chain Trust Model for Trust-Value Analysis and Key Management in Distributed Multicast MANETs”,Ben-Jye Chang; Szu-Liang Kuo; Vehicular Technology, IEEE Transactions on Volume: 58 , Issue: 4 , 2009 , Page(s): 1846 - 1863IEEE JOURNALS
8. “Cluster-Based Cross-Layer Design for Cooperative Caching in Mobile Ad Hoc Networks”, Denko, M.K., Jun Tian , Nkwe, T. ,Obaidat, M.S. Dept. of Comput. & Inf. Sci., Univ. of Guelph, Guelph, ON, Canada,Systems Journal, IEEE Volume: 3 , Issue: 4 , 2009.
9. Jane Y. Yu and Peter H.J. Chong, “A Survey of Clustering Schemes For Mobile Ad Hoc Networks” IEEE Commun. Survey & Tutorial, First quarter 2005, Vol 7 No. 1.
10. “Distributed Combined Authentication and Intrusion Detection With Data Fusion in High-Security Mobile Ad Hoc Networks” Shengrong Bu; Yu, F.R.; Liu, X.P.; Mason, P.; Tang, H.Vehicular Technology, IEEE Transactions , 2011 , IEEE JOURNAL

Hop count clustering cluster Maintenance