Abstract Energy-efficient game-theoretical random access for M2M communications in overlapped cellular networks
首页> 外文期刊>Computer networks >Energy-efficient game-theoretical random access for M2M communications in overlapped cellular networks
【24h】

Energy-efficient game-theoretical random access for M2M communications in overlapped cellular networks

机译:重叠蜂窝网络中用于M2M通信的高能效游戏理论随机访问

获取原文
获取原文并翻译 | 示例
           

摘要

AbstractThe unprecedented growth of machine-to-machine (M2M) devices has brought a heavy burden to traditional cellular networks. In this paper, we focus on the overload problem caused by massive connections of M2M devices in overlapped cellular networks. We formulate the joint base station (BS) selection and power allocation optimization problem for each M2M device as a noncooperative access game. The utility function of each M2M device is described as the success probability of random access weighted by the energy efficiency (EE). We propose an iterative energy-efficient game-theoretical random access algorithm, in which each M2M device searches its optimal strategies in turn until no M2M device is able to improve its individual utility with a unilateral deviation. Numerical results demonstrate that significant performance enhancements on both the delay and energy consumption can be achieved simultaneously.
机译: 摘要 机器对机器(M2M)设备的空前增长为传统的蜂窝网络带来了沉重的负担。在本文中,我们重点研究由重叠蜂窝网络中的M2M设备大量连接引起的过载问题。我们将每个M2M设备的联合基站(BS)选择和功率分配优化问题公式化为非合作访问游戏。每个M2M设备的效用函数被描述为以能量效率(EE)加权的随机访问成功概率。我们提出了一种迭代的,高能效的博弈论随机访问算法,其中每个M2M设备依次搜索其最佳策略,直到没有M2M设备能够以单边偏差提高其个人效用。数值结果表明,可以同时在延迟和能耗方面实现显着的性能提升。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号