IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i6p245017.html
   My bibliography  Save this article

An Evolutionary Game-Based Trust Cooperative Stimulation Model for Large Scale MANETs

Author

Listed:
  • Xiao Wang
  • Yinfeng Wu
  • Yongji Ren
  • Renjian Feng
  • Ning Yu
  • Jiangwen Wan

Abstract

In order to realize a methodical, effective cooperative stimulation for MANETs and search dynamic trust cooperative stimulation scheme in environment under a high malicious ratio, we have proposed an evolutionary game-based trust cooperative stimulation model for large scale MANETs in this paper. First, the system members' pluralistic behavior for MANETs has been covered by means of constructing the complete multirisk level strategy space. Then a trust-preferential strategy has been built through trust numerical value mapping technology, which achieves the aim that the malicious action is effectively constrained to avoid a low trust level. Furthermore, the mobility probable parameters and information propagation error matrix are introduced into game model, and the convergence condition between optimum strategy which represents payoff maximization principle and trust-preferential strategy is deduced through evolutionary analyzing finally. Both theoretical analysis and simulation experiments have demonstrated that our model can effectively stimulate cooperation among members and meanwhile be robust under the condition where the environment is harsh under a high original malicious ratio in large scale MANETs.

Suggested Citation

  • Xiao Wang & Yinfeng Wu & Yongji Ren & Renjian Feng & Ning Yu & Jiangwen Wan, 2013. "An Evolutionary Game-Based Trust Cooperative Stimulation Model for Large Scale MANETs," International Journal of Distributed Sensor Networks, , vol. 9(6), pages 245017-2450, June.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:6:p:245017
    DOI: 10.1155/2013/245017
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/245017
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/245017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:6:p:245017. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.