• DocumentCode
    2270473
  • Title

    A P2P reputation model based on Ant Colony Algorithm

  • Author

    Yang, Lei ; Qin, Zhiguang ; Wang, Can ; Liu, Yao ; Feng, ChaoSheng

  • Author_Institution
    Coll. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
  • fYear
    2010
  • fDate
    28-30 July 2010
  • Firstpage
    236
  • Lastpage
    240
  • Abstract
    The characteristics of P2P networks bring great convenience for the users. Meanwhile, it causes also some security problems. It is an effective method of response that the reputation mechanism is built in P2P networks. In most existing reputation models, global flooding and local query are used for achieving the information of recommendation. The inadvisable methods affect the accuracy and efficiency for evaluating reputation. To make up the lack of existing models, a new trust evaluation model based on Ant Colony Algorithm is proposed in this paper. The recommendation relationship and the pheromone are associated in this model, several optimized trust paths between the requesting peer and the target peer are archived by enforcing the extend Ant Colony Algorithm, the reputation value of the target peer is composed of the trust values generated from different recommendation paths, the requesting peers always select the target peers with uppermost reputation values for transaction. Simulation analyses show that this model can further alleviate the negative impact due to the malicious peers, and the message overhead is reduced.
  • Keywords
    optimisation; peer-to-peer computing; P2P network; P2P reputation model; ant colony algorithm; global flooding; local query; malicious peers; message overhead reduction; reputation mechanism; simulation analysis; Algorithm design and analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Circuits and Systems (ICCCAS), 2010 International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-8224-5
  • Type

    conf

  • DOI
    10.1109/ICCCAS.2010.5582006
  • Filename
    5582006