Trustworthiness-hypercube-based reliable communication in mobile social networks

摘要

In mobile social networks (MSNs), the routing packet is forwarded from any user of in a group to any user of the other group until it reaches the destination group - the group. where the destination is located. However, it is inevitable that malicious groups could compromise the quality and reliability of data. To alleviate such effect, analyzing the trustworthiness of a group has a positive influence on the confidence with which a group conducts transactions with that group. In our previous work, the feature-based first-priority relation graph (FPRG) of MSNs is propcised, in which two vertices (groups) are connected iff they have a first-priority relationship. In this paper, the trustworthiness computation of a group is firstly presented in the algorithm TC (Trustworthiness Computing) based on the FPRG. The trustworthiness of a group is evaluated based on the trustworthiness of neighbors and the number of malicious users in the group. We then establish the Trustworthiness-Hypercube-based Reliable Communication (THRC) algorithm in MSNs. The algorithm THRC can provide an effective and reliable data delivery routing. Finally, we also give two scenario simulations to elaborate the processes of the trustworthiness computation and reliable communication. (C) 2016 Elsevier Inc. All rights reserved.