Mechanism Design Based Nodes Selection Model for Threshold Key Management in MANETs  

作　　者：GUO Yuanbo MA Jianfeng WANG Chao YANG Kuiwu 

机构地区：[1]The PLA Information Engineering University, Zhengzhou 450001, China [2]School of Computer Seicnce and Technology, Xidian University, Xi'an 710071, China

出　　处：《Chinese Journal of Electronics》2013年第4期820-825,共6页电子学报（英文版）

基　　金：This work is supported by the Excellent Youth Foundation of He＇nan Scientific Committee （No.104100510025） and the National Natural Science Foundation of China （No.60633020）.

摘　　要：The design of threshold based distributed Certification authority （CA） has been proposed to provide secure and efficient key management service in Mobile ad hoc networks （MANETs）, but most of previous work ig- nore the efficiency and effectiveness and assuming there are always honest nodes performing the service. Focus- ing on developing a model to select a coalition of nodes dynamically and optimally to carry out the threshold key management service in MANETs, we formulate the dy- namic nodes selection problem as combinatorial optimiza- tion problem, with the objectives of maximizing the success ratio of the service and minimizing the nodes, cost of secu- rity and energy, and then extend the payment structure of the classical Vickrey, Clarke and Groves （VCG） mechanism design framework to ensure truth-telling is the dominant strategy for any node in our scenario. Compared with ex- isting works in the presence of selfish nodes, the proposed model enjoys an improvement of both the success ratio of key management service and lifetime of the network, and a reduction of both the cost of participating nodes and compromising probability of MANETs.

关 键 词：Nodes selection Threshold key manage- ment Success ratio Compromising probability Network lifetime Mechanism design MANET security. 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术] TN929.5[自动化与计算机技术—计算机科学与技术]