A mobile adhoc network (MANET) is a selfconfiguring network of mobile routers connected by wireless links—the union of which form an arbitrary topology. When the size of the network grows, the amount of signaling overhead also increases to maintain the topology updates. One of the main issues of a MANET's routing protocol is hence its capacity to scale on large and dense networks. In this paper, we investigate the problems of cluster head selection for large and dense MANETs in the presence of selfish nodes for intrusion detection. One of the variants of cluster head selection Examined is The sizeconstrained selection where each cluster is only allowed to have a limited number of members. To balance the resource consumption among all nodes and prolong the lifetime of an MANET, there are two main obstacles in achieving this goal First, without incentives for serving others, a node might behave selfishly by lying about its remaining resources. Second, electing an optimal collection of leaders to minimize the overall resource consumption may incur a prohibitive performance overhead. To address the issue of selfish nodes, we present a solution based on mechanism design theory.
展开▼
