期刊文献+

基于博弈论的机会网络激励机制的研究 被引量:5

Novel game-based incentive strategy for opportunistic networks
下载PDF
导出
摘要 机会网络是一种新型的网络,具有频繁的网络断开、高误码率、随机的拓扑变化等特点,该网络中的消息传播是依靠节点间的合作来完成存储—携带—转发的模式。由于能量、缓存以及处理能力的限制,一些节点表现出自私(拒绝帮助其他节点转发消息),甚至恶意(高报价)的特性,所以会给网络性能带来巨大的损失(低交付率、长延迟等)。为了解决上面的问题,现存的基于虚拟货币的激励机制,如Credit,它依靠一个固定的中心来管理源节点向为它转发消息的中继节点支付虚拟货币的交易。但这个固定的管理中心在缺乏基础设施的机会网络中是很难实现的,所以提出一种新的基于博弈论的激励机制——GIS(game-based incentive strategy)。该机制主要利用三次讨价还价博弈让交易双方在缺乏第三方管理的情况下仍然以合理的价格进行交易,它除了能够刺激自私节点的合作之外,最大的优势就是抑制恶意中继的虚假报价。大量实验表明,GIS能够很好地优化网络交付率和平均延迟,使得网络的有效性和公平性得到保证。 Opportunistic networks are the emerging networks characterized by frequent network partitions, high bit error ratio and random topology instability, where the message propagation depends on the cooperation of nodes to fulfill a "store-carry-forward" fashion. Due to the confine of energy, memory and processing capacity, some individual nodes may behave selfishly, or even maliciously, which will introduce damage into the existing routing schemes based on cooperation and degrade the performance ( lower delivery ratio, longer latency etc. , ) of opportunistic networks greatly. In order to address the above issues, the current price-based incentive strategy, Credit relies on a fixed management-center which is rare in the realistic opportunistic networks with little infrastructure to manage the transaction that the source of messages pays virtual credits to nodes that relay messages for it. So this paper proposed a novel game-based incentive strategy (GIS) which utilized three-time bargaining model based on two-person transaction and allowed the sending nodes to pay the relay nodes directly according to the optimal price drawn by game without any third party. GIS stimulated the cooperation of selfish nodes to forward messages effectively, while held back the deceptive price stemmed from the malicious intermediary nodes to facilitate deals. From the extensive simulations results, GIS can optimize the average latency and the delivery ratio to the greatest extent. Additionally, it can guarantedd effectiveness and fairness.
出处 《计算机应用研究》 CSCD 北大核心 2015年第7期2128-2132,共5页 Application Research of Computers
基金 重庆市自然科学基金资助项目(cstc2014jcy40044) 重庆市教委科学技术研究资助项目(KJ1400406) 长江学者和创新团队发展计划资助项目(IRT1299) 重庆市科委重点实验室专项经费资助项目
关键词 机会网络 自私节点 博弈 激励策略 opportunistic network selfish nodes game incentive strategy
  • 相关文献

参考文献19

  • 1Zhang Zhensheng. Routing in intermittently connected mobile Ad hoc networks and delay tolerant networks: overview and challenges [ J ]. IEEE Communications Surveys Yutodals,2006,8( 1 ) :24-37.
  • 2Ramanathan R, Hansen R, Basu P, et al. Prioritized epidemic rou- ting for opportunistic networks[ C ]//Proc of the 1 st International Mo- biSys Workshop on Mobile Opportunistic Networking. New York:ACM Press, 2007 : 62 - 66.
  • 3Dhurandher S K, Sharma D K, Garg A, eta/. Fixed and mobile in- frastructure,based muting protocol in opportunistic networks [ C ]// Proc of All India Seminar on Biomedical Engineering. [ S. l. ] : Sprin- ger,2013:247-253.
  • 4熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. 被引量:324
  • 5Lu Rongxin, Lin Xiaodong, Zhu Haojin, et al. Pi:a practical incen- tive protocol for delay tolerant networks[ J]. IEEE Trans on Wire- less Communications ,2010,9 (4) : 1483-1493.
  • 6Panagakis A, Vaios A, Stavrakakis I. On the effects of cooperation in DTNs [ C ]//Proc of the 2nd International Conference on Communica- tion Systems Software and Middleware. 2007:1-6.
  • 7Liu Jinshan, Issamy V. Enhanced reputation mechanism for mobile Ad hoc networks [ C ]//Trust Management, 2004:48- 62.
  • 8Buttyn L, Dra L, Flegyhzi M, et al. Barter trade improves message delivery in opportunistic networks [ J ]. Ad Hoe Networks, 2010,8 (1) :1-14.
  • 9Chen B B, Chan M C. Mobicent: a credit-based incentive system for disruption tolerant network[ C]//Proc of IEEE INFOCOM. 2010:1- 9.
  • 10Buchegger S, Le Boudec J Y. A robust reputation system for P2P and mobile Ad-hoc networks [ C ]//Pmc of the 2nd Workshop on Economi- cs of P2P Systems. 2004.

二级参考文献67

  • 1Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, Shih E, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In: Proc. of the 4th Int'l Conf. on Embedded Networked Sensor Systems. Boulder: ACM, 2006. 125-138.
  • 2Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM. 2005. 244-251.
  • 3Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002.96-107. DO1=http://doi.acm.org/10.1145/605397.605408
  • 4Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006,44(11): 134-141.
  • 5Conti M, Giordano S. Multihop ad hoe networking: The reality. Communications Magazine, 2007,45(4):88-95.
  • 6Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003.27-34.
  • 7Akyildiz IF, Akan B, Chert C, Fang J, Su W. InterPlaNetary Intemet: State-of-the-Art and research challenges. Computer Networks, 2003,43(2):75-112.
  • 8Gupta P, Kumar P. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000,46(2):388-404.
  • 9Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 2002, 10(4):477-486.
  • 10Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proc. of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003. 233-244.

共引文献323

同被引文献21

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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