Abstract
hop, dynamic networks established by a collection of mobile nodes. This type of network is highly demanding due to the lack of infrastructure, cost effectiveness and easiness in installation. A research issue in the design of ad hoc networks is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. In a large network, flat routing schemes produce an excessive amount of information that can saturate the network. Cluster-based routing is a solution to limit the amount of routing information that propagates inside the network. The idea behind clustering is to group the network nodes into a number of overlapping clusters. Several algorithms have been proposed by researchers for formation of cluster and election of clusterhead. During the cluster formation phase, the ordinary nodes select their best as the clusterhead. The mobile nodes are vulnerable to security attacks, so ensuring the security of the network is essential. To enhance security, it is important to evaluate the trustworthiness of nodes without depending on central authorities. The proposed work calculates trustworthiness of the nodes based on all previous transactions in all situations and takes it in to account while electing clusterheads.