A Secure Mechanism Design-Based and Game Theoretical Model for MANETs推荐.pdfVIP

Mobile Netw Appl (2010) 15:191–204 DOI 10.1007/s11036-009-0164-7 A Secure Mechanism Design-Based and Game Theoretical Model for MANETs A. Rachedi · A. Benslimane · H. Otrok · N. Mohammed · M. Debbabi Published online: 6 May 2009 © Springer Science + Business Media, LLC 2009 Abstract To avoid the single point of failure for the not belong to the confident community to participate certificate authority (CA) in MANET, a decentralized by giving them incentives in the form of trust, which solution is proposed where nodes are grouped into can be used for cluster’s services. To achieve this goal, different clusters. Each cluster should contain at least a RA selection algorithm is proposed that selects nodes two confident nodes. One is known as CA and the ano- based on a predefined selection criteria function and ther as register authority RA. The Dynamic Demili- location (i.e., using directional antenna). Such a model tarized Zone (DDMZ) is proposed as a solution for is known as moderate. Based on the security risk, more protecting the CA node against potential attacks. It is RA nodes must be added to formalize a robust DDMZ. formed from one or more RA node. The problems Here, we consider the tradeoff between security and of such a model are: (1) Clusters with one confident resource consumption by formulating the problem as node, CA, cannot be created and thus clusters’ sizes a nonzero-sum noncooperative game between the CA are increased which negatively affect clusters’ services and attacker. Finally, empirical results are provided to and stability. (2) Clusters with high density of RA support our solutions. can cause channel collision at the CA. (3) Clusters’ lifetime are reduced since RA monitors are always