首页> 外文会议>IEEE Global Communications Conference >A game theoretic approach to minimize the completion time of network coded cooperative data exchange
【24h】

A game theoretic approach to minimize the completion time of network coded cooperative data exchange

机译:一种博弈论的方法来最小化网络编码的协作数据交换的完成时间

获取原文

摘要

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. We further show that our distributed solution achieves the centralized solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.
机译:在本文中,我们介绍了一个博弈论框架,用于研究在分散无线网络中最小化用于协作数据交换(CDE)的即时可解码网络编码(IDNC)的完成时间的问题。在此配置中,客户端无需中央控制器即可相互协作以恢复已擦除的数据包。博弈论在本文中被用作通过克服对系统中的中央控制器或附加信令的需求来改进分布式解决方案的工具。我们通过不合作的潜在游戏中的自私玩家对会话进行建模。效用函数经过设计,使得增加个人收益会导致集体行为,从而在共享网络环境中实现理想的系统性能,并实现帕累托最优解决方案。我们进一步表明,我们的分布式解决方案实现了集中式解决方案。通过广泛的仿真,我们的方法与常规点对多点(PMP)恢复过程中可以找到的最佳性能进行了比较。数值结果表明,在大多数实际情况下,我们的公式大大优于传统的PMP方案,并实现了较低的延迟。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号