Abstract
The knot model is aimed at obtaining a trust-based reputation in communities of strangers. It identifies groups of trustees, denoted as knots and among whom overall trust is strong, and is thus considered the most capable solution for providing reputation information to other members within the same knot. The problem of identifying knots in a trust network is modeled as a graph clustering problem. When considering dynamic and large-scale communities, the task of keeping the clustering correct over time is a great challenge. This paper introduces a clustering maintenance algorithm based on the properties of knots of trust. A maintenance strategy is defined that addresses violations of knot properties due to changes in trust relations that occur with time in response to the dynamic nature of the community. Based on this strategy, a reputation management procedure is implemented in two phases: the first identifies the essence of change and makes a decision regarding the need to improve knot clustering. The second phase locally modifies the clustering to preserve a stable network structure while keeping the network correctly clustered with respect to the knot utility function. We demonstrate by simulation the efficiency of the maintenance algorithm in preserving knots quality, for cases in which only local changes have occurred, to ensure the reliability of the reputation system.
Chapter PDF
Similar content being viewed by others
References
Jøsang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems 43(2), 618–644 (2007)
Gal-Oz, N., Gudes, E., Hendler, D.: A Robust and Knot-Aware Trust-Based Reputation Model. In: Karabulut, Y., Mitchell, J., Herrmann, P., Jensen, C.D. (eds.) IFIPTM 2008. IFIP, vol. 263, pp. 167–182. Springer, Boston (2008)
Gal-Oz, N., Yahalom, R., Gudes, E.: Identifying knots of trust in virtual communities. In: Wakeman, I., Gudes, E., Jensen, C.D., Crampton, J. (eds.) Trust Management V. IFIP AICT, vol. 358, pp. 67–81. Springer, Heidelberg (2011)
Lo, V., Zappala, D., Zhou, D., Liu, Y.-H., Zhao, S.: Cluster computing on the fly: P2P scheduling of idle cycles in the internet. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 227–236. Springer, Heidelberg (2005)
M’hamdi, M.A., Bentahar, J.: Scheduling reputation maintenance in agent-based communities using game theory. JSW 7(7), 1514–1523 (2012)
Gopalan, S.G., Gayathri, V., Emmanuel, S.: FPGA implementation and analyses of cluster maintenance algorithms in mobile ad-hoc networks. In: Srikanthan, T., Xue, J., Chang, C.-H. (eds.) ACSAC 2005. LNCS, vol. 3740, pp. 714–727. Springer, Heidelberg (2005)
Wang, L., Olariu, S.: Cluster maintenance in mobile ad-hoc networks. Cluster Computing 8(2-3), 111–118 (2005)
Li, F., Zhang, S., Wang, X., Xue, X.-Y., Shen, H.: Vote-based clustering algorithm in mobile ad hoc networks. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 13–23. Springer, Heidelberg (2004)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15(7), 1265–1275 (1997)
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 238–247. IEEE Computer Society, Washington, DC (2002)
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. Journal of the ACM (JACM) 55(5), 1–27 (2008)
Kinateder, M., Baschny, E., Rothermel, K.: Towards a generic trust model – comparison of various trust update algorithms. In: Herrmann, P., Issarny, V., Shiu, S.C.K. (eds.) iTrust 2005. LNCS, vol. 3477, pp. 177–192. Springer, Heidelberg (2005)
Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proceedings of the 13th International Conference on World Wide Web (WWW 2004), pp. 403–412. ACM (May 2004)
Edachery, J., Sen, A., Brandenburg, F.J.: Graph clustering using distance-k cliques. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 98–106. Springer, Heidelberg (1999)
Ward, J., Hook, M.: In: Application of an Hierarchical Grouping Procedure to a Problem of Grouping Profiles 23(1), 69–82 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gur, L., Gal-Oz, N., Gudes, E. (2014). Knots Maintenance for Optimal Management of Trust Relations. In: Zhou, J., Gal-Oz, N., Zhang, J., Gudes, E. (eds) Trust Management VIII. IFIPTM 2014. IFIP Advances in Information and Communication Technology, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43813-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-43813-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43812-1
Online ISBN: 978-3-662-43813-8
eBook Packages: Computer ScienceComputer Science (R0)