Most of the routing protocols used in Mobile Adhoc Networks (MANET) require update the route information to neighbour or any other nodes. These route update overhead degrade the performance of routing algorithms as there is a significant routing overhead. Proposed is a technique to reduce route update overhead through the minimization of the routing delay. The aim is to reduce the network congestion and minimize the complexities that are commonly faced by Mobile Adhoc Networks. Here, a clustering mechanism is introduced, which clusters the arriving nodes in the Mobile Adhoc Network. The election strategy is required to elect a particular node from the group of nodes in the cluster to act as the cluster head, based on the resources that are possessed by that node. Experimental results indicate reduced time and routing packets in this scheme