期刊文献+

WMNs中基于重复博弈的机会路由激励机制研究 被引量:5

Research on opportunitstic routing incentive mechanism based on repeated game in WMNs
在线阅读 下载PDF
导出
摘要 无线Mesh网中虽然有固定节点,但是其中大量的移动节点仍然有能源、带宽、内存等限制。在机会路由协议中,数据包从源节点至目的节点,需要中继节点机会性地转发;但由于节点自身条件的原因,节点行为往往趋向于自私,不愿接受转发请求。节点不合作行为中的自私性是导致网络吞吐量随之下降的主要原因之一。针对该问题,提出邻居节点合作度评估函数的概念,并建立基于合作度评估函数的宽容针锋相对策略节点重复博弈模型(CGTFT)。仿真表明,该模型可以有效抑制自私,激励节点合作,提高网络吞吐量。 Wireless mesh networks have fixed nodes,but a large number of mobile nodes still have energy,bandwidth,memory,and other restrictions.In opportunistic routing protocols,data packets from source nodes to destination nodes,need to be forwarded by relay nodes opportunistically.However,due to node restrictions itself,nodes are often reluctant to accept the forward request.Selfishness in non-cooperation among nodes is the main reason for the decrease of network throughput.To solve this problem,the concept of cooperation degree evaluation function is proposed.And a repeated game model of CGTFT strategy nodes based on evaluation function of cooperation is established.The simulation result shows that the model can effectively suppress selfishness and incentive cooperation and improve networks throughput.
作者 吴军 莫伟伟 印新棋 白光伟 WU Jun;MO Weiwei;YIN Xinqi;BAI Guangwei(School of Computer Science and Technology,Nanjing Technology University,Nanjing 211816,China)
出处 《计算机工程与应用》 CSCD 北大核心 2018年第10期110-114,共5页 Computer Engineering and Applications
基金 国家自然科学基金(No.60673185 No.61073197)
关键词 无线Mesh网(WMNs) 机会路由 重复博弈 合作度评估函数 激励机制 Wireless Mesh Networks(WMNs) opportunistic routing repeat game cooperation evaluation function incentive mechanisms
作者简介 吴军(1962—),男,高级工程师,硕士生导师,CCF会员,主要研究方向为网络安全、可信计算、信息系统安全等。;莫伟伟(1991—),男,通讯作者,硕士研究生,研究方向主要为无线mesh网、网络安全、机会路由等,E-mail:moweiwei8@qq.com。;印新棋(1992—),男,硕士研究生,主要研究方向为无线mesh网,机会路由等。
  • 相关文献

参考文献2

二级参考文献52

  • 1Zhang Z.Routing in intermittently connected mobile ad hoc networks and delay tolerant networks:Overview and challenges.IEEE Communications Surveys & Tutorials,2006,8(1):24-37.[doi:10.1109/COMST.2006.323440].
  • 2Perkins C,Royer E.Ad-Hoc on-demand distance vector routing.In:Proc.of the IEEE WMCSA'99.Washington:IEEE Computer Society Press,1999.90-100.[doi:10.1109/MCSA.1999.749281].
  • 3Intanagonwiwat C,Govindan R,Estrin D.Directed diffusion:A scalable and robust communication paradigm for sensor networks.In:Proc.of the ACM MobiCom 2000.New York:ACM Press,2000.56-67.[doi:10.1145/345910.345920].
  • 4Biswas S,Morris R.Opportunistic routing in multihop wireless networks.ACM SIGCOMM Computer Communication Review,2004,34(1):69-74.[doi:10.1145/972374.972387].
  • 5Biswas S,Morris R.ExOR:Opportunistic routing in multi-hop wireless networks.In:Proc.of the ACM SIGCOMM 2005.New York:ACM Press,2005.133-143.http://www.sigcomm.org/sigcomm2005/paper-BisMor.pdf.
  • 6Rozner E,Seshadri J,Mehta Y,Qiu L.Simple opportunistic routing protocol for wireless mesh networks.In:Proc.of the IEEE WiMesh 2006.Washington:IEEE Computer Society Press,2006.48-54.[doi:10.1109/WIMESH.2006.288602].
  • 7Westphal C.Opportunistic routing in dynamic ad hoc networks:The OPRAH protocol.In:Proc.of the IEEE MASS 2006.Washington:IEEE Computer Society Press,2006.570-573.[doi:10.1109/MOBHOC.2006.278612].
  • 8Couto DD,Aguayo D,Bicket J,Morris R.A high-throughput path metric for multi-hop wireless routing.In:Proc.of the ACM/ IEEE MobiCom 2003.Washington:IEEE Computer Society Press,2003.134-146.[doi:10.1145/938985.939000].
  • 9Chachulski S,Jennings M,Katti S,Katabi D.Trading structure for randomness in wireless opportunistic routing.In:Proc.of the ACM SIGCOMM 2007.New York:ACM Press,2007.169-180.[doi:10.1145/1282427.1282400].
  • 10Zorzi M,Rao RR.Geographic random forwarding (GeRaF) for ad hoc and sensor networks:Multihop performance.IEEE Trans.on Mobile Computing,2003,2(4):337-348.[doi:10.1109/TMC.2003.1255648].

共引文献36

同被引文献15

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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