首页> 外文期刊>IEEE transactions on mobile computing >Location Aware Opportunistic Bandwidth Sharing between Static and Mobile Users with Stochastic Learning in Cellular Networks
【24h】

Location Aware Opportunistic Bandwidth Sharing between Static and Mobile Users with Stochastic Learning in Cellular Networks

机译:蜂窝网络中具有随机学习功能的静态和移动用户之间的位置感知机会带宽共享

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

摘要

In this paper, we consider the problem of location-dependent opportunistic bandwidth sharing between static and mobile (i.e., moving) downlink users in a cellular network. Each cell of the network has some fixed number of static users. Mobile users enter the cell, move inside the cell for some time, and then leave the cell. In order to provide higher data rate to the highly mobile users whose fast fading channel variation is difficult to track, we propose location dependent bandwidth sharing between the two classes of static and mobile users; the idea is to provide higher bandwidth to the mobile users at favourable locations, and provide higher bandwidth to the static users in other times. Our approach is agnostic to the way the bandwidth is further shared within the same class of users; it can be combined with any particular bandwidth allocation policy employed for one of these two classes of users. We formulate the problem as a long run average reward Markov decision process (MDP) where the per-step reward is a linear combination of instantaneous data volumes received by static and mobile users, and find the optimal policy. The optimal policy is binary in nature; it allocates the entire bandwidth either to the static users or to the mobile users at any given time. The reward structure of this MDP is not known in general, and it may change with time. To alleviate these issues, we propose a learning algorithm based on single timescale stochastic approximation. Also, noting that the MDP problem can be used to maximize the long run average data rate for mobile users subject to a constraint on the long run average data rate of static users, we provide a learning algorithm based on multi-timescale stochastic approximation. We prove asymptotic convergence of the bandwidth sharing policies under these learning algorithms to the optimal policy. The results are extended to address the issue of fair bandwidth sharing between the two classes of static and mobile users, where the notion of fairness is motivated by the popular notion of a-fairness in the literature. Numerical results exhibit significant performance improvement by our scheme, as well as fast convergence, and also demonstrate the trade-off between performance gain and fairness requirement.
机译:在本文中,我们考虑了蜂窝网络中静态和移动(即移动)下行链路用户之间位置相关的机会带宽共享问题。网络的每个单元都有一定数量的静态用户。移动用户进入该单元,在该单元内移动一段时间,然后离开该单元。为了向难以跟踪快速衰落信道变化的高度移动用户提供更高的数据速率,我们建议在静态和移动用户两类之间共享与位置有关的带宽。这个想法是在合适的位置为移动用户提供更高的带宽,而在其他时间为静态用户提供更高的带宽。我们的方法与在同一类用户中进一步共享带宽的方式无关。它可以与用于这两种用户之一的任何特定带宽分配策略结合使用。我们将问题表述为长期平均奖励马尔可夫决策过程(MDP),其中,每步奖励是静态和移动用户收到的瞬时数据量的线性组合,并找到最佳策略。最佳策略本质上是二进制的。它在任何给定时间将整个带宽分配给静态用户或移动用户。此MDP的奖励结构通常是未知的,并且可能随时间而变化。为了缓解这些问题,我们提出了一种基于单时标随机逼近的学习算法。另外,注意到MDP问题可用于最大化移动用户的长期平均数据速率,而这受静态用户长期平均数据速率的约束,我们提供了一种基于多时间尺度随机逼近的学习算法。我们证明了在这些学习算法下带宽共享策略向最优策略的渐近收敛。结果扩展到解决静态和移动用户两类之间公平带宽共享的问题,其中公平概念是由文献中流行的非公平概念推动的。数值结果表明,通过我们的方案,性能得到了显着改善,并且收敛速度很快,并且还证明了性能增益与公平性要求之间的权衡。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号