Backhaul-Constrained HetNets翻译
时间: 2024-04-22 20:26:33 浏览: 26
"Backhaul-Constrained HetNets" 可以翻译为 "受限背靠背异构网络"。其中,“Backhaul”表示背靠背,指的是网络中后端传输资源有限的情况;"Constrained"表示受限,指的是资源受到限制;"HetNets"是Heterogeneous Networks的缩写,表示异构网络。因此,整个短语描述了一个具有有限背靠背传输资源的异构网络。
相关问题
As illustrated in Fig. 1, we consider the general layout of HetNets, where each macro-BS serves multiple UE devices and contains a few backhaul-constrained small BSs within its range. Since the small BSs are backhaul-constrained, when UEs are offloaded to a small BS, the small BS may be overloaded when the number of serving UE devices exceeds its capacity (e.g., the small BS identified by the dotted line in Fig. 1). In this scenario, the overloaded small BS cannot provide the serving UEs with the expected QoS. Therefore, the backhaul capacity must be considered as a limitation in the design of the user association algorithm.翻译
如1所示,我们考虑HetNets的一般布局,其中每个宏基站为多个UE设备提供服务,并在其范围内包含一些受后向链路限制的小型基站。由于小型基站受到后向链路的限制,当UE设备被离载到小型基站时,当服务的UE设备数量超过其容量时(例如,图1中由虚线标识的小型基站),小型基站可能会超载。在这种情况下,超载的小型基站无法为服务的UE设备提供预期的QoS。因此,在设计用户关联算法时必须考虑后向链路容量作为限制因素。
Abstract—In heterogeneous networks (HetNets), user association approaches should be able to achieve load balancing among base stations (BSs). This paper investigates the joint optimization of user association and resource allocation in Backhaul-constrained HetNets for capacity enhancements. We consider two major limitations in HetNets: the backhaul bottleneck of BSs and the capability of user equipment (UE). We establish a framework based on a multi-leader multi-follower Stackelberg game, in which resource allocation is formulated as a follower-level game and user association is cast as a leader-level game. Because of the backhaul bottleneck of small BSs, the given preference order of users renders the final association result unstable. Thus, the resident-oriented GaleShapley (GS) algorithm is included in the proposed framework to obtain a stable single-BS association. Furthermore, congestion factors are introduced to reflect the relative backhaul congestion degrees of BSs, which enables load balancing among the small BSs in the proposed algorithm. The study considers user association and resource allocation with and without limitations on the number of serving users for small BSs in HetNets. Extensive simulation results suggest that the proposed algorithm can adaptively respond to a wide variety of network situations.中文
在异构网络(HetNets)中,用户关联方法应该能够实现基站(BS)之间的负载平衡。本文研究了在受限于回程链路的HetNets中,用户关联和资源分配的联合优化问题,以增强系统容量。我们考虑了HetNets中的两个主要限制:BS的回程瓶颈和用户设备(UE)的能力。我们建立了一个基于多领导者-多追随者Stackelberg博弈的框架,其中资源分配被形式化为追随者级别的博弈,用户关联被视为领导者级别的博弈。由于小型BS的回程瓶颈,给定的用户优先顺序导致最终关联结果不稳定。因此,该提出的框架中包括了面向居民的Gale-Shapley(GS)算法,以获得稳定的单BS关联。此外,引入了拥塞因子来反映BS的相对回程拥塞程度,从而实现了提出算法中小型BS之间的负载平衡。本研究考虑了HetNets中限制小型BS服务用户数量和不限制的用户关联和资源分配。广泛的仿真结果表明,该提出的算法能够适应各种网络情况。
相关推荐
![docx](https://img-home.csdnimg.cn/images/20210720083331.png)
![.pdf](https://img-home.csdnimg.cn/images/20210720083646.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![gz](https://img-home.csdnimg.cn/images/20210720083447.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)