首页> 外文会议>International Conference on Knowledge-Based Engineering and Innovation >Asymptotic close to optimal joint resource allocation and power control in the uplink of two-cell networks
【24h】

Asymptotic close to optimal joint resource allocation and power control in the uplink of two-cell networks

机译:两小区网络上行链路中渐近接近最优联合资源分配和功率控制

获取原文

摘要

In this paper, we investigate joint resource allocation and power control mechanisms for two-cell networks, where each cell has some sub-channels which should be allocated to some users. The main goal persuaded in the current work is finding the best power and sub-channel assignment strategies so that the associated sum-rate of network is maximized, while a minimum rate constraint is maintained by each user. The underlying optimization problem is a mixed integer non-linear problem which is not convex and does not yield a trivial solution. In this regard, to tackle the problem, using an approximate function which is quite tight at moderate to high signal to interference plus noise ratio (SINR) region, the problem is divided into two disjoint sub-channel assignment and power allocation problems. It is shown that having fixed the allocated power of each user, the sub-channel assignment can be thought as a well-known assignment problem which can be effectively solved using the so-called Hungarian method. Then, the power allocation is analytically derived. Furthermore, it is shown that the power can be chosen from two extremal points of the maximum available power or the minimum power satisfying the rate constraint. Numerical results demonstrate the superiority of the proposed approach over the random selection strategy as well as the method proposed in [3] which is regarded as the best known method addressed in the literature.
机译:在本文中,我们研究了两小区网络的联合资源分配和功率控制机制,其中每个小区都有一些子信道,应该将其分配给某些用户。在当前工作中说服的主要目标是找到最佳功率和子信道分配策略,以使关联的网络总速率最大化,而每个用户都保持最小速率约束。基本的优化问题是混合整数非线性问题,该问题不是凸的,并且不会产生平凡的解决方案。在这方面,为了解决该问题,使用在中等到较高的信干噪比(SINR)区域中非常紧密的近似函数,将该问题分为两个不相交的子信道分配和功率分配问题。示出了,在固定每个用户的分配功率之后,可以将子信道分配视为众所周知的分配问题,可以使用所谓的匈牙利方法来有效地解决该子信道分配问题。然后,分析得出功率分配。此外,示出了可以从满足速率约束的最大可用功率或最小功率的两个极值点中选择功率。数值结果表明,所提出的方法优于随机选择策略以及文献[3]中提出的方法,后者被认为是文献中最著名的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号