The Most Trustworthy Path Selection in Online Social Networks

Lianggui Liu

Mathematical Problems in Engineering, 2013, vol. 2013, 1-10

Abstract:

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/408148.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/408148.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:408148

DOI: 10.1155/2013/408148

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().