{'fraction_non_alphanumeric': 0.014179608372721135, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Mechanism Design Based Nodes Selection Model for Threshold Key Management in MANETs

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). However, most of previous works ignore the efficiency and effectiveness and assuming there are always honest nodes performing the service. Focusing on the development of a model which can be used to select a coalition of nodes dynamically and optimally to carry out the threshold key management service during its operation in MANETs with selfish nodes, this paper formulates the dynamic nodes selection problem as combinatorial optimization problem with the objectives of maximizing the success ratio of key management service and minimizing the nodes' cost of security and energy firstly. Then, to ensure truth-telling is the dominant strategy for any node in our scenario, we extend the payment structure of the classical Vickrey, Clarke, and Groves (VCG) mechanism design framework and divide the payment to nodes in the coalition of nodes with the consideration of the actual execution effectiveness of each one. Simulations show that 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, compared with existing works in the presence of selfish nodes.