The Most Trustworthy Path Selection in Online Social Networks

In online social networks, it is crucial for a service consumer to find the most trustworthy path to a target service provider from numerous social trust paths between them. The selection of the most trustworthy path (namely, optimal social trust path (OSTP)) with multiple end-to-end quality of trus...

Full description

Saved in:
Bibliographic Details
Published inMathematical problems in engineering Vol. 2013; no. 2013; pp. 1 - 10
Main Author Liu, Lianggui
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2013
Hindawi Limited
Subjects
Algorithms
Heuristic
Mathematical problems
Neural networks
Phase transitions
Polynomials
Quality assurance
Science
Searching
Social networks
Trust
Trustworthiness
Online AccessGet full text

Cover

More Information
Summary:In online social networks, it is crucial for a service consumer to find the most trustworthy path to a target service provider from numerous social trust paths between them. The selection of the most trustworthy path (namely, optimal social trust path (OSTP)) with multiple end-to-end quality of trust (QoT) constraints has been proved to be NP-Complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during searching process. Quantum annealing uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. It has been proved to be a promising way to many optimization problems in recently published literature. In this paper, for the first time, QA based OSTP algorithm (QA_OSTP) is applied to the selection of the most trustworthy path. The experiment results show that QA based algorithm has better performance than its heuristic opponents.
ISSN:1024-123X
1563-5147
DOI:10.1155/2013/408148