首页> 外文会议>International conference on machine learning for networking >Reinforcement Learning Based Routing Protocols Analysis for Mobile Ad-Hoc Networks Global Routing Versus Local Routing
【24h】

Reinforcement Learning Based Routing Protocols Analysis for Mobile Ad-Hoc Networks Global Routing Versus Local Routing

机译:基于增强学习的移动Ad-Hoc网络路由协议分析全局路由与本地路由

获取原文

摘要

Energy consumption and maximize lifetime routing in Mobile Ad hoc Network (MANETs) is one of the most important issues. In our paper, we compare a global routing approach with a local routing approach both using reinforcement learning to maximize lifetime routing. We first propose a global routing algorithm based on reinforcement learning algorithm called Q-learning then we compare his results with a local routing algorithm called AODV-SARSA. Average delivery ratio. End to end delay and Time to Half Energy Depletion are used like metrics to compare both approach.
机译:移动自组织网络(MANET)中的能耗和最大化的生命周期路由是最重要的问题之一。在我们的论文中,我们比较了全局路由方法和局部路由方法,这两种方法都使用强化学习来最大化生命周期路由。我们首先提出一种基于强化学习算法的全局路由算法,该算法称为Q学习,然后将其结果与一种称为AODV-SARSA的局部路由算法进行比较。平均交付率。像度量一样使用端到端延迟和能量消耗一半时间来比较这两种方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号