全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于演化博弈的Adhoc网络合作机制

, PP. 95-98

Keywords: Adhoc网络,合作,演化,重复囚徒困境博弈,激励机制

Full-Text   Cite this paper   Add to My Lib

Abstract:

设计一种不需要涉及外界手段(信誉或虚拟货币)的合作机制,并应用生态仿真方法,对Adhoc网络节点的报文转发过程进行博弈仿真.结果表明,无论在有或无噪声条件下,合作机制GTFT策略均能在种群中促进合作的涌现并保持演化稳定,而Gradual策略加噪之后表现并不稳定并且会加重网络负载,增加网络时延.

References

[1]  [1] BUTTYAN L, HUBAUX J P. Enforcing service availability in mobile ad-hoc WANs[C]// Proceedings of the 1st ACM International Symposium on Mobile ad hoc Networking & Computing. Piscataway:IEEE Press,2000: 87-96.
[2]  [2] BUCHEGGER S, LE BOUDEC J Y. Performance analysis of the confidant protocol[C]// Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking & Computing. New York: ACM Press, 2002: 226–236.
[3]  [3] MOLANDER P. The optimal level of generosity in selfish, uncertain environment[J]. Journal of Conflict Resolution, 1985, 29: 611-618.
[4]  [4] NOWAK M, SIGMUND K. Tit for tat in heterogeneous populations[J]. Nature, 1992, 355:250-253.
[5]  [5] MAILATH G J, SAMUELSON L. Repeated Games and Reputations [M]. Oxford: Oxford University Press, 2006.
[6]  [6] BEAUFILS B, DELAHAYE J P, MATHIEU P. Our meeting with gradual, a good strategy for the iterated prisoner’s dilemma[C]// Artificial Life V: Proceedings of The Fifth International Workshop on the Synthesis and Simulation of Living Systems. Nara: MIT Press. 1996.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133