首页> 外文会议>ICWN'10;International conference on wireless networks;WORLDCOMP' 10 >Stochastic Game Theoretical Model for Packet Forwarding in Reliable Relay Networks
【24h】

Stochastic Game Theoretical Model for Packet Forwarding in Reliable Relay Networks

机译:可靠中继网络中分组转发的随机博弈理论模型

获取原文

摘要

In this article, a relay system consisting of a source, a relay, and a destination node operating on a common channel is considered. Both source and relay nodes generate packets independently with a constant rate. Two separate buffers are assigned to the relay node to keep received and internally generated packets. Retransmission mechanism is utilized to assure that all packets delivered to the destination successfully. A new Markovian stationary game theoretical model with two players is introduced to model the competition between source and relay nodes. Both source and relay nodes try to access a common channel in order to maximize the system overall throughput. Nash equilibrium strategy for non-cooperative scenario is adopted. Numerical results are provided to demonstrate the best strategy of players and their achievable utility in different conditions. Simulation results show that performance of the proposed system asymptotically approaches the cooperative system performance. In contrary to the cooperative system, in the proposed model nodes do not require to know other players' strategy in each time slot. Therefore, this model is an appropriate solution to apply in practical Ad-hoc networks.
机译:在本文中,将考虑由在公共通道上运行的源,中继和目标节点组成的中继系统。源节点和中继节点均独立地以恒定速率生成数据包。两个单独的缓冲区分配给中继节点,以保留接收到的和内部生成的数据包。重传机制用于确保所有数据包都成功传递到目的地。引入了一个新的具有两个参与者的马尔可夫平稳博弈理论模型,以对源节点和中继节点之间的竞争进行建模。源节点和中继节点都尝试访问公共信道,以使系统的总体吞吐量最大化。非合作场景采用纳什均衡策略。提供了数值结果,以证明玩家的最佳策略及其在不同条件下可实现的效用。仿真结果表明,所提出系统的性能渐近逼近协同系统的性能。与合作系统相反,在提出的模型中,节点不需要在每个时隙中知道其他参与者的策略。因此,此模型是适用于实际Ad-hoc网络的合适解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号