By Topic

The most credible path algorithm on broadcast

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wang Fengying ; School of Computer Science and Technology, Shandong University of Technology, Zibo, China ; Li Caihong ; Li Xiumei ; Zhang Longbo

Broadcasting message via the social web, people always hope that the message goes through the most credible path, and would like to know trustworthiness on the most credible path and the least credible path. To solve these problems, this article defines the concepts related to the most credible path and the least credible path for single-source broadcast. Proposes algorithms on the most credible path and the least credible path, quantifies the trustworthiness of the most credible path and the least credible path. Analysis shows that the two algorithms have polynomial time complexity. Typical applications show that the most credible path algorithm on single-source broadcast have an important practical value, which enhances the security of the message broadcast.

Published in:

Intelligent Control and Automation (WCICA), 2010 8th World Congress on

Date of Conference:

7-9 July 2010