首页> 外文会议>Annual IEEE International Systems Conference >Game theoretic analysis for resource allocation in dynamic multi-hop networks with arbitration
【24h】

Game theoretic analysis for resource allocation in dynamic multi-hop networks with arbitration

机译:带有仲裁的动态多跳网络中资源分配的博弈分析

获取原文

摘要

A connection through a mobile node may not be available because of the greediness of selfish nodes. In this paper, we address the issue of dynamic packet forwarding by a set of wireless autonomous ad hoc nodes. Wireless nodes acting in a selfish manner try to use the resources of other nodes without their own participation. We model the dynamic packet forwarding problem as a negotiation game with an arbitrator. In our model, a group of mobile nodes requesting to forward packets negotiates with a mobile arbitrator until an agreement at least by simple majority is reached on a resource allocation. The mobile arbitrator submits offers to each mobile device in the group, and the mobile nodes decide to agree or disagree on the offer. The ultimate decision is made by simple majority. We investigate and solve the negotiation by finding the optimal Nash Equilibrium strategies of the game. We consider offers generated from Dirichlet's distribution for an ensemble of mobile devices over a finite and sporadic time limitation. The solution obtained from negotiation ensures that a mobile device always finds a peer or arbitrator to help forward packets and keep the network flowing. Mathematical proofs and MATLAB simulations support our model.
机译:由于自私节点的贪婪,可能无法通过移动节点进行连接。在本文中,我们通过一组无线自治ad hoc节点解决了动态数据包转发的问题。以自私的方式工作的无线节点尝试在没有其自身参与的情况下使用其他节点的资源。我们将动态数据包转发问题建模为与仲裁员的协商游戏。在我们的模型中,一组请求转发数据包的移动节点与移动仲裁器进行协商,直到至少达成简单多数的资源分配协议为止。移动仲裁员向组中的每个移动设备提交要约,并且移动节点决定同意或不同意要约。最终决定由简单多数决定。我们通过找到游戏的最佳纳什均衡策略来调查和解决协商问题。我们考虑了在有限且零星的时间限制内,Dirichlet的分销所产生的针对移动设备整体的报价。通过协商获得的解决方案可确保移动设备始终找到对等方或仲裁方来帮助转发数据包并保持网络畅通。数学证明和MATLAB仿真支持我们的模型。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号