Sparc-Self Preservation Algorithm For Rouse Cooperative Leader Election In Manet

Mobile Ad hoc network is a set of mobile nodes connected by wireless links where the nodes will communicate with one another. Each device in MANET can move in any direction so there is no fixed topology and they are called as self-configuring and infrastructure-less networks. The nodes are classified into groups called clusters. Depending on their geographical location nodes belong to one among the multiple clusters. Every cluster has a Cluster Head (CH) which maintains the necessary information about its cluster members. It is responsible for data transmission. Nodes in MANET have limited resources and battery. However, frequent change in cluster head affects routing protocol performance since nodes are busy in electing the cluster head rather than packet relaying. This voting based election mechanism requires a high resource utilization thereby, creating a performance overhead and reduces the lifetime of the node. So the election process must also make the processing time and energy limitations of the nodes under consideration. Due to these factors, electing the proper (CH) is a tedious task. To meet this challenge we have proposed a SPARC-Self Preservation Algorithm for Rouse Cooperative Leader Election in MANET. In our approach formation of multiple clusters is avoided by changing the shape of the cluster into convex polygon and distributed trust model which makes use of Bayesian approach to categorize the nodes in the cluster network. Highly trusted node is elected as Cluster Head (CH), dynamically using Max-Heap which starts to serve its cluster members. Incentives are paid by the current cluster head to the old cluster head.