首页> 外文会议>International Conference on Computer and Information Applications >Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks
【24h】

Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks

机译:基于博弈论的无线多跳网络路由算法

获取原文

摘要

In wireless multi-hop networks, the quality of service provided by the system heavily depends on the cooperation between nodes. However, nodes are reluctant to cooperate with each other to save their limited resources. This tendency will put a limit on the application of the current wireless multi-hop networks. Therefore, game theory, which can analyze the strategic interactions among autonomous decision makers, becomes an ideal candidate to solve the above problem. In this paper, we first introduce the basic concept of game theory. Then, the game-theory-based routing algorithms for wireless multi-hop networks are investigated in detail and their characteristics are compared. Finally, we give the future research directions and concluding remarks.
机译:在无线多跳网络中,系统提供的服务质量大量取决于节点之间的合作。然而,节点不愿意彼此合作,以节省他们有限的资源。这种趋势将限制当前无线多跳网络的应用。因此,可以分析自治决策者之间的战略互动的博弈论成为解决上述问题的理想候选者。在本文中,我们首先介绍了博弈论的基本概念。然后,详细研究了用于无线多跳网络的基于游戏理论的路由算法,并比较它们的特性。最后,我们给出了未来的研究方向和结论性的评论。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号