CN110012509A - A resource allocation method based on user mobility in 5G small cell network - Google Patents
A resource allocation method based on user mobility in 5G small cell network Download PDFInfo
- Publication number
- CN110012509A CN110012509A CN201910290485.5A CN201910290485A CN110012509A CN 110012509 A CN110012509 A CN 110012509A CN 201910290485 A CN201910290485 A CN 201910290485A CN 110012509 A CN110012509 A CN 110012509A
- Authority
- CN
- China
- Prior art keywords
- user
- network
- gnb
- resource allocation
- virtual cell
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000013468 resource allocation Methods 0.000 title claims abstract description 40
- 230000005540 biological transmission Effects 0.000 claims abstract description 49
- 238000005457 optimization Methods 0.000 claims abstract description 38
- 238000004891 communication Methods 0.000 claims abstract description 11
- 230000008569 process Effects 0.000 claims description 10
- 238000005259 measurement Methods 0.000 claims description 6
- 230000011664 signaling Effects 0.000 claims description 5
- 230000008859 change Effects 0.000 claims description 3
- 230000003993 interaction Effects 0.000 claims description 2
- 238000012935 Averaging Methods 0.000 claims 1
- 238000010295 mobile communication Methods 0.000 abstract description 2
- 239000011159 matrix material Substances 0.000 description 11
- 238000010586 diagram Methods 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 241000854291 Dianthus carthusianorum Species 0.000 description 1
- 206010062519 Poor quality sleep Diseases 0.000 description 1
- 230000003321 amplification Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000023402 cell communication Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003199 nucleic acid amplification method Methods 0.000 description 1
- 230000035755 proliferation Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明涉及一种5G小蜂窝网络中基于用户移动性的资源分配方法,属于移动通信技术领域。首先,针对小蜂窝网络中严重的干扰问题,当非激活用户通过寻呼成功接入网络后,本发明通过建立以用户为中心的虚拟小区,有效减少用户通信干扰问题。用户在虚拟小区中移动的过程中没有发生切换,保证业务的连续性。其次,为了提高资源利用率,基于Lyapunov优化方法,实现网络平均能量效率最大化。本发明充分考虑用户数据包队列长度和信道质量,将最大化网络的平均能量效率问题分解为用户最优传输资源分配和最优功率分配两个子问题求解。通过对网络资源的优化分配,提升传输质量,并且实现了在最大化系统平均能量效率的同时保证系统队列的稳定性。
The invention relates to a resource allocation method based on user mobility in a 5G small cell network, and belongs to the technical field of mobile communication. First, in view of the serious interference problem in the small cell network, after the inactive user successfully accesses the network through paging, the present invention effectively reduces the user communication interference problem by establishing a user-centered virtual cell. No handover occurs when the user moves in the virtual cell, which ensures service continuity. Secondly, in order to improve resource utilization, based on the Lyapunov optimization method, the average energy efficiency of the network is maximized. The invention fully considers the user data packet queue length and channel quality, and decomposes the problem of maximizing the average energy efficiency of the network into two sub-problems of user optimal transmission resource allocation and optimal power allocation to solve. Through the optimal allocation of network resources, the transmission quality is improved, and the stability of the system queue is ensured while maximizing the average energy efficiency of the system.
Description
技术领域technical field
本发明属于移动通信技术领域,涉及一种5G小蜂窝网络中基于用户移动性的资源分配方法。The invention belongs to the technical field of mobile communication, and relates to a resource allocation method based on user mobility in a 5G small cell network.
背景技术Background technique
随着物联网和大规模机器类的发展,网络中智能终端和各种用户设备激增,使得5G通信系统面临前所未有的巨大数据流量需求挑战。为了应对日益巨增的数据业务和有效提升系统容量需求,超密集小蜂窝网络应运而生。5G小蜂窝网络具有低成本、低功耗、可自组织和自优化的特点,同时其密集覆盖能解决高校和商业区等用户密集区域指数式增长的数据流量需求,提高网络容量,扩大无线网络的覆盖范围。此外,由于用户数激增,为节省功率消耗,当没有数据收发时,将用户转换为轻度休眠的非激活(Inactive)状态。为了提高寻呼效率,Inactive状态的用户将配置一个位置跟踪区域称为无线接入网通知区域(RANNotification Area,RNA),当网络中有数据传输需求时,会通过RNA寻呼用户。然而,在密集部署小蜂窝时,也面临许多问题:With the development of the Internet of Things and large-scale machines, the proliferation of intelligent terminals and various user equipment in the network makes the 5G communication system face the unprecedented challenge of huge data traffic demand. In order to cope with the ever-increasing demand for data services and effectively increase system capacity, ultra-dense small cell networks emerge as the times require. The 5G small cell network has the characteristics of low cost, low power consumption, self-organization and self-optimization. At the same time, its dense coverage can meet the exponential growth of data traffic demand in dense user areas such as universities and commercial areas, improve network capacity, and expand wireless networks. coverage. In addition, due to the surge in the number of users, in order to save power consumption, when there is no data transmission and reception, the user is converted to an inactive (Inactive) state of light sleep. In order to improve the paging efficiency, the users in the Inactive state will configure a location tracking area called the Radio Access Network Notification Area (RAN Notification Area, RNA). However, when small cells are densely deployed, there are also many problems:
(1)小蜂窝通信覆盖范围小,当用户移动时很容易离开服务小区的覆盖范围并频繁切换为其服务的基站,从而产生大量切换信令开销。(1) The small cell communication coverage is small, and when the user moves, it is easy to leave the coverage of the serving cell and frequently switch to the base station serving it, thereby generating a large amount of switching signaling overhead.
(2)小蜂窝基站的超密集部署使得小区重叠覆盖,大量用户都将处于多个小区重叠的边缘,受到严重小区间干扰,并且极其容易发生乒乓效应。(2) The ultra-dense deployment of small cell base stations results in overlapping coverage of cells, and a large number of users will be on the edge of overlapping multiple cells, suffer severe inter-cell interference, and are extremely prone to the ping-pong effect.
针对问题(1),现有研究中通过将小蜂窝基站分簇,簇中用户的数据平面层和控制平面层分离,控制平面由簇头连接,用户在簇中移动不会发生切换,从而减少用户因频繁切换产生的信令开销。In view of problem (1), in existing research, by clustering small cell base stations, the data plane layer and control plane layer of users in the cluster are separated, and the control plane is connected by the cluster head. Signaling overhead due to frequent handovers.
针对问题(2),现有研究中解决小蜂窝同频干扰问题的代表性技术主要有小区间干扰协调技术(Inter-Cell Interference Coordination,ICIC)和多点协作传输技术(Coordinated Multiple Point,CoMP)。ICIC技术通过对频率资源进行划分,相邻小区使用不同的频率来实现对干扰的控制,而CoMP技术则将小蜂窝分为不同的CoMP组,在一个CoMP组内通过多个小区协作来消除小区间干扰。For problem (2), the representative technologies for solving the problem of co-channel interference in small cells in the existing research mainly include Inter-Cell Interference Coordination (ICIC) and Coordinated Multiple Point (CoMP) technology. . ICIC technology divides frequency resources, and adjacent cells use different frequencies to control interference, while CoMP technology divides small cells into different CoMP groups, and eliminates cells by cooperating with multiple cells in a CoMP group. Interference.
针对5G小蜂窝网络中面临的挑战,传统的以基站为中心的网络架构已经不能满足5G用户通信需求。为了积极应对这些挑战,减少小区间干扰并提升用户体验,5G提出了以用户为中心的小区虚拟化技术,即围绕用户周围的多个实体小区组成一个虚拟小区,虚拟小区内传输节点间通过协作的方式为用户提供通信服务。以用户为中心的虚拟小区可消除边缘用户,缓解超密集部署小蜂窝网络中的干扰,同时减少用户移动切换信令开销,改善通信质量,提升网络用户体验。In view of the challenges faced in 5G small cell networks, the traditional base station-centric network architecture can no longer meet the communication needs of 5G users. In order to actively cope with these challenges, reduce inter-cell interference and improve user experience, 5G proposes a user-centric cell virtualization technology, that is, a virtual cell is formed around multiple physical cells around the user, and the transmission nodes in the virtual cell cooperate through cooperation. provide communication services to users. User-centric virtual cells can eliminate edge users, alleviate interference in ultra-densely deployed small cell networks, reduce user mobile handover signaling overhead, improve communication quality, and enhance network user experience.
综上所述,本发明为解决5G小蜂窝网络中移动用户的业务连续性和干扰问题,提出了一种5G小蜂窝网络中基于用户移动性的资源分配方案。为缓解密集小蜂窝网络中的干扰问题,保证移动用户业务连续性,建立以用户为中心的虚拟小区,虚拟小区内传输节点间协作为用户提供通信服务。此外,为了优化网络资源,提高资源利用率,本发明基于Lyapunov优化理论,考虑用户数据队列稳定性,将整体网络平均能量效率优化问题,转换为用户最优传输资源分配和最优功率分配两个子问题,在最大化系统平均能量效率的同时保证系统队列的稳定。To sum up, the present invention proposes a resource allocation scheme based on user mobility in a 5G small cell network in order to solve the problem of service continuity and interference of mobile users in a 5G small cell network. In order to alleviate the interference problem in the dense small cell network and ensure the service continuity of mobile users, a user-centered virtual cell is established, and the transmission nodes in the virtual cell cooperate to provide communication services for users. In addition, in order to optimize network resources and improve resource utilization, the present invention, based on Lyapunov optimization theory, considers the stability of user data queues, and converts the overall network average energy efficiency optimization problem into two subsections: optimal transmission resource allocation and optimal power allocation for users. The problem is to ensure the stability of the system queue while maximizing the average energy efficiency of the system.
发明内容SUMMARY OF THE INVENTION
有鉴于此,本发明的目的在于提供一种5G小蜂窝网络中基于用户移动性的资源分配方法。1)为缓解密集小蜂窝网络中的干扰问题,保证移动用户业务连续性,建立以用户为中心的虚拟小区,虚拟小区内传输节点间协作为用户提供通信服务。2)其次,为了提高资源利用率,优化网络资源,采用Lyapunov优化方法,充分考虑用户数据包队列长度和信道质量,实现网络平均能量效率最大化。In view of this, the purpose of the present invention is to provide a resource allocation method based on user mobility in a 5G small cell network. 1) In order to alleviate the interference problem in the dense small cell network and ensure the service continuity of mobile users, a user-centered virtual cell is established, and the transmission nodes in the virtual cell cooperate to provide communication services for users. 2) Secondly, in order to improve resource utilization and optimize network resources, Lyapunov optimization method is adopted, which fully considers the queue length and channel quality of user data packets to maximize the average energy efficiency of the network.
为达到上述目的,本发明提供如下技术方法:For achieving the above object, the present invention provides following technical method:
一种5G小蜂窝网络中基于用户移动性的资源分配方法,该方法根据所提网络场景的特性,首先,在用户接入网络后建立以用户为中心的虚拟小区,减少小区间干扰并保证移动用户的业务连续性;其次,在用户传输数据时对网络资源进行优化分配;A resource allocation method based on user mobility in a 5G small cell network. According to the characteristics of the proposed network scenario, firstly, a user-centric virtual cell is established after the user accesses the network to reduce inter-cell interference and ensure mobility. business continuity for users; secondly, optimal allocation of network resources when users transmit data;
该方法包括以下步骤:The method includes the following steps:
S1:非激活Inactive用户有数据业务到达时,通过网络寻呼接入网络;S1: When a data service arrives for an inactive Inactive user, it accesses the network through network paging;
S2:用户接入网络后建立以用户为中心的虚拟小区;S2: After the user accesses the network, a user-centric virtual cell is established;
S3:用户传输数据时对网络资源进行优化分配。S3: Optimizing allocation of network resources when the user transmits data.
进一步,在所述步骤S1中,当网络中有非激活Inactive用户数据包到达时,为定位用户,锚点gNB将发起寻呼过程;用户收到寻呼消息后通过当前驻留的gNB转换为连接状态,接入网络。Further, in the step S1, when there is an inactive Inactive user data packet in the network, in order to locate the user, the anchor gNB will initiate a paging process; after the user receives the paging message, it is converted to Connection status, access to the network.
进一步,在所述步骤S2中,建立以用户为中心的虚拟小区分为以下三个步骤:Further, in the step S2, establishing a user-centered virtual cell is divided into the following three steps:
S21:用户接入网络后,将用户之前处于非激活状态时的无线接入网通知区域RNA作为候选虚拟小区,用户检测RNA中所有gNB的参考信号RS强度并将测量结果上报至用户当前驻留的gNB;S21: After the user accesses the network, the radio access network notification area RNA when the user was in an inactive state is used as a candidate virtual cell, the user detects the RS strengths of all gNBs in the RNA and reports the measurement results to the user's current residence gNB;
S22:用户当前驻留gNB根据测量结果将RS大于阈值的gNB上报至锚点gNB,锚点gNB根据负载信息库,确定组建虚拟小区的gNB并将结果及虚拟小区配置信息下发给用户当前驻留的gNB;S22: The gNB that the user currently resides on reports the gNB whose RS is greater than the threshold value to the anchor gNB according to the measurement result, and the anchor gNB determines the gNB that forms the virtual cell according to the load information base, and delivers the result and the configuration information of the virtual cell to the user's current resident gNB gNB left;
S23:用户当前驻留的gNB将虚拟小区配置信息分别发送给用户和相应的gNB构建以用户为中心的虚拟小区,虚拟小区内传输节点间通过协作的方式为用户提供通信服务。S23: The gNB that the user currently resides on sends the virtual cell configuration information to the user and the corresponding gNB respectively to construct a user-centered virtual cell, and the transmission nodes in the virtual cell provide communication services for the user in a cooperative manner.
进一步,在所述步骤S3中,根据用户数据包队列长度和信道质量,采用基于Lyapunov的优化方法,建立以最大化网络的时间平均能量效率为目标的资源分配优化目标。Further, in the step S3, according to the user data packet queue length and channel quality, a Lyapunov-based optimization method is used to establish a resource allocation optimization objective aiming at maximizing the time-averaged energy efficiency of the network.
进一步,在所述步骤S1中,用户处于Inactive状态时,用户与网络的连接断开,并有一个用于寻呼过程时定位用户位置的通知区域RNA。Further, in the step S1, when the user is in the Inactive state, the connection between the user and the network is disconnected, and there is a notification area RNA for locating the user's position during the paging process.
进一步,在所述步骤S2中,由于用户的移动性,以用户为中心的虚拟小区所包含的gNB将发生动态变化;随着用户的移动,将添加满足条件的新gNB,且移除不满足条件的原有gNB;由于用户在移动的过程中没有发生切换,虚拟小区识别号不变;网络中锚点gNB控制用户虚拟小区动态调整,以减少密集小蜂窝基站网络中频繁的信令交互。Further, in the step S2, due to the mobility of the user, the gNBs included in the user-centered virtual cell will change dynamically; as the user moves, new gNBs that meet the conditions will be added, and those that do not meet the requirements will be removed. The original gNB of the conditions; because the user does not switch during the process of moving, the virtual cell identification number does not change; the anchor gNB in the network controls the dynamic adjustment of the user's virtual cell to reduce frequent signaling interactions in the dense small cell base station network.
进一步,在所述步骤S3中,通过系统时间平均能量效率来衡量虚拟小区系统的性能,系统时间平均能量效率定义为时间平均总数据数率与时间平均总功率消耗的比值。Further, in the step S3, the performance of the virtual cell system is measured by the system time-averaged energy efficiency, which is defined as the ratio of the time-averaged total data rate to the time-averaged total power consumption.
进一步,在所述步骤S3中,以最大化系统的时间平均能量效率为优化目标,且约束条件中具有与时间平均有关的约束条件,利用Lyapunov优化理论将其转换为每一时隙的优化问题;通过最小化Lyapunov偏移函数与惩罚项之和的上界来进行最优资源分配,从而在系统队列稳定性和时间平均的能量效率之间实现平衡。Further, in the step S3, the optimization objective is to maximize the time-averaged energy efficiency of the system, and there are constraints related to the time-averaged constraints in the constraints, and the Lyapunov optimization theory is used to convert it into an optimization problem for each time slot; Optimal resource allocation is performed by minimizing the upper bound of the sum of the Lyapunov offset function and the penalty term, thus achieving a balance between system queue stability and time-averaged energy efficiency.
进一步,在所述步骤S3中,为降低问题的求解复杂度,将最大化每一时隙内的能量效率优化问题分解成两个等价的子优化问题:1)最优传输资源分配优化问题,2)最优功率分配优化问题;Further, in the step S3, in order to reduce the solving complexity of the problem, the optimization problem of maximizing the energy efficiency in each time slot is decomposed into two equivalent sub-optimization problems: 1) the optimization problem of optimal transmission resource allocation, 2) The optimal power distribution optimization problem;
以用户为中心的虚拟小区进行最优传输资源分配时,网络根据用户的信道状况动态选择虚拟小区内最优的gNB进行数据传输,并将传输质量最好的资源块RB分配给对应的gNB,使得每个用户都能获得传输质量最好的gNB和RB为之服务;When the user-centered virtual cell performs optimal transmission resource allocation, the network dynamically selects the optimal gNB in the virtual cell for data transmission according to the user's channel conditions, and allocates the resource block RB with the best transmission quality to the corresponding gNB, So that each user can obtain the best transmission quality gNB and RB to serve it;
通过三步实现,首先,为每个用户先分配一个当前传输质量最好的RB;其次,保证每个gNB都分配有RB;最后,分配剩余的RB给最合适的用户;It is realized through three steps. First, assign an RB with the best current transmission quality to each user; second, ensure that each gNB is assigned an RB; finally, assign the remaining RBs to the most suitable users;
通过最优传输资源分配后得到虚拟小区内实际为用户传输数据的gNB和RB集合,优化问题转化为最优功率分配问题;然后,利用拉格朗日对偶原理及次梯度更新方法进行求解最优功率值。After the optimal transmission resource allocation, the set of gNBs and RBs that actually transmit data for users in the virtual cell is obtained, and the optimization problem is transformed into the optimal power allocation problem. Then, the Lagrange duality principle and the subgradient update method are used to solve the optimal problem power value.
本发明的有益效果在于:The beneficial effects of the present invention are:
1)最优传输资源分配优化问题。以用户为中心的虚拟小区进行最优传输资源分配时,网络会根据用户的信道状况动态选择虚拟小区内最优的gNB进行数据传输,并将传输质量最好的RB分配给对应的gNB,使得每个用户都能获得传输质量最好的gNB和RB为之服务。1) The optimal transmission resource allocation optimization problem. When the user-centered virtual cell performs optimal transmission resource allocation, the network will dynamically select the optimal gNB in the virtual cell for data transmission according to the user's channel conditions, and allocate the RB with the best transmission quality to the corresponding gNB, so that Each user can obtain the gNB and RB with the best transmission quality to serve it.
2)最优功率分配优化问题。通过最优传输资源分配后可得到虚拟小区内实际为用户传输数据的gNB和RB集合,优化问题转化为最优功率分配问题。然后,利用拉格朗日对偶原理及次梯度更新方法进行求解最优功率值。2) The optimal power distribution optimization problem. After the optimal transmission resource allocation, the set of gNBs and RBs that actually transmit data for users in the virtual cell can be obtained, and the optimization problem is transformed into an optimal power allocation problem. Then, the optimal power value is solved by using the Lagrangian duality principle and the subgradient update method.
本发明充分考虑用户数据包队列长度和信道质量,将最大化网络的平均能量效率问题分解为用户最优传输资源分配和最优功率分配两个子问题求解。通过对网络资源的优化分配,提升传输质量,并且实现了在最大化系统平均能量效率的同时保证系统队列的稳定性。The invention fully considers the user data packet queue length and channel quality, and decomposes the problem of maximizing the average energy efficiency of the network into two sub-problems of user optimal transmission resource allocation and optimal power allocation to solve. Through the optimal allocation of network resources, the transmission quality is improved, and the stability of the system queue is ensured while maximizing the average energy efficiency of the system.
本发明的其他优点、目标和特征在某种程度上将在随后的说明书中进行阐述,并且在某种程度上,基于对下文的考察研究对本领域技术人员而言将是显而易见的,或者可以从本发明的实践中得到教导。本发明的目标和其他优点可以通过下面的说明书来实现和获得。Other advantages, objects, and features of the present invention will be set forth in the description that follows, and will be apparent to those skilled in the art based on a study of the following, to the extent that is taught in the practice of the present invention. The objectives and other advantages of the present invention may be realized and attained by the following description.
附图说明Description of drawings
为了使本发明的目的、技术方法和优点更加清楚,下面将结合附图对本发明作优选的详细描述,其中:In order to make the objects, technical methods and advantages of the present invention clearer, the present invention will be preferably described in detail below in conjunction with the accompanying drawings, wherein:
图1为以用户为中心的虚拟小区网络场景图;Fig. 1 is a user-centric virtual cell network scenario diagram;
图2为虚拟小区建立流程图;Fig. 2 is a flow chart for establishing a virtual cell;
图3为最优传输资源分配算法图;Fig. 3 is the optimal transmission resource allocation algorithm diagram;
图4为最优功率分配算法图。Figure 4 is a diagram of an optimal power allocation algorithm.
具体实施方式Detailed ways
以下通过特定的具体实例说明本发明的实施方式,本领域技术人员可由本说明书所揭露的内容轻易地了解本发明的其他优点与功效。本发明还可以通过另外不同的具体实施方式加以实施或应用,本说明书中的各项细节也可以基于不同观点与应用,在没有背离本发明的精神下进行各种修饰或改变。需要说明的是,以下实施例中所提供的图示仅以示意方式说明本发明的基本构想,在不冲突的情况下,以下实施例及实施例中的特征可以相互组合。The embodiments of the present invention are described below through specific specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the drawings provided in the following embodiments are only used to illustrate the basic idea of the present invention in a schematic manner, and the following embodiments and features in the embodiments can be combined with each other without conflict.
其中,附图仅用于示例性说明,表示的仅是示意图,而非实物图,不能理解为对本发明的限制;为了更好地说明本发明的实施例,附图某些部件会有省略、放大或缩小,并不代表实际产品的尺寸;对本领域技术人员来说,附图中某些公知结构及其说明可能省略是可以理解的。Among them, the accompanying drawings are only used for exemplary description, and represent only schematic diagrams, not physical drawings, and should not be construed as limitations of the present invention; in order to better illustrate the embodiments of the present invention, some parts of the accompanying drawings will be omitted, The enlargement or reduction does not represent the size of the actual product; it is understandable to those skilled in the art that some well-known structures and their descriptions in the accompanying drawings may be omitted.
本发明实施例的附图中相同或相似的标号对应相同或相似的部件;在本发明的描述中,需要理解的是,若有术语“上”、“下”、“左”、“右”、“前”、“后”等指示的方位或位置关系为基于附图所示的方位或位置关系,仅是为了便于描述本发明和简化描述,而不是指示或暗示所指的装置或元件必须具有特定的方位、以特定的方位构造和操作,因此附图中描述位置关系的用语仅用于示例性说明,不能理解为对本发明的限制,对于本领域的普通技术人员而言,可以根据具体情况理解上述术语的具体含义。The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there are terms “upper”, “lower”, “left” and “right” , "front", "rear" and other indicated orientations or positional relationships are based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the indicated device or element must be It has a specific orientation, is constructed and operated in a specific orientation, so the terms describing the positional relationship in the accompanying drawings are only used for exemplary illustration, and should not be construed as a limitation of the present invention. situation to understand the specific meaning of the above terms.
参见图1,图1为以用户为中心的虚拟小区网络场景图。其中网络中由gNB和用户构成,并且用户是随机分布在网络中。假设一个资源块(Resource Block,RB)仅分配给一个gNB,且只分配给该gNB中的一个用户使用。系统的总带宽被划分为N个相等带宽的RB,每个RB的带宽为B=W/N。在下行链路中,用户可接受来自虚拟小区内多个gNB的传输信号,即虚拟小区内gNB采用CoMP的方式协作为用户提供服务,且协作的gNB之间使用不同的RB传输用户数据。本章将建立以用户为中心的虚拟小区来减少密集小蜂窝网络中用户的干扰和业务连续性问题。Referring to FIG. 1, FIG. 1 is a user-centric virtual cell network scenario diagram. The network consists of gNBs and users, and the users are randomly distributed in the network. It is assumed that a resource block (Resource Block, RB) is allocated to only one gNB, and is allocated to only one user in the gNB for use. The total bandwidth of the system is divided into N RBs of equal bandwidth, and the bandwidth of each RB is B=W/N. In the downlink, the user can accept transmission signals from multiple gNBs in the virtual cell, that is, the gNBs in the virtual cell use CoMP to provide services for the user, and the cooperating gNBs use different RBs to transmit user data. This chapter will build user-centric virtual cells to reduce user interference and service continuity issues in dense small cell networks.
当网络中Inactive用户有数据包到达时,该用户通过当前驻留的gNB接入网络转化为连接状态,根据用户检测到的所有gNB信号强度以及gNB负载情况,经过锚点gNB筛选后建立以用户为中心的虚拟小区。为了提高资源利用率,减少能耗,虚拟小区将进行最优传输资源分配,只有满足传输条件的gNB才以CoMP的形式协作为用户服务。When an Inactive user in the network arrives with a data packet, the user accesses the network through the currently residing gNB and converts it to a connected state. According to the signal strength of all gNBs detected by the user and the gNB load, the user is screened by the anchor gNB and established to connect to the user. as the center of the virtual cell. In order to improve resource utilization and reduce energy consumption, virtual cells will perform optimal transmission resource allocation, and only gNBs that meet the transmission conditions will cooperate in the form of CoMP to serve users.
参见图2,图2为虚拟小区建立流程图。以用户为中心的虚拟小区不仅能够减小其他gNB对用户的干扰、避免用户频繁切换,还能消除边缘用户改善通信质量。当用户处于Inactive状态时,有一个位置通知区域RNA。Inactive用户在有数据传输需求时,通过当前驻留gNB转换为连接状态,并以RNA作为候选虚拟小区,用户检测RNA中所有gNB信号强度,经过锚点gNB筛选后建立以用户为中心的虚拟小区。Referring to FIG. 2, FIG. 2 is a flowchart of establishing a virtual cell. The user-centered virtual cell can not only reduce the interference of other gNBs to users, avoid frequent handover of users, but also eliminate edge users and improve communication quality. There is a location notification area RNA when the user is in the Inactive state. When an Inactive user has a data transmission requirement, the currently residing gNB is converted to a connected state, and RNA is used as a candidate virtual cell. The user detects the signal strength of all gNBs in the RNA, and establishes a user-centered virtual cell after screening by the anchor gNB. .
虚拟小区建立过程如下:The process of establishing a virtual cell is as follows:
201、当网络中有Inactive用户数据包到达时,为定位用户,锚点gNB将发起寻呼过程。用户收到寻呼消息后通过当前驻留的gNB转换为连接状态,接入网络;201. When an Inactive user data packet arrives in the network, in order to locate the user, the anchor gNB will initiate a paging process. After receiving the paging message, the user switches to the connected state through the currently resident gNB and accesses the network;
202、用户接入网络后,将用户之前处于Inactive时的无线接入网通知区域RNA作为候选虚拟小区,用户检测RNA中所有gNB的RS强度并将测量结果上报至用户当前驻留的gNB;202. After the user accesses the network, the radio access network notification area RNA when the user was previously inactive is used as a candidate virtual cell, the user detects the RS strengths of all gNBs in the RNA and reports the measurement results to the gNB where the user currently resides;
203、用户当前驻留gNB根据测量结果将RS大于阈值的gNB上报至锚点gNB,锚点gNB根据负载信息库,确定组建虚拟小区的gNB并将结果及虚拟小区配置信息下发给用户当前驻留的gNB;203. The gNB that the user currently resides on reports the gNB whose RS is greater than the threshold to the anchor point gNB according to the measurement result, and the anchor point gNB determines the gNB that forms the virtual cell according to the load information base, and delivers the result and the configuration information of the virtual cell to the user currently camping on. gNB left;
204、用户当前驻留的gNB将虚拟小区配置信息分别发送给用户和相应的gNB构建以用户为中心的虚拟小区,虚拟小区内传输节点间通过协作的方式为用户提供通信服务。204. The gNB where the user currently resides sends the virtual cell configuration information to the user and the corresponding gNB respectively to construct a user-centered virtual cell, and the transmission nodes in the virtual cell provide communication services for the user in a cooperative manner.
本发明通过系统时间平均能量效率来衡量虚拟小区系统的性能,系统时间平均能量效率定义为时间平均总数据数率与时间平均总功率消耗的比值。The present invention measures the performance of the virtual cell system by the system time-averaged energy efficiency, which is defined as the ratio of the time-averaged total data rate to the time-averaged total power consumption.
系统在t时刻总的用户速率可表示为:The total user rate of the system at time t can be expressed as:
其中,ak,m∈{0,1}表示用户k与虚拟小区内gNB m之间的连接指示变量,ak,m=1表示用户k与gNB m连接,反之ak,m=0。bn,m∈{0,1}则表示RB n与gNB m之间的分配指示变量,bn,m表示RB n分配给gNB m,否则bn,m=0。rk,n,m(t)为gNB m在RB n上用户k的传输数率。Among them, ak,m ∈{0,1} represents the connection indicator variable between user k and gNB m in the virtual cell, ak,m =1 represents the connection between user k and gNB m, otherwise ak,m =0. bn,m ∈{0,1} represents the allocation indicator variable between RB n and gNB m, bn,m represents that RB n is allocated to gNB m, otherwise bn,m =0. r k,n,m (t) is the transmission rate of user k on RB n by gNB m.
进一步,可以得出系统时间平均总速率为:Further, it can be concluded that the system time-averaged total rate is:
系统中所有gNB的功率消耗为传输数据功率消耗和电路功率消耗之和,因此本发明的系统功耗模型如下式所示:The power consumption of all gNBs in the system is the sum of data transmission power consumption and circuit power consumption, so the system power consumption model of the present invention is shown in the following formula:
其中τ为gNB功率放大效率,M为gNB数量,pcir为处于空闲状态时gNB产生电路功率消耗。系统时间平均总功率消耗可表示为:Among them, τ is the power amplification efficiency of the gNB, M is the number of gNBs, and p cir is the power consumption of the gNB generation circuit when it is in an idle state. The system time-averaged total power consumption can be expressed as:
设用户k下行链路队列长度为Qk(t),gNB侧数据包队列长度可以表示为:Assuming that the downlink queue length of user k is Q k (t), the packet queue length on the gNB side can be expressed as:
t+1时刻的队列长度=t时刻队列长度-t时刻链路的发包数+t时刻数据包的到达数,则用户k的下行链路队列更新过程表示为:Queue length at time t+1 = queue length at time t - number of packets sent by link at time t + arrival number of data packets at time t, then the update process of user k's downlink queue is expressed as:
Qk(t+1)=max{Qk(t)-Dk(t),0}+Ak(t) (5)Q k (t+1)=max{Q k (t)-D k (t),0}+A k (t) (5)
其中,Qk(0)=0,Ak(t)为用户k在时间t内数据包的到达数,其服从泊松分布。Dk(t)为用户k在时间t数据包的发包数,每个数据包的大小为L,单位为bit。Among them, Q k (0)=0, A k (t) is the arrival number of data packets of user k in time t, which obeys Poisson distribution. D k (t) is the number of data packets sent by user k at time t, the size of each data packet is L, and the unit is bit.
则以最大化时间平均能量效率为目标的资源分配优化问题可以表示为:Then the resource allocation optimization problem with the goal of maximizing the time-averaged energy efficiency can be expressed as:
其中,Rmin为每个用户的最小传输数率,Pmax为单个gNB的最大发射功率。约束条件C1在最大化系统时间平均能量效率的同时保证每个用户队列稳定的需求,约束条件C2为单个用户的最小速率需求约束,约束条件C3为单个gNB最大传输功率约束,约束条件C4为单个用户的传输功率约束,约束条件C5表示每个多个gNB可以协同为一个用户服务,同时一个gNB可以分配给多个用户,约束条件C6表示一个RB只能分配给一个gNB,但每个gNB可以被分配多个不同的RB。Among them, R min is the minimum transmission rate of each user, and P max is the maximum transmit power of a single gNB. Constraint C 1 is the requirement of maximizing the time-averaged energy efficiency of the system while ensuring the stability of the queue of each user, Constraint C 2 is the minimum rate requirement constraint of a single user, Constraint C 3 is the maximum transmission power constraint of a single gNB, Constraints C 4 is the transmission power constraint of a single user. Constraint C 5 means that each multiple gNBs can cooperate to serve one user, and one gNB can be allocated to multiple users. Constraint C 6 means that one RB can only be allocated to one gNB , but each gNB can be assigned multiple different RBs.
进一步,基于Lyapunov优化建模,步骤如下:Further, based on Lyapunov optimization modeling, the steps are as follows:
1)定义系统的Lyapunov函数:1) Define the Lyapunov function of the system:
2)定义Lyapunov转移函数:2) Define the Lyapunov transfer function:
ΔQ(t)=E{L(Q(t+1))-L(Q(t))|Q(t)} (9)ΔQ(t)=E{L(Q(t+1))-L(Q(t))|Q(t)} (9)
3)定义Lyapunov惩罚项:3) Define the Lyapunov penalty term:
VU(t)=V(Rtot(t)-qPtot(t)) (10)VU(t)=V(R tot (t)-qP tot (t)) (10)
4)系统优化问题转化:4) System optimization problem transformation:
为降低问题的求解复杂度,将该优化问题分解成两个等价的子优化问题:1)最优传输资源分配优化问题2)最优功率分配优化问题,并利用拉格朗日对偶原理及次梯度更新方法进行求解。In order to reduce the complexity of solving the problem, the optimization problem is decomposed into two equivalent sub-optimization problems: 1) optimization problem of optimal transmission resource allocation and 2) optimization problem of optimal power distribution, and the Lagrangian duality principle and The subgradient update method is used to solve it.
参见图3,图3为最优传输资源分配算法图。首先初始化设置,假设系统中有K个用户,N个RB,M个gNB,在网络中可构成K个N×M的三维信道增益矩阵H(K,N,M),即K个N行M列的信道增益矩阵。假设RB数量大于gNB数量和用户数量,而gNB数量又是小于用户数量,即M≤K≤N。首先,为每个用户先分配一个当前传输质量最好的RB,其次保证每个gNB都分配有RB,最后分配剩余的RB给性能最好的用户。最优传输资源分配方案可分为以下三个步骤:Referring to FIG. 3, FIG. 3 is a diagram of an optimal transmission resource allocation algorithm. First initialize the settings. Assuming that there are K users, N RBs, and M gNBs in the system, K N×M three-dimensional channel gain matrices H(K, N, M) can be formed in the network, that is, K N rows of M Columns of the channel gain matrix. It is assumed that the number of RBs is greater than the number of gNBs and the number of users, and the number of gNBs is smaller than the number of users, that is, M≤K≤N. First, assign an RB with the best current transmission quality to each user, secondly, ensure that each gNB is assigned an RB, and finally assign the remaining RBs to the user with the best performance. The optimal transmission resource allocation scheme can be divided into the following three steps:
301、为每个用户先分配一个当前传输质量最好的RB。遍历信道增益矩阵H(K,N,M),将信道增益最大的hk,n,m对应的gNB,分配给相应的用户,并将RB分配给gNB。删除RB所对应的信道增益矩阵的行,以及删除用户对应的整个信道增益矩阵。如果此RB所关联的gNB不在用户的虚拟小区内,则放弃此次资源分配,重新为用户选择合适的传输资源。继续遍历剩余的信道增益值,重复上述的分配步骤直到所有用户都有一个gNB和一个RB为之服务。301. First allocate an RB with the best current transmission quality to each user. Traverse the channel gain matrix H(K, N, M), assign the gNB corresponding to h k, n, m with the largest channel gain to the corresponding user, and assign the RB to the gNB. Delete the row of the channel gain matrix corresponding to the RB, and delete the entire channel gain matrix corresponding to the user. If the gNB associated with this RB is not in the user's virtual cell, the resource allocation will be abandoned, and an appropriate transmission resource will be re-selected for the user. Continue to traverse the remaining channel gain values, and repeat the above allocation steps until all users are served by one gNB and one RB.
302、保证每个gNB都分配有RB。通过步骤1),由于一个gNB可为多个用户服务,能够被用户重复选择,因此存在M-x(1≤x≤M)个gNB未分配RB资源,且剩余N-K个RB待分配。基于此,生成新的三维信道增益矩阵H'(K,N-K,M-x),即K个N-K行M-x列的矩阵。继续遍历信道增益矩阵H',将信道增益最大的h'k',n',m'以及对应的gNB,分配给相应的用户,并将RB分配给gNB。删除RB和gNB对应的信道增益矩阵的行和列,判断给用户分配的gNB是否属于用户的虚拟小区,如果该gNB不属于用户的虚拟小区,则放弃此次资源分配。重复上述步骤,直到每个gNB至少都分配有RB,由此可得每个用户所属的gNB集合Gk,k∈{1,2,...K}。302. Ensure that RBs are allocated to each gNB. Through step 1), since one gNB can serve multiple users and can be repeatedly selected by users, there are Mx (1≤x≤M) gNBs that have not been allocated RB resources, and NK RBs remain to be allocated. Based on this, a new three-dimensional channel gain matrix H'(K, NK, Mx) is generated, that is, a matrix of K rows and Mx columns. Continue to traverse the channel gain matrix H', allocate h'k',n',m' with the largest channel gain and the corresponding gNB to the corresponding user, and allocate the RB to the gNB. Delete the rows and columns of the channel gain matrix corresponding to the RB and gNB, and determine whether the gNB allocated to the user belongs to the user's virtual cell. If the gNB does not belong to the user's virtual cell, the resource allocation is abandoned. The above steps are repeated until each gNB is allocated with at least RB, and thus the gNB set G k , k∈{1,2,...K} to which each user belongs can be obtained.
303、分配剩余的RB给用户。通过步骤1)、2),可知还剩余N-K-M+x个RB未分配,由于gNB可以分配给多个用户,所以仍然有M个gNB可分配。基于此,生成三维矩阵H"(K,N-K-M+x,M),既K个N-K-M+x行M列的矩阵。同样基于矩阵H",将最大增益值h"k",n",m"及其对应的gNB分配给相应的用户,并将RB分配给gNB,删除已分配的RB,直到所有RB分配完毕,由此可得每个gNB的RB集合为 303. Allocate the remaining RBs to the users. Through steps 1) and 2), it can be known that NK-M+x RBs remain unallocated. Since gNBs can be allocated to multiple users, there are still M gNBs that can be allocated. Based on this, a three-dimensional matrix H"(K,NK-M+x,M) is generated, which is a matrix of K NK-M+x rows and M columns. Also based on the matrix H", the maximum gain value h"k",n",m" and its corresponding gNBs are allocated to the corresponding users, RBs are allocated to the gNBs, and the allocated RBs are deleted until all RBs are allocated, thus the RB set of each gNB can be obtained as
通过最优传输资源分配算法可得到虚拟小区内实际为用户传输数据的gNB和RB集合,则优化问题(11)中的约束条件C5,C6,C7已满足,因此原优化问题可以等价转为如下新优化问题:Through the optimal transmission resource allocation algorithm, the set of gNBs and RBs that actually transmit data for users in the virtual cell can be obtained, then the constraints C5, C6, and C7 in the optimization problem (11) have been satisfied, so the original optimization problem can be equivalently transformed into The new optimization problem is as follows:
在初始能量效率值q给定的情况下,为了求得最优功率分配,采用拉格朗日对偶法,得到拉格朗日函数如下:When the initial energy efficiency value q is given, in order to obtain the optimal power distribution, the Lagrangian dual method is used to obtain the Lagrangian function as follows:
其中,αk和βm分别是约束条件C2和C3所对应的拉格朗日乘子,且对均满足αk≥0和βm≥0。where α k and β m are the Lagrange multipliers corresponding to the constraints C 2 and C 3 , respectively, and Both α k ≥ 0 and β m ≥ 0 are satisfied.
假设存在最优解使得式(12)目标函数最优,且满足所有约束条件。根据KKT条件,可以通过拉格朗日函数L(p,αk,βm)对pk,n,m(t)求导方程求解最优功率分配,求解最优功率可得:Suppose there is an optimal solution The objective function of equation (12) is optimized and all constraints are satisfied. According to the KKT conditions, the optimal power distribution can be solved by the Lagrangian function L(p,α k ,β m ) for the derivation equation of p k,n,m (t), and the optimal power Available:
其中,[X]+=max{0,X}。在拉格朗日求解的过程中,首先利用KKT条件将拉格朗日乘子固定,从而求得局部最优的功率分配后,接着通过次梯度方法更新拉格朗日乘子,当迭代过程满足收敛条件时可求得式(15)的近似最优解。where [X] + =max{0,X}. In the process of Lagrangian solution, the Lagrangian multiplier is first fixed by using the KKT condition, so as to obtain the local optimal power distribution, and then the Lagrangian multiplier is updated by the sub-gradient method. When the iterative process When the convergence conditions are satisfied, the approximate optimal solution of Eq. (15) can be obtained.
参见图4,图4为最优功率分配算法图。首先初始化拉格朗日乘子α,β,控制参数值V,t时刻的队列长度Qk(t),初始能量效率值q,误差容忍门限值ε。最优功率分配方案可分具体步骤如下:Referring to FIG. 4, FIG. 4 is a diagram of an optimal power allocation algorithm. First initialize Lagrangian multipliers α, β, control parameter value V, queue length Q k (t) at time t, Initial energy efficiency value q, error tolerance threshold ε. The optimal power allocation scheme can be divided into specific steps as follows:
401、根据(14)式,计算t时刻用户k的最优功率 401. According to formula (14), calculate the optimal power of user k at time t
402、计算t时刻系统的能量效率 402. Calculate the energy efficiency of the system at time t
403、判断|Rtot(p*)-qPtot(p*)|≤ε是否成立;403. Determine whether |R tot (p * )-qP tot (p * )|≤ε is established;
404、|Rtot(p*)-qPtot(p*)|≥ε算法未收敛,更新初始能效为更新拉格朗日因子αk(t+1)和βm(t+1),更新迭代参数t=t+1,返回步骤401;404. |R tot (p * )-qP tot (p * )|≥ε algorithm does not converge, and the updated initial energy efficiency is Update the Lagrangian factors α k (t+1) and β m (t+1), update the iteration parameter t=t+1, and return to step 401;
405、|Rtot(p*)-qPtot(p*)|≤ε算法收敛,输出最优功率分配p*和算法结束。405. |R tot (p * )-qP tot (p * )|≤ε algorithm converges, and outputs optimal power distribution p * and The algorithm ends.
最后说明的是,以上实施例仅用以说明本发明的技术方法而非限制,尽管参照较佳实施例对本发明进行了详细说明,本领域的普通技术人员应当理解,可以对本发明的技术方法进行修改或者等同替换,而不脱离本技术方法的宗旨和范围,其均应涵盖在本发明的权利要求范围当中。Finally, it should be noted that the above embodiments are only used to illustrate the technical method of the present invention and not to limit it. Although the present invention has been described in detail with reference to the preferred embodiment, those of ordinary skill in the art should understand that the technical method of the present invention can be carried out. Modifications or equivalent substitutions, without departing from the spirit and scope of the technical method, should all be included in the scope of the claims of the present invention.
Claims (9)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910290485.5A CN110012509B (en) | 2019-04-11 | 2019-04-11 | Resource allocation method based on user mobility in 5G small cellular network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910290485.5A CN110012509B (en) | 2019-04-11 | 2019-04-11 | Resource allocation method based on user mobility in 5G small cellular network |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110012509A true CN110012509A (en) | 2019-07-12 |
CN110012509B CN110012509B (en) | 2022-04-19 |
Family
ID=67171133
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910290485.5A Active CN110012509B (en) | 2019-04-11 | 2019-04-11 | Resource allocation method based on user mobility in 5G small cellular network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110012509B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111314938A (en) * | 2020-02-24 | 2020-06-19 | 厦门大学 | Optimization method for time-frequency domain resource allocation of cellular network of single cell |
CN113115401A (en) * | 2021-05-11 | 2021-07-13 | 中国电子科技集团公司第三十八研究所 | Access control method for maximizing satisfied user number in cellular network |
Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101772028A (en) * | 2009-01-05 | 2010-07-07 | 华为技术有限公司 | Resource management method, network equipment, user equipment and system |
US20120281641A1 (en) * | 2011-05-06 | 2012-11-08 | The Hong Kong University Of Science And Technology | Orthogonal frequency division multiple access (ofdma) subband and power allocation |
CN105376748A (en) * | 2014-08-27 | 2016-03-02 | 中兴通讯股份有限公司 | Construction method of virtual cell, selection method of cooperating node and device |
WO2016036111A1 (en) * | 2014-09-04 | 2016-03-10 | Samsung Electronics Co., Ltd. | Resource management method and apparatus |
CN105764100A (en) * | 2016-01-29 | 2016-07-13 | 北京邮电大学 | Mobility enhancement scheme based on the design of virtual cell facing dense cell disposition |
CN107040917A (en) * | 2016-02-03 | 2017-08-11 | 上海贝尔股份有限公司 | Method and apparatus for generating virtual subdistrict mark |
CN107426809A (en) * | 2017-06-20 | 2017-12-01 | 西安电子科技大学 | WVN power and cache allocation method based on Virtual User queuing model |
CN107708157A (en) * | 2017-11-22 | 2018-02-16 | 重庆邮电大学 | Intensive small cell network resource allocation methods based on efficiency |
WO2018065527A1 (en) * | 2016-10-06 | 2018-04-12 | Sony Corporation | Entity and user equipment for a mobile telecommunications system |
CN108430104A (en) * | 2018-03-07 | 2018-08-21 | 北京科技大学 | Method and system for energy efficiency optimization and resource allocation |
CN108462996A (en) * | 2018-03-07 | 2018-08-28 | 北京科技大学 | A kind of non-orthogonal multiple network resource allocation method |
CN109479238A (en) * | 2016-07-22 | 2019-03-15 | 索尼公司 | Mobile communication system method, user equipment and base station for on-demand Transmission system information |
-
2019
- 2019-04-11 CN CN201910290485.5A patent/CN110012509B/en active Active
Patent Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101772028A (en) * | 2009-01-05 | 2010-07-07 | 华为技术有限公司 | Resource management method, network equipment, user equipment and system |
US20120281641A1 (en) * | 2011-05-06 | 2012-11-08 | The Hong Kong University Of Science And Technology | Orthogonal frequency division multiple access (ofdma) subband and power allocation |
CN105376748A (en) * | 2014-08-27 | 2016-03-02 | 中兴通讯股份有限公司 | Construction method of virtual cell, selection method of cooperating node and device |
WO2016036111A1 (en) * | 2014-09-04 | 2016-03-10 | Samsung Electronics Co., Ltd. | Resource management method and apparatus |
CN105764100A (en) * | 2016-01-29 | 2016-07-13 | 北京邮电大学 | Mobility enhancement scheme based on the design of virtual cell facing dense cell disposition |
CN107040917A (en) * | 2016-02-03 | 2017-08-11 | 上海贝尔股份有限公司 | Method and apparatus for generating virtual subdistrict mark |
CN109479238A (en) * | 2016-07-22 | 2019-03-15 | 索尼公司 | Mobile communication system method, user equipment and base station for on-demand Transmission system information |
WO2018065527A1 (en) * | 2016-10-06 | 2018-04-12 | Sony Corporation | Entity and user equipment for a mobile telecommunications system |
CN107426809A (en) * | 2017-06-20 | 2017-12-01 | 西安电子科技大学 | WVN power and cache allocation method based on Virtual User queuing model |
CN107708157A (en) * | 2017-11-22 | 2018-02-16 | 重庆邮电大学 | Intensive small cell network resource allocation methods based on efficiency |
CN108430104A (en) * | 2018-03-07 | 2018-08-21 | 北京科技大学 | Method and system for energy efficiency optimization and resource allocation |
CN108462996A (en) * | 2018-03-07 | 2018-08-28 | 北京科技大学 | A kind of non-orthogonal multiple network resource allocation method |
Non-Patent Citations (6)
Title |
---|
HONGXIN WEI: "Energy-efficient resource allocation for small-cell networks: A stable queue perspective", 《IEEE》 * |
KEYVAN ZARIFI: "Radio access virtualization: Cell follows user", 《IEEE》 * |
WEIHUA WU: "Adaptive Resource Allocation Algorithm of Lyapunov Optimization for Time-Varying Wireless Networks", 《IEEE COMMUNICATIONS LETTERS》 * |
曹春燕: "MEC 辅助的 Inactive 状态用户动态位置管理方案", 《重庆邮电大学学报(自然科学版)》 * |
赵晓宁: "超密集网基于干扰公平及多维协作的虚拟小区生成算法", 《电信科学》 * |
陈露: "超密集网络中以用户为中心的虚拟小区技术研究", 《硕士电子期刊》 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111314938A (en) * | 2020-02-24 | 2020-06-19 | 厦门大学 | Optimization method for time-frequency domain resource allocation of cellular network of single cell |
CN113115401A (en) * | 2021-05-11 | 2021-07-13 | 中国电子科技集团公司第三十八研究所 | Access control method for maximizing satisfied user number in cellular network |
CN113115401B (en) * | 2021-05-11 | 2022-04-01 | 中国电子科技集团公司第三十八研究所 | Access control method for maximizing satisfied user number in cellular network |
Also Published As
Publication number | Publication date |
---|---|
CN110012509B (en) | 2022-04-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110493826B (en) | Heterogeneous cloud wireless access network resource allocation method based on deep reinforcement learning | |
JP5411985B2 (en) | Equipment and method of base station dynamic clustering in mobile communication | |
CN104796918B (en) | The method of wireless communication network | |
Zhong et al. | Traffic matching in 5G ultra-dense networks | |
WO2015131677A1 (en) | Method and device for constructing virtual cell and selecting cooperative node | |
US20130017852A1 (en) | Communication system and management method thereof | |
CN104053163A (en) | A computing-based heterogeneous wireless network networking method | |
CN105325029A (en) | User equipment and evolved node-B supporting machine type communication and small data communication | |
CN106604343B (en) | Cell virtualization method and device | |
CN107708157A (en) | Intensive small cell network resource allocation methods based on efficiency | |
CN105050124B (en) | Frequency spectrum resource polymerization between station of the isomery cellular network based on service-aware | |
WO2013017108A1 (en) | Advanced antenna system-based communication method and device | |
KR102051831B1 (en) | Method and apparatus for traffic load balancing in mobile communication system | |
CN110012509B (en) | Resource allocation method based on user mobility in 5G small cellular network | |
CN106788812B (en) | A Clustering-Based Disturbance Alignment Method in Two-Layer Networks | |
CN116033556B (en) | A Resource Allocation Method for Large-Scale URLLC with High Energy Efficiency | |
CN103052113A (en) | Collaborative load balancing method of wireless access network system based on RAN (Residential Access Network) framework | |
Li et al. | Resource management for future mobile networks: Architecture and technologies | |
CN107454601B (en) | A wireless virtual mapping method considering inter-cell interference in ultra-dense environments | |
CN106304232B (en) | A kind of communication means and device of base station dormancy | |
CN115835339B (en) | Collaborative computing method, device and system | |
CN103281730B (en) | System and method of realizing C-RAN load balance on the basis of household base stations | |
CN102186215B (en) | Switching method of multipoint-multiuser oriented cooperation transmission | |
CN106304267A (en) | A kind of virtual subdistrict system of selection of customer-centric | |
KR100999959B1 (en) | Resource Allocation Control Method and Wireless Communication System Considering Inter-cell Interference in Multi-Cell Environment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right |
Effective date of registration: 20231024 Address after: Room 596, No. 503, Lane 6825, Caolang Road, Langxia Town, Jinshan District, Shanghai 201500 Patentee after: Shanghai Miyang Communication Technology Co.,Ltd. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
TR01 | Transfer of patent right |