Cooperative clustering based Secure Leader Election Model For Intrusion Detection in MANET

In this paper, we learn the leader election in the occurrence of selfish nodes for intrusion detection in mobile ad hoc networks. Leader election is the key to cluster strength and network performance. We propose a partner clustering algorithm (PCA) to elect right leader node for each cluster and divider the network into non overlapped 1-hop clusters. Specifically, our PCA adopts Coverage distance, transmission power as metrics to periodically choose proper leader node. One of the main obstacle in achieving this target is a node might act selfishly by untruthful about its resources and avoiding being elected. We present a solution based on the vickrey, Clarke, and groves solution provides nodes with incentives in the type of reputations to promote nodes in truthfully participating in the election process.