Decentralised trust-management inspired by ant pheromones

被引:0
|
作者
Edenhofer S. [1 ]
Tomforde S. [2 ]
Fischer D. [1 ]
Hähner J. [1 ]
Menzel F. [3 ]
Von Mammen S. [1 ]
机构
[1] Organic Computing Group, University of Augsburg, Eichleitnerstr. 30, Augsburg
[2] Intelligent Embedded Systems Group, University of Kassel, Wilhelmshoher Allee 73, Kassel
[3] Department of Evolutionary Biology, Institute of Zoology, University of Mainz, Johannes-von-Muller-Weg 6, Mainz
来源
Edenhofer, Sarah (sarah.edenhofer@informatik.uni-augsburg.de) | 1600年 / Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland卷 / 07期
关键词
Ant algorithms; Asymmetric encryption; Computing grid systems; Distributed verification; MAS; Multi-agent systems; Organic computing; Pheromones; Trust;
D O I
10.1504/IJMNDI.2017.082804
中图分类号
学科分类号
摘要
Computational trust is increasingly utilised to select interaction partners in open technical systems consisting of heterogeneous, autonomous agents. Current approaches rely on centralised elements for managing trust ratings (i.e. control and provide access to aggregated ratings). Consider a grid computing application as illustrating example: agents share their computing resources and cooperate in terms of processing computing jobs. These agents are free to join and leave, and they decide on their own with whom to interact. The impact of malicious or uncooperative agents can be countered by only cooperating with agents that have shown to be benevolent: trust relationships are established. Typically, this requires a centralised data-base storing information about past interactions and their outcome. In this article, we propose a novel, decentralised trust mechanism inspired by the nestmate recognition system in ants. More precisely, the concept of recognition pheromones, which stick to the agents and cannot be removed or counterfeit, is turned into algorithmic logic and interaction protocols. We demonstrate the potential benefit by using simulations of the grid scenario. Copyright © 2017 Inderscience Enterprises Ltd.
引用
收藏
页码:46 / 55
页数:9
相关论文
共 50 条
  • [1] Trust-management framework in open network
    Luo, Xin
    Yang, Yi-Xian
    Hu, Zheng-Ming
    Su, Zhi-Yuan
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2009, 32 (01): : 126 - 130
  • [2] Trust-management in Internet and pervasive systems
    Sloman, M
    IEEE INTELLIGENT SYSTEMS, 2004, 19 (05) : 77 - 79
  • [3] Weighted pushdown systems and trust-management systems
    Jha, Somesh
    Schwoon, Stefan
    Wang, Hao
    Reps, Thomas
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2006, 3920 : 1 - 26
  • [4] Delegation depth control in trust-management system
    Hong, F
    Zhu, X
    Wang, SB
    AINA 2005: 19TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 2, 2005, : 411 - 414
  • [5] Overview of the AT&T labs trust-management project
    Feigenbaum, J
    SECURITY PROTOCOLS, 1999, 1550 : 45 - 58
  • [6] RT:: A role-based trust-management framework
    Li, NH
    Mitchell, JC
    DARPA INFORMATION SURVIVABILITY CONFERENCE AND EXPOSITION, VOL I, PROCEEDINGS, 2003, : 201 - 212
  • [7] Design of a role-based trust-management framework
    Li, NH
    Mitchell, JC
    Winsborough, WH
    2002 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2002, : 114 - 130
  • [8] A Trust-Management Toolkit for Smart-Grid Protection Systems
    Fadul, Jose E.
    Hopkinson, Kenneth M.
    Andel, Todd R.
    Sheffield, Christopher A.
    IEEE TRANSACTIONS ON POWER DELIVERY, 2014, 29 (04) : 1768 - 1779
  • [9] A Model for Terrain Coverage Inspired by Ant's Alarm Pheromones
    Menezes, Ronaldo
    Martins, Francisco
    Viera, Francisca Emanuelle
    Silva, Rafael
    Braga, Marcio
    APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 728 - +
  • [10] Distributed credential chain discovery in trust-management with parameterized roles
    Zhu, X
    Wang, SB
    Hong, F
    Liao, JG
    CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 2005, 3810 : 334 - 348