期刊文献+

无线自组织网络路由开销控制的混合策略博弈

Mix Strategy Game for Routing Overhead Control in Wireless Ad-Hoc Networks
下载PDF
导出
摘要 为了在无线自组织网络中建立可用性和连续性更高的路由,路由发现过程中需要重复广播更多的路由请求(PREQ)分组,从而造成路由开销的明显增加,并严重制约了网络的可扩展性.针对以上问题,利用混合策略博弈对PREQ分组的转发过程进行建模,提出了一种基于混合策略博弈的路由开销控制算法,该算法在收到同一PREQ广播的邻居节点间进行博弈并由此决定各自转发PREQ的概率,在满足概率的情况下才可以继续广播收到的PREQ.仿真结果表明,提出的算法能够显著地减少路由开销,同时提高网络的整体性能. To increase the availability and the continuity of routes, nodes need to rebroadcast more RREQ packets during route discovery, hence routing overhead is increased and network scalability is limited. To release afore mentioned problem, the mix strategy game was used to model the rebroadcast of RREQ packets, then a mix strategy game-based routing overhead control algorithm was proposed. The algorithm received the same PREQ between neighboring nodes broadcast the game and thus the probability of each forwarded PREQ could be determined before they could continue to receive broadcast probability in the case of PREQ meet. The simulation results showed that the routing overhead could be reduced obviously, and the overall performance of network could be improved by the proposed routing overhead control algorithm.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2014年第5期659-662,共4页 Journal of Northeastern University(Natural Science)
基金 中央高校基本科研业务费专项资金资助项目(N110323007) 河南省自然科学基金资助项目(F2014501082)
关键词 无线自组织网络 路由开销控制 建模 混合策略博弈 仿真 wireless ad-hoc networks routing overhead control model mix strategy game simulation
  • 相关文献

参考文献15

  • 1Ghoutia L, Sheltamia T R, Alutaibi K S. Mobility prediction in mobile ad hoc networks using extreme learning machines [J]. Procedia Computer Science ,2013,19:305 - 312.
  • 2Song Q, Ning Z L, Wang S Q, et al. Link stability estimation based on link connectivity changes in mobile ad-hoc networks[ J ]. Journal of Network and Computer Applications, 2012, 35(6) :2051 -2058.
  • 3Sakhaee E, Taleb T, Jamalipour A, et al. A Novel scheme to reduce control overhead and increase link duration in highly mobile ad hoc networks [C ]//Proceedings of IEEE Wireless Communications and Networking Conference ( WCNC 2007 ). Hong Kong,2007:3972 - 3977.
  • 4Abedalmotaleb Z, Thomas F. Maintaining path stability with node failure in mobile ad hoc networks [ J ]. Procedia Computer Science,2013,19 : 1068 - 1073.
  • 5Yaser K, Ghadeer O, Munner B Y. Mobility and load aware routing protocol for ad hoc networks [ J ]. Journal of King Saud University-Computer and Information Sciences, 2011, 23(2) :105 -113.
  • 6Yen Y S, Chang H C, Chang R S, et al. Routing with adaptive path and limited flooding for mobile ad hoc networks [ J ]. Computers and Electrial Engineering, 2010,2 (36) :280 -290.
  • 7Mohammed A, Ould-Khaoua M, Mackenzie L M, et al. Dynamic probabilistic counter-based broadcasting in mobile ad hoc networks [ C]//Proceedings of 2nd International Confe- rence on Adaptive Science & Technology( ICAST 2009). Accra, 2009 : 120 - 127.
  • 8姬文江,马建峰,田有亮,马卓.无线mesh网中一种基于博弈论的公平性路由协议[J].通信学报,2012,33(11):17-23. 被引量:7
  • 9Jorge O, Ramon G J, Marfa C. Joint route selection and resource allocation in multihop wireless networks based on a game theoretic approach [J]. Ad Hoc Networks, 2013, 11 (8) :2203 -2216.
  • 10Chen X H, Xu J, Wei Y, et al. Channel assignment in heterogeneous multi-radio multi-channel wireless networks: a game theoretic approach [ J ]. Computer Networks, 2013,57 ( 17 ) :3291 - 3299.

二级参考文献33

  • 1李风华,吴建平,李贺武,陈荣第.基于竞争终端个数和跳数的802.11Mesh网络公平性优化机制[J].通信学报,2006,27(z1):159-163. 被引量:2
  • 2Shin M, Lee S, Kim Y. Distributed channel assignment for multi-radio wireless networks[ C ] //Pmc of Mobile Adhoc and Sensor Systems ( MASS' 06), IEEE, 2006:417 - 426.
  • 3Halldorsson M M, Halpern J Y, Li L E, et al. On spectrum sharing games [ C ] //Proc of the 23rd Annual ACM Symposium on Principles of Distributed Computing, Ser. PODC '0g, Newfoundland, Canada: ACM, 2004: 107 -114.
  • 4Yu Q, Chen J, Fan Y, et al. Multi-channel assignment in wireless sensor networks : A game theoretic approach [ C ] // Proc of INFOCOM' 10, San Diego, CA:IEEE, 2010:1 -9.
  • 5Xiao J, Xiong N, Yang L T, et al. A joint selfish routing and channel assignment game in wireless mesh networks [ J ]. Computer Communication, 2008, 31 ( 5 ) : 1447 - 1459.
  • 6Vallam R, Kanagasabapathy A, Murthy C. A non-cooperative game-theoretic approach to channel assignment in muhi- channel multi-radio wireless networks [ J ]. Wireless Networks, 2011, 17:411 -435.
  • 7Cheng H, Yang S. Joint multicast routing and channel assignment in muhiradio muhichannel wireless mesh networks using tabu search [ C ] //Proc of ICNC ' 09, 2009, 4:325 - 330.
  • 8Hui C, Yu S X. Joint QoS muhieast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods [ J ]. Applied Soft Computing, 2011, 11 (2) :1953 - 1964.
  • 9Raniwala A, Gopalan K, Chiueh T C. Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks [ J ]. SIGMOBILE Mobile Computing Communication Review, 2004, 8(4) :50-65.
  • 10Bakhshi B, Khorsandi S, Capone A. On-line joint QoS routing and channel assignment in multi-channel multi-radio wireless mesh networks [ J ]. Computer Communications, 2011,34( 11 ) :1342 - 1360.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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