期刊文献+

基于重复博弈的无线自组网络协作增强模型 被引量:26

Repeated-Game Modeling of Cooperation Enforcement in Wireless Ad Hoc Network
下载PDF
导出
摘要 在缺乏集中控制的无线自组网络中,节点在转发过程中所表现出的自私行为将严重影响其网络服务的可靠性.在节点理性假设的基础上,针对自组网络节点的预期收益及其协作交互过程建立了一个重复博弈模型,提出了一个激励一致性条件,在此条件下,节点将迫于惩戒机制威慑而自愿采取合作策略;并分析了节点对将来利益重视程度、机制参数和作弊检测效率对协作效果的影响.仿真结果表明,通过合理选择惩戒机制参数,能够有效抵御网络规模的增长及节点合作意愿、作弊检测效率的降低所导致的协作性削弱,进而提高存在自私节点时的整体网络性能. Due to the absence of centralized authority, the service reliability of wireless ad hoc network is seriously affected by selfish actions of the rational nodes during the packet forwarding. This paper proposes a repeated-game model of node behavior that takes account of the selfish nodes' future payoff expectations and their long-term desires for profit. An incentive-compatible condition under which the selfish one will be deterred from cheating by the subsequent punishments and then turn to cooperate is shown analytically. The impacts on the selfish nodes' behaviors, which are induced by their willingness for future collaboration, the parameter settings of punishment mechanism and the efficiency of misbehavior detection, are also discussed. Simulation results show that, the increase of network scale, the deterioration of node's collaborative patience and the low misbehavior detection efficiency will motivate entities toward self-interested action, but this tendency can be neutralized by a careful configuration of the punishment mechanism in the model.
出处 《软件学报》 EI CSCD 北大核心 2008年第3期755-768,共14页 Journal of Software
基金 Supported by the National High-Tech Research and Development Plan of China under Grant No.2003AA142010 (国家高技术研究发展计划(863)
关键词 重复博弈 无线自组网络 纳什均衡 协作增强 自私性 repeated game wireless ad hoc network Nash equilibrium cooperation enforcement selfishness
  • 相关文献

参考文献22

  • 1Urpi A, Bonuccelli M, Giordano S. Modeling cooperation in mobile ad hoc networks: A formal description of selfishness. In: Proc. of the Int'l Symp. on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT 2003). 2003. ftp://ftp-sop.inria.fr/maestro/WiOpt03 PDFfiles/urpi10.pdf
  • 2Marti S, Giuli T, Lai K. Mitigating routing misbehavior in mobile ad hoc networks. In: Proc. of the ACM MobiCom 2000. New York: ACM Press, 2000. 255-265.
  • 3Elkind E, Sahai A, Steighlitz K. Frugality in path auctions. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms. Philadelphia: Society for Industrial and Applied Mathematics. 2004. 701-709.
  • 4Anderegg L, Eidenbanz S. Ad hoc VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish Agents. In: Proc. of the ACM MobiCom 2003. New York: ACM Press, 2003. 245-259.
  • 5Osborne MJ, Rubinstein A. A Course in Game Theory. Cambridge: MIT Press, 1994.
  • 6Afergen M, Using repeated games to design incentive-based routing systems. In: Proc. of the IEEE INFOCOM 2006. Washington: IEEE Computer Society, 2006. 1-13.
  • 7Buttyan L, Hubaux J. Stimulating cooperation in self-organizing mobile ad hoc networks. ACM/Kluwer Mobile Networks and Applications, 2003,8(5):579-592.
  • 8Zhong S, Chen J, Yang YR. Sprite: A simple cheat-proof credit-based system for mobile ad hoc networks. In: Proc. of the IEEE INFOCOM 2003, Vol.3. Washington: IEEE Computer Society, 2003. 1987-1997.
  • 9Huang E, Crowcroft J. Rethinking incentives for mobile ad hoc networks. In: Proc. of the ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems 2004. New York: ACM Press, 2004. 191-196.
  • 10Mahajan R, Rodrig M. Sustaining cooperation in multi-hop wireless networks. In: Proc, of the USENIX NSDI 2005 Syrup. on Networked Systems Design & Implementation (NSDI2005), Berkeley: USENIX Association, 2005, 231-244.

同被引文献278

引证文献26

二级引证文献74

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部