Secure Leader Election for Intrusion Detection in MANET

Abstract

This paper shows the leader election in presence of selfish nodes. To balance the resource consumption among the nodes and prolong the life time of manet. Nodes with highest resource should be elected as a leaders. But there is  obstacles in doing so.  First, node may lie about its available resources. Second, electing multiple  leaders may leads to additional overhead. Considering first, solution is based on Mechanism design. It  provides incentives to the nodes to honestly participate in the election process. The amount of incentives provide to the nodes is based on Vickrey, Clarke, and Groves (VCG) model. Considering second, series of algorithms are there to address optimal leader election.