By Topic

Reputation propagation and agreement in mobile ad-hoc networks

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
$31 $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

2 Author(s)
Yanbin Liu ; Dept. of Comput. Sci., Texas Univ., Austin, TX, USA ; Yang, Y.R.

Several reputation systems have been proposed for mobile ad-hoc networks in order to stimulate cooperation among mobile nodes. However, whether or not the mobile nodes will agree on the reputation of other nodes is not studied. In this paper, we present a formal specification and analysis of a general class of mechanisms to locally update the reputation of mobile nodes. Given an initial assessment of the reputation of other mobile nodes, we formally show that under mild conditions, the mobile nodes will achieve reputation agreement. Our analysis captures reputation propagation using graph connectivity and makes use of a recent theoretical result [A. Jadbabaie, et. al., IEEE Control and Decision Conference, 2001]. We also evaluate the convergence speed of two reputation propagation mechanisms through simulations. Our simulations show that the speed of reputation propagation is an important factor for the convergence speed of reputation agreement.

Published in:

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE  (Volume:3 )

Date of Conference:

20-20 March 2003