[go: up one dir, main page]

CN111314938B - An optimization method for cellular network time-frequency domain resource allocation for a single cell - Google Patents

An optimization method for cellular network time-frequency domain resource allocation for a single cell Download PDF

Info

Publication number
CN111314938B
CN111314938B CN202010112316.5A CN202010112316A CN111314938B CN 111314938 B CN111314938 B CN 111314938B CN 202010112316 A CN202010112316 A CN 202010112316A CN 111314938 B CN111314938 B CN 111314938B
Authority
CN
China
Prior art keywords
user
cellular
energy consumption
resource block
users
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.)
Active
Application number
CN202010112316.5A
Other languages
Chinese (zh)
Other versions
CN111314938A (en
Inventor
林世俊
王叶苹
石江宏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen University
Original Assignee
Xiamen University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xiamen University filed Critical Xiamen University
Priority to CN202010112316.5A priority Critical patent/CN111314938B/en
Publication of CN111314938A publication Critical patent/CN111314938A/en
Application granted granted Critical
Publication of CN111314938B publication Critical patent/CN111314938B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/02Power saving arrangements
    • H04W52/0209Power saving arrangements in terminal devices
    • H04W52/0261Power saving arrangements in terminal devices managing power supply demand, e.g. depending on battery level
    • H04W52/0274Power saving arrangements in terminal devices managing power supply demand, e.g. depending on battery level by switching on or off the equipment or parts thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04Transmission power control [TPC]
    • H04W52/06TPC algorithms
    • H04W52/14Separate analysis of uplink or downlink
    • H04W52/146Uplink power control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04Transmission power control [TPC]
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/241TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account channel quality metrics, e.g. SIR, SNR, CIR or Eb/lo
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04Transmission power control [TPC]
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/26TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service]
    • H04W52/265TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service] taking into account the quality of service QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446Resources in time domain, e.g. slots or frames
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453Resources in frequency domain, e.g. a carrier in FDMA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明涉及一种用于单个蜂窝小区的蜂窝网络时频域资源分配的优化方法,其将蜂窝网络的功耗优化模型转化为结合时频域的单蜂窝用户上行链路传输系统能耗最小化模型,涉及资源分配和发送功率控制,首先根据拉格朗日对偶算法的思想得出各个蜂窝用户在各个频谱上的最优发送功率,然后结合合作博弈论对优化模型进行求解。对比常见的单一维资源分配,通过本发明的时频域资源分配优化方法极大的减小了系统的能源消耗。

Figure 202010112316

The present invention relates to an optimization method for cellular network time-frequency domain resource allocation for a single cell, which transforms a cellular network power consumption optimization model into a single-cell user uplink transmission system energy minimization combined with time-frequency domain The model involves resource allocation and transmit power control. First, according to the idea of Lagrangian dual algorithm, the optimal transmit power of each cellular user in each spectrum is obtained, and then the optimization model is solved by combining cooperative game theory. Compared with the common single-dimensional resource allocation, the energy consumption of the system is greatly reduced by the time-frequency domain resource allocation optimization method of the present invention.

Figure 202010112316

Description

一种用于单个蜂窝小区的蜂窝网络时频域资源分配的优化 方法An optimization method for cellular network time-frequency domain resource allocation for a single cell

技术领域technical field

本发明涉及蜂窝网络资源分配技术领域,具体涉及一种用于单个蜂窝小区的蜂窝网络时频域资源分配的优化方法。The invention relates to the technical field of cellular network resource allocation, in particular to an optimization method for cellular network time-frequency domain resource allocation for a single cellular cell.

背景技术Background technique

随着移动多媒体业务和相关应用的快速发展,高清视频、在线直播等多媒体业务呈爆发式增长,其大流量特性给运营商的核心网和频谱资源带来巨大压力;5G就是应对移动数据流量爆炸性增长及海量设备连接需求而提出的多业务多技术融合网络,它的特点是高速度、泛在网、低功耗、低时延。所以,对蜂窝网络资源进行高效、灵活的分配,可以提升网络性能,降低系统能耗,实现可持续发展。With the rapid development of mobile multimedia services and related applications, multimedia services such as high-definition video and online live broadcast have experienced explosive growth, and their high-traffic characteristics have brought huge pressure on operators' core networks and spectrum resources; 5G is to deal with the explosive growth of mobile data traffic. The multi-service and multi-technology converged network proposed in response to the growing demand for connection of massive devices is characterized by high speed, ubiquitous network, low power consumption, and low latency. Therefore, efficient and flexible allocation of cellular network resources can improve network performance, reduce system energy consumption, and achieve sustainable development.

然而,在蜂窝网络的资源分配的现有技术只是在频域或者时域进行单一维的资源分配来提升系统的性能,其中,纯时域资源分配没有考虑子载波上的频率选择性衰落,纯频域资源分配没有考虑用户各自对不同应用所需的服务质量(Quality of Service,QoS)不同可能导致资源浪费或资源不足。However, the existing technology of resource allocation in cellular networks only performs single-dimensional resource allocation in the frequency domain or time domain to improve the performance of the system. The pure time domain resource allocation does not consider the frequency selective fading on the subcarriers, and the pure The frequency domain resource allocation does not take into account the different Quality of Service (QoS) required by users for different applications, which may lead to waste of resources or insufficient resources.

有鉴于此,本发明人针对上述蜂窝网络存在的资源分配问题进行深入构思,遂有本案产生。In view of this, the inventor of the present invention has deeply conceived the problem of resource allocation existing in the above-mentioned cellular network, and this case came into being.

发明内容SUMMARY OF THE INVENTION

针对现有技术存在的问题,本发明的目的在于提供一种用于单个蜂窝小区的蜂窝网络时频域资源分配的优化方法,其将资源分配和发送功率控制相结合,最大限度降低系统能耗。In view of the problems existing in the prior art, the purpose of the present invention is to provide an optimization method for resource allocation in the time-frequency domain of a cellular network for a single cell, which combines resource allocation and transmission power control to minimize system energy consumption .

为实现上述目的,本发明采用的技术方案是:For achieving the above object, the technical scheme adopted in the present invention is:

一种用于单个蜂窝小区的蜂窝网络时频域资源分配的优化方法,其法包括以下步骤:A method for optimizing cellular network time-frequency domain resource allocation for a single cell, the method comprising the following steps:

步骤1、求取蜂窝网络中所有蜂窝用户在其各自的资源分配下的能耗总和;Step 1. Obtain the total energy consumption of all cellular users in the cellular network under their respective resource allocations;

将整个通信系统中的能源消耗用所有蜂窝用户各自的能耗求和公式来表示,则通信系统中的总能耗可以表示为:The energy consumption in the entire communication system is expressed by the summation formula of the respective energy consumption of all cellular users, then the total energy consumption in the communication system can be expressed as:

Figure GDA0003093022660000021
Figure GDA0003093022660000021

Figure GDA0003093022660000022
Figure GDA0003093022660000022

Figure GDA0003093022660000023
Figure GDA0003093022660000023

Figure GDA0003093022660000024
Figure GDA0003093022660000024

其中,Ei为蜂窝用户i的能耗,Pi为蜂窝用户i的发送功率,表示为Among them, E i is the energy consumption of cellular user i, and P i is the transmit power of cellular user i, expressed as

Figure GDA0003093022660000025
Figure GDA0003093022660000025

si·Pi,cir为用户i在发送数据的打开时间内所产生的电路能量消耗,(T-si)Pi,idle为蜂窝用户i在剩余时间内的空闲功率;M为蜂窝用户的数量,si为蜂窝用户i的设备打开时间,0≤si≤T,蜂窝网络中每个单蜂窝用户只有向基站传输的时候,才打开自己的发送设备;T为资源块传输时的时隙数量,Pi,cir为上行链路中,蜂窝用户在发送资源时其他电路块所消耗的功率;当蜂窝用户没有数据发送或数据全部发送完毕后,其关闭所有发送电路块以节省能量,但此时因泄漏电流的存在而造成的能量消耗称为蜂窝用户的空闲功率,表示为Pi,idle

Figure GDA0003093022660000031
中的X和P分别指问题所要优化的资源分配变量集
Figure GDA0003093022660000032
和功率变量集P=(pi,k),
Figure GDA0003093022660000033
为蜂窝用户i在资源块的第k个子载波上第t个时隙的分配情况,Ri,min表示蜂窝用户i的最小速率要求;s i ·P i,cir is the circuit energy consumption generated by user i during the open time of sending data, (Ts i ) P i,idle is the idle power of cellular user i in the remaining time; M is the number of cellular users , s i is the device opening time of the cellular user i, 0≤s i ≤T, each single-cellular user in the cellular network only turns on its own sending device when it transmits to the base station; T is the time slot when the resource block is transmitted Quantity, Pi ,cir is the power consumed by other circuit blocks when the cellular user transmits resources in the uplink; when the cellular user has no data to send or after all data is sent, it closes all sending circuit blocks to save energy, but At this time, the energy consumption caused by the existence of leakage current is called the idle power of the cellular user, which is expressed as P i,idle ;
Figure GDA0003093022660000031
X and P respectively refer to the resource allocation variable set to be optimized by the problem
Figure GDA0003093022660000032
and the power variable set P=(pi ,k ),
Figure GDA0003093022660000033
is the allocation of the t-th time slot on the k-th subcarrier of the resource block by the cellular user i, R i,min represents the minimum rate requirement of the cellular user i;

蜂窝网络中同一个时隙上的处于不同子载波的多个蜂窝用户之间没有干扰现象,ri,k为蜂窝用户i在子载波k上的可达速率,可表示为In the cellular network, there is no interference between multiple cellular users in different subcarriers in the same time slot, and ri ,k is the achievable rate of cellular user i on subcarrier k, which can be expressed as

Figure GDA0003093022660000036
Figure GDA0003093022660000036

其中,pi,k为蜂窝用户i在子载波k上的发射功率,k∈K,i∈M,N0为高斯白噪声的功率谱密度,gi,k为用蜂窝户i在子载波k上的信道增益,W为子载波的带宽,K为一个资源块的子载波数量;Among them, pi ,k is the transmit power of cellular user i on subcarrier k, k∈K, i∈M, N 0 is the power spectral density of white Gaussian noise, g i,k is the power spectral density of cellular user i on subcarrier k The channel gain on k, W is the bandwidth of the subcarrier, and K is the number of subcarriers in a resource block;

步骤2、定义矩阵Step 2. Define the matrix

Figure GDA0003093022660000034
为K×T的矩阵,表示蜂窝用户i在一个资源块中的资源分配情况,其中,i=1,2,…,M;k=1,2,…,K;t=1,2,…T;根据
Figure GDA0003093022660000035
可以令Ci,k=Ai T·E统计用户i在各个子载波上传输的时间,将公式(1)的优化模型转写为:
Figure GDA0003093022660000034
is a K×T matrix, representing the resource allocation of cellular user i in a resource block, where i=1,2,...,M; k=1,2,...,K; t=1,2,... T; according to
Figure GDA0003093022660000035
C i,k =A i T ·E can be used to count the transmission time of user i on each subcarrier, and the optimization model of formula (1) can be transcribed as:

Figure GDA0003093022660000041
Figure GDA0003093022660000041

步骤3、通过拉格朗日对偶算法可以得出每个蜂窝用户在各个子载波上的最优发送功率Popt=(pi,k)以满足蜂窝用户各自的速率要求;Step 3. Through the Lagrangian dual algorithm, the optimal transmit power P opt =(pi ,k ) of each cellular user on each subcarrier can be obtained to meet the respective rate requirements of the cellular users;

将公式(4)对应的问题分解为M个独立的子问题,并针对每一个子问题的优化模型写成对应的拉格朗日函数,在每个子问题的优化模型中设置当前迭代次数count=0,最大迭代次数为countmax,以及收敛误差e1=e-10;在每一次迭代中对pi,k求偏导令等式为0,则可得到Decompose the problem corresponding to formula (4) into M independent sub-problems, and write the corresponding Lagrangian function for the optimization model of each sub-problem, and set the current iteration count=0 in the optimization model of each sub-problem , the maximum number of iterations is countmax, and the convergence error e1=e- 10 ; in each iteration, the partial derivative of p i,k is 0, and the equation can be obtained

Figure GDA0003093022660000042
Figure GDA0003093022660000042

其中,

Figure GDA0003093022660000043
为当前第i个子问题对应的优化模型的解,即用户i在子信道k上的发送功率,λi是指拉格朗日函数中的对偶变量;in,
Figure GDA0003093022660000043
is the solution of the optimization model corresponding to the current i-th sub-problem, that is, the transmit power of user i on sub-channel k, and λ i refers to the dual variable in the Lagrangian function;

步骤4、利用次梯度方法更新拉格朗日对偶变量:Step 4. Use the subgradient method to update the Lagrangian dual variables:

定义一个极小的步长μn以保证次梯度方法最优值的收敛性,拉格朗日对偶变量的更新根据下式进行:An extremely small step size μ n is defined to ensure the convergence of the optimal value of the subgradient method, and the update of the Lagrangian dual variables is performed according to the following formula:

Figure GDA0003093022660000044
Figure GDA0003093022660000044

λi(n+1)=[λi(n)+μnd(λi(n))]+,i=1,2,...,M (7);λ i (n+1)=[λ i (n)+μ n d(λ i (n))] + , i=1,2,...,M (7);

在每一次迭代中,利用更新后的对偶变量,更新公式(5),最后子问题对应的优化模型的解将收敛为唯一的最优解;In each iteration, the updated dual variable is used to update the formula (5), and the solution of the optimization model corresponding to the final sub-problem will converge to the unique optimal solution;

步骤5、若相对对偶间隙||λi(n)-λi(n-1)||≤e1或者当前迭代次数超过了countmax,则停止迭代,当前蜂窝用户在资源块中分配的情况得到的最优发送功率可行解Popt=(pi,k)应用到通信系统中,并通过式(1)计算当前系统所有蜂窝用户的总能耗;否则继续步骤3-4;Step 5. If the relative dual gap ||λ i (n)-λ i (n-1)||≤e1 or the current number of iterations exceeds countmax, the iteration is stopped, and the current cellular user is allocated in the resource block. The optimal transmit power feasible solution P opt =(pi ,k ) is applied to the communication system, and the total energy consumption of all cellular users in the current system is calculated by formula (1); otherwise, proceed to step 3-4;

步骤6、通过合作博弈论调整并优化蜂窝用户的资源分配;Step 6. Adjust and optimize the resource allocation of cellular users through cooperative game theory;

定义一个最大失败次数fail_max,并随机抽取一个资源块,获取该资源块所对应的子载波和时隙,以及目前它分配给的蜂窝用户User_ori,将这个资源块重新随机分配给除原有用户外的任意一个用户User_new,更新这两个用户的资源占用列表,并利用步骤3-5得出对应的最优发送功率,对比重新分配后的系统总能耗E_new和原先系统总能耗E_ori,对比情况分三种:Define a maximum number of failures fail_max, and randomly extract a resource block to obtain the subcarrier and time slot corresponding to the resource block, as well as the cellular user User_ori currently assigned to it, and reassign this resource block randomly to all users except the original user. For any user User_new, update the resource occupancy list of the two users, and use steps 3-5 to obtain the corresponding optimal transmission power, compare the total energy consumption E_new of the system after redistribution and the total energy consumption E_ori of the original system, and compare There are three situations:

若E_new<E_ori,则将该资源块从原来的用户User_ori资源占有列表中除去,加入到用户User_new的资源占有列表中,更新系统的总能耗,设置当前失败次数fail=0;If E_new<E_ori, remove the resource block from the original user User_ori resource occupation list, add it to the resource occupation list of user User_new, update the total energy consumption of the system, and set the current number of failures fail=0;

若E_new=E_ori,更新当前失败次数;If E_new=E_ori, update the current number of failures;

若E_new>E_ori,则将该资源块从用户User_new资源占有列表中除去,加入到用户User_ori的资源占有列表中;If E_new>E_ori, remove the resource block from the resource possession list of the user User_new and add it to the resource possession list of the user User_ori;

如果当前失败次数达到最大失败次数,则停止博弈论,得到最后的用户分配情况和其各自的最优发送功率,使系统用户总能耗最小。If the current number of failures reaches the maximum number of failures, the game theory is stopped, and the final user allocation and their respective optimal transmission powers are obtained to minimize the total energy consumption of system users.

采用上述方案后,本发明将蜂窝网络的功耗优化模型转化为结合时频域的单蜂窝用户上行链路传输系统能耗最小化模型,涉及资源分配和发送功率控制,首先根据拉格朗日对偶算法的思想得出各个蜂窝用户在各个频谱上的最优发送功率,然后结合合作博弈论对优化模型进行求解。对比常见的单一维资源分配,通过本发明的时频域资源分配优化方法极大的减小了系统的能源消耗。After adopting the above scheme, the present invention transforms the power consumption optimization model of the cellular network into the energy consumption minimization model of the single-cell user uplink transmission system combined with the time-frequency domain, which involves resource allocation and transmission power control. The idea of the dual algorithm obtains the optimal transmit power of each cellular user in each frequency spectrum, and then combines the cooperative game theory to solve the optimization model. Compared with the common single-dimensional resource allocation, the energy consumption of the system is greatly reduced by the time-frequency domain resource allocation optimization method of the present invention.

附图说明Description of drawings

图1为单蜂窝用户通信系统结构示意图;1 is a schematic structural diagram of a single cellular user communication system;

图2为单蜂窝用户的资源分配例图;FIG. 2 is an example diagram of resource allocation for a single cellular user;

图3为单蜂窝用户控制功率的流程图。Figure 3 is a flow chart of a single-cell user controlling power.

具体实施方式Detailed ways

本发明揭示了一种用于单个蜂窝小区的蜂窝网络时频域资源分配的优化方法,其在单个蜂窝小区内多个蜂窝用户的蜂窝网络中,以优化系统能耗为目标,考虑任意频谱上的任意时刻只能被单一蜂窝用户用于传输,用户可以占用多个子信道上的多个时间段进行传输,系统所有用户的总能耗不仅和蜂窝用户在该资源块中分配情况有关,还取决于其各自的发送功率,同时考虑这两方面的因素,在保证各个用户通信质量的前提下,优化系统每个用户在各个频谱上的发射功率,调整用户的资源分配情况以最小化系统的总能耗。The present invention discloses an optimization method for resource allocation in the time-frequency domain of a cellular network in a single cell. In the cellular network of multiple cellular users in a single cell, the aim is to optimize the energy consumption of the system and consider any frequency spectrum. At any time, it can only be used for transmission by a single cellular user, and a user can occupy multiple time periods on multiple sub-channels for transmission. The total energy consumption of all users in the system is not only related to the allocation of cellular users in this resource block, but also depends on Based on their respective transmit powers, and considering these two factors at the same time, under the premise of ensuring the communication quality of each user, optimize the transmit power of each user in the system on each spectrum, and adjust the resource allocation of users to minimize the total system. energy consumption.

如图1所示,蜂窝网络由一个基站和M个蜂窝用户组成。M个蜂窝用户共享一个资源块,这里所说的一个资源块存在K个正交子载波(Subcarrier)和T个时隙,T个时隙构成Ts的数据传输时间,且每个子载波的带宽为W,各个用户在不同的子载波上会有不同的信道增益和功率。如图2所示,每个子载波上的任何时间段可以被分配给任意一个用户,该子载波的剩余时间可以用户之间分享,即一个用户可以占用多个子载波上的多个时间段。所有的信道信息都是已知的,在一个频域上连续12个子载波,时域上一个时隙组成的总资源块(Resource Block,RB)内基站可以给不同用户分配适合的频段,并确定每个用户在该频段的发送功率即相应的时间,使每个用户能够在一个RB内完成各自的传输。As shown in Figure 1, a cellular network consists of one base station and M cellular users. M cellular users share a resource block. Here, a resource block has K orthogonal subcarriers (Subcarriers) and T time slots. The T time slots constitute the data transmission time of Ts, and the bandwidth of each subcarrier is W, each user will have different channel gain and power on different subcarriers. As shown in Figure 2, any time period on each subcarrier can be allocated to any user, and the remaining time of the subcarrier can be shared among users, that is, one user can occupy multiple time periods on multiple subcarriers. All channel information is known. In a total resource block (Resource Block, RB) consisting of 12 consecutive subcarriers in a frequency domain and a time slot in the time domain, the base station can allocate suitable frequency bands to different users, and determine The transmit power of each user in this frequency band is the corresponding time, so that each user can complete their own transmission within one RB.

本发明的优化方法具体包括以下步骤:The optimization method of the present invention specifically comprises the following steps:

步骤1、求取蜂窝网络中所有蜂窝用户在其各自的资源分配下的能耗总和。Step 1. Obtain the total energy consumption of all cellular users in the cellular network under their respective resource allocations.

在蜂窝网络的上行传输链路中,每个用户i的能耗可以分为三部分,一是传输功耗Pi;二是在用户用于传输时的打开时间内电路的固定功耗siPi,cir,三是在剩余时间内的空闲功耗(T-si)Pi,idle。其中,si,0≤si≤T为蜂窝用户i的设备打开时间,蜂窝网络中每个单蜂窝用户只有向基站传输的时候,才打开自己的发送设备。In the uplink transmission link of the cellular network, the energy consumption of each user i can be divided into three parts, one is the transmission power consumption P i ; P i,cir , and the third is the idle power consumption (Ts i ) P i,idle in the remaining time. Among them, s i , 0≤s i ≤T is the device turn-on time of the cellular user i, and each single-cell user in the cellular network turns on its own sending device only when it transmits to the base station.

将整个通信系统中的能源消耗用所有蜂窝用户各自的能耗求和公式来表示,则通信系统中的总能耗可以表示为:The energy consumption in the entire communication system is expressed by the summation formula of the respective energy consumption of all cellular users, then the total energy consumption in the communication system can be expressed as:

Figure GDA0003093022660000071
Figure GDA0003093022660000071

Figure GDA0003093022660000072
Figure GDA0003093022660000072

Figure GDA0003093022660000073
Figure GDA0003093022660000073

Figure GDA0003093022660000074
Figure GDA0003093022660000074

式(1)中,si·Pi,cir为用户i在发送数据的打开时间内所产生的电路能量消耗,(T-si)Pi,idle为蜂窝用户i在剩余时间内的空闲功率;M为蜂窝用户的数量,si为蜂窝用户i的设备打开时间,0≤si≤T,蜂窝网络中每个单蜂窝用户只有向基站传输的时候,才打开自己的发送设备;T为资源块传输时的时隙数量,Pi,cir为上行链路中,蜂窝用户在发送资源时其他电路块所消耗的功率;当蜂窝用户没有数据发送或数据全部发送完毕后,其关闭所有发送电路块以节省能量,但此时因泄漏电流的存在而造成的能量消耗称为蜂窝用户的空闲功率,表示为Pi,idle

Figure GDA0003093022660000081
中的X和P分别指问题所要优化的资源分配变量集
Figure GDA0003093022660000082
和功率变量集P=(pi,k),
Figure GDA0003093022660000083
为蜂窝用户i在资源块的第k个子载波上第t个时隙的分配情况,Ri,min表示蜂窝用户i的最小速率要求。In formula (1), s i ·P i,cir is the circuit energy consumption generated by user i in the open time of sending data, (Ts i ) P i,idle is the idle power of cellular user i in the remaining time; M is the number of cellular users, s i is the device opening time of cellular user i, 0≤s i ≤T, each single-cellular user in the cellular network only turns on its own sending device when it transmits to the base station; T is the resource The number of time slots during block transmission, P i,cir is the power consumed by other circuit blocks when the cellular user sends resources in the uplink; when the cellular user has no data to send or all data is sent, it closes all sending circuits block to save energy, but the energy consumption caused by the existence of leakage current is called the idle power of cellular users, expressed as P i,idle ;
Figure GDA0003093022660000081
X and P respectively refer to the resource allocation variable set to be optimized by the problem
Figure GDA0003093022660000082
and the power variable set P=(pi ,k ),
Figure GDA0003093022660000083
is the allocation of the t-th time slot on the k-th subcarrier of the resource block for the cellular user i, R i,min represents the minimum rate requirement of the cellular user i.

Pi可以用下式表示:P i can be expressed as:

Figure GDA0003093022660000084
Figure GDA0003093022660000084

定义

Figure GDA0003093022660000085
为K×T的矩阵,表示蜂窝用户i在一个资源块中的资源分配情况,其中,i=1,2,…,M;k=1,2,…,K;t=1,2,…T;;蜂窝网络中同一个时隙上的处于不同子载波的多个蜂窝用户之间没有干扰现象,ri,k为用户i在子载波上k上的可达速率,可表示为definition
Figure GDA0003093022660000085
is a K×T matrix, representing the resource allocation of cellular user i in a resource block, where i=1,2,...,M; k=1,2,...,K; t=1,2,... T;; There is no interference between multiple cellular users in different subcarriers on the same time slot in the cellular network, ri ,k are the achievable rates of user i on subcarrier k, which can be expressed as

Figure GDA0003093022660000086
Figure GDA0003093022660000086

其中,pi,k为用户i在子载波k上的发射功率,k∈K,i∈M,N0为高斯白噪声的功率谱密度,gi,k为用户i在子载波k上的信道增益。where pi ,k is the transmit power of user i on subcarrier k, k∈K, i∈M, N 0 is the power spectral density of white Gaussian noise, g i,k is the transmit power of user i on subcarrier k channel gain.

步骤2、根据蜂窝用户在一个资源块中的可能资源分配情况

Figure GDA0003093022660000087
可以令Ci,k=Ai T·E统计用户i在各个子载波上传输的时间,将三维资源分配矩阵转化为二维资源分配矩阵,优化问题可以转写为:Step 2. According to the possible resource allocation of cellular users in a resource block
Figure GDA0003093022660000087
C i,k =A i T ·E can be used to count the transmission time of user i on each subcarrier, and the three-dimensional resource allocation matrix can be transformed into a two-dimensional resource allocation matrix. The optimization problem can be transcribed as:

Figure GDA0003093022660000091
Figure GDA0003093022660000091

步骤3、通过拉格朗日对偶算法可以得出每个蜂窝用户在各个子载波上的最优发送功率Popt=(pi,k)以满足蜂窝用户各自的速率要求,Step 3. Through the Lagrangian dual algorithm, the optimal transmit power P opt =(pi ,k ) of each cellular user on each sub-carrier can be obtained to meet the respective rate requirements of the cellular users,

将公式(4)对应的问题分解为M个独立的子问题,并针对每一个子问题的优化模型写成对应的拉格朗日函数,在每个子问题的优化模型中设置当前迭代次数count=0,最大迭代次数为countmax,以及收敛误差e1=e-10;在每一次迭代中对pi,k求偏导令等式为0,则可得到Decompose the problem corresponding to formula (4) into M independent sub-problems, and write the corresponding Lagrangian function for the optimization model of each sub-problem, and set the current iteration count=0 in the optimization model of each sub-problem , the maximum number of iterations is countmax, and the convergence error e1=e- 10 ; in each iteration, the partial derivative of p i,k is 0, and the equation can be obtained

Figure GDA0003093022660000092
Figure GDA0003093022660000092

其中,

Figure GDA0003093022660000093
为当前第i个子问题对应的优化模型的解,即用户i在子信道k上的发送功率,λi是指拉格朗日函数中的对偶变量。in,
Figure GDA0003093022660000093
is the solution of the optimization model corresponding to the current i-th sub-problem, that is, the transmit power of user i on sub-channel k, and λ i refers to the dual variable in the Lagrangian function.

步骤4、同时,利用次梯度方法更新拉格朗日对偶变量:Step 4. At the same time, use the subgradient method to update the Lagrangian dual variable:

定义一个极小的步长μn以保证次梯度方法最优值的收敛性,拉格朗日对偶变量的更新根据下式进行:An extremely small step size μ n is defined to ensure the convergence of the optimal value of the subgradient method, and the update of the Lagrangian dual variables is performed according to the following formula:

Figure GDA0003093022660000094
Figure GDA0003093022660000094

λi(n+1)=[λi(n)+μnd(λi(n))]+,i=1,2,...,M (7)λ i (n+1)=[λ i (n)+μ n d(λ i (n))] + ,i=1,2,...,M (7)

步骤5、若相对对偶间隙||λi(n)-λi(n-1)||≤e1或者当前迭代次数超过了countmax,则停止迭代,当前蜂窝用户在资源块中分配的情况得到的发送功率可行解Popt=(pi,k)应用到通信系统中,并通过式(1)计算当前系统所有蜂窝用户的总能耗;否则继续步骤3、4。Step 5. If the relative dual gap ||λ i (n)-λ i (n-1)||≤e1 or the current number of iterations exceeds countmax, the iteration is stopped, and the current cellular user is allocated in the resource block. The feasible solution of transmit power P opt =(pi ,k ) is applied to the communication system, and the total energy consumption of all cellular users in the current system is calculated by formula (1); otherwise, proceed to steps 3 and 4.

步骤2~5属于已知资源分配,优化功率控制部分,该部分的流程图如图3所示。Steps 2 to 5 belong to the known resource allocation, optimizing power control part, and the flowchart of this part is shown in FIG. 3 .

步骤6、通过合作博弈论调整并优化蜂窝用户的资源分配。Step 6: Adjust and optimize the resource allocation of cellular users through cooperative game theory.

定义一个最大失败次数fail_max=50,在资源块中随机抽取一个小资源块,可以得知它所对应的子载波和时隙,以及目前它分配给了哪个用户User_ori,将这个资源块重新随机分配给除原有用户外的任意一个用户User_new,更新这两个用户的资源占用列表,并利用步骤3、4、5得出对应的最优发送功率,对比重新分配后的系统总能耗E_new和原先系统总能耗E_ori,对比情况分三种:Define a maximum number of failures fail_max=50, randomly select a small resource block from the resource block, you can know the subcarrier and time slot it corresponds to, and which user User_ori it is currently assigned to, and reassign the resource block randomly For any user User_new except the original user, update the resource occupancy list of these two users, and use steps 3, 4, and 5 to obtain the corresponding optimal transmission power, and compare the total energy consumption E_new and The total energy consumption E_ori of the original system is divided into three comparisons:

若E_new<E_ori,则将该资源块从原来的用户User_ori资源占有列表中除去,加入到用户User_new的资源占有列表中,更新系统的总能耗,设置当前失败次数fail=0;If E_new<E_ori, remove the resource block from the original user User_ori resource occupation list, add it to the resource occupation list of user User_new, update the total energy consumption of the system, and set the current number of failures fail=0;

若E_new=E_ori,更新当前失败次数;If E_new=E_ori, update the current number of failures;

若E_new>E_ori,则将该资源块从用户User_new资源占有列表中除去,加入到用户User_ori的资源占有列表中。If E_new>E_ori, the resource block is removed from the resource occupation list of the user User_new and added to the resource occupation list of the user User_ori.

如果当前失败次数已达到最大失败次数,则停止博弈论,得到最后的用户分配情况和其各自的最优发送功率,使系统用户总能耗最小。If the current number of failures has reached the maximum number of failures, the game theory is stopped, and the final user allocation and their respective optimal transmission power are obtained, so as to minimize the total energy consumption of system users.

本发明的关键在于,本发明将蜂窝网络的功耗优化模型转化为结合时频域的单蜂窝用户上行链路传输系统能耗最小化模型,涉及资源分配和发送功率控制,首先根据拉格朗日对偶算法的思想得出各个蜂窝用户在各个频谱上的最优发送功率,然后结合合作博弈论对优化模型进行求解。并且通过实验证明,对比常见的单一维资源分配,通过本发明的时频域资源分配优化方法极大的减小了系统的8-25%的能源消耗。The key point of the present invention is that the present invention converts the power consumption optimization model of the cellular network into the energy consumption minimization model of the single-cell user uplink transmission system combined with the time-frequency domain, which involves resource allocation and transmission power control. The idea of the sun-dual algorithm obtains the optimal transmit power of each cellular user in each frequency spectrum, and then combines the cooperative game theory to solve the optimization model. And it is proved by experiments that, compared with the common single-dimensional resource allocation, the time-frequency domain resource allocation optimization method of the present invention greatly reduces the energy consumption of the system by 8-25%.

以上所述,仅是本发明实施例而已,并非对本发明的技术范围作任何限制,故凡是依据本发明的技术实质对以上实施例所作的任何细微修改、等同变化与修饰,均仍属于本发明技术方案的范围内。The above are only the embodiments of the present invention and do not limit the technical scope of the present invention. Therefore, any minor modifications, equivalent changes and modifications made to the above embodiments according to the technical essence of the present invention still belong to the present invention. within the scope of the technical solution.

Claims (1)

1. A method for optimizing time-frequency domain resource allocation for a cellular network of a single cell, characterized by: the optimization method comprises the following steps:
step 1, solving the sum of energy consumption of all cellular users in a cellular network under respective resource allocation;
by using the energy consumption in the whole communication system as the sum formula of the energy consumption of each cellular user, the total energy consumption in the communication system can be expressed as:
Figure FDA0003093022650000011
wherein E isiFor cellular user i energy consumption, PiThe transmit power for cellular user i, denoted as
Figure FDA0003093022650000012
si·Pi,cirFor the circuit energy consumption generated by user i during the on-time of the transmitted data, (T-s)i)Pi,idleIdle power for cellular user i for the remaining time; m is the number of cellular users, siFor the equipment on time of cellular user i, s is more than or equal to 0iT is less than or equal to T, each single cellular user in the cellular network opens own sending equipment only when transmitting to the base station; t is time of resource block transmissionNumber of slots, Pi,cirIs the power consumed by other circuit blocks when a cellular user transmits resources in the uplink; when the cellular user has no data to transmit or has all data transmitted, it turns off all transmitting circuit blocks to save energy, but the energy consumption caused by the leakage current is called idle power of cellular user, and is denoted as Pi,idle
Figure FDA0003093022650000021
X and P in (1) respectively refer to resource allocation variable sets to be optimized by the problem
Figure FDA0003093022650000022
And power variable set P ═ P (P)i,k),
Figure FDA0003093022650000023
For the allocation situation of the t time slot of the cellular user i on the k subcarrier of the resource block, Ri,minRepresents the minimum rate requirement of cellular user i;
there is no interference phenomenon between multiple cellular users on different sub-carriers in the same time slot in cellular network, ri,kThe achievable rate for cellular user i on subcarrier k can be expressed as
Figure FDA0003093022650000024
Wherein p isi,kTransmitting power of cellular user i on subcarrier K, K belongs to K, i belongs to M and N0Power spectral density, g, of white gaussian noisei,kChannel gain of a cellular user i on a subcarrier K is used, W is the bandwidth of the subcarrier, and K is the number of subcarriers of one resource block;
step 2, defining a matrix
Figure FDA0003093022650000025
Is a K × T matrix, indicating that cellular user i is at oneResource allocation case in resource block, where i ═ 1,2, …, M; k is 1,2, …, K; t is 1,2, … T; according to
Figure FDA0003093022650000026
Can order Ci,k=Ai TE statistics of the time of transmission of user i on each subcarrier, transcribing the optimization model of equation (1) as:
Figure FDA0003093022650000027
step 3, obtaining the optimal transmitting power P of each cellular user on each subcarrier through a Lagrange dual algorithmopt=(pi,k) To meet the respective rate requirements of the cellular users;
decomposing the problem corresponding to the formula (4) into M independent sub-problems, writing an optimization model for each sub-problem into a corresponding lagrangian function, setting the current iteration number count to be 0, the maximum iteration number to be count max, and the convergence error e1 to be e in the optimization model for each sub-problem-10(ii) a For p in each iterationi,kThe deviation derivative equation is 0, then
Figure FDA0003093022650000031
Wherein,
Figure FDA0003093022650000032
the solution of the optimization model corresponding to the current ith sub-problem, i.e. the transmission power of the user i on the sub-channel k, lambdaiIs a dual variable in a Lagrangian function;
and 4, updating Lagrangian dual variables by using a sub-gradient method:
defining a very small step size munIn order to ensure the convergence of the optimal value of the sub-gradient method, the Lagrange dual variable is updated according to the following formula:
Figure FDA0003093022650000033
λi(n+1)=[λi(n)+μnd(λi(n))]+,i=1,2,...,M (7);
in each iteration, the formula (5) is updated by using the updated dual variable, and finally, the solution of the optimization model corresponding to the subproblem is converged into a unique optimal solution;
step 5, if the relative dual gap | | | lambdai(n)-λi(n-1) | < e1 or the current iteration times exceed countmax, stopping iteration, and obtaining the feasible solution P of the optimal sending power under the condition that the current cellular user is distributed in the resource blockopt=(pi,k) The method is applied to a communication system, and the total energy consumption of all cellular users of the current system is calculated by the formula (1); otherwise, continuing the step 3-4;
step 6, adjusting and optimizing the resource allocation of the cellular users through a cooperative game theory;
defining a maximum failure frequency fail _ max, randomly extracting a resource block, acquiring a subcarrier and a time slot corresponding to the resource block and a cellular User _ ori allocated to the resource block at present, randomly allocating the resource block to any User _ new except an original User again, updating resource occupation lists of the two users, obtaining corresponding optimal transmitting power by using the steps 3-5, and comparing the total system energy consumption E _ new after reallocation with the total system energy consumption E _ ori in the original system, wherein the comparison conditions are divided into three types:
if E _ new < E _ ori, removing the resource block from the original User _ ori resource occupation list, adding the resource block into the User _ new resource occupation list, updating the total energy consumption of the system, and setting the current failure frequency fail to be 0;
if E _ new is equal to E _ ori, updating the current failure times;
if E _ new > E _ ori, removing the resource block from the User _ new resource occupation list, and adding the resource block into the resource occupation list of the User _ ori;
and if the current failure times reach the maximum failure times, stopping the game theory, and obtaining the final user allocation condition and the respective optimal sending power of the users, so that the total energy consumption of the system users is minimum.
CN202010112316.5A 2020-02-24 2020-02-24 An optimization method for cellular network time-frequency domain resource allocation for a single cell Active CN111314938B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010112316.5A CN111314938B (en) 2020-02-24 2020-02-24 An optimization method for cellular network time-frequency domain resource allocation for a single cell

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010112316.5A CN111314938B (en) 2020-02-24 2020-02-24 An optimization method for cellular network time-frequency domain resource allocation for a single cell

Publications (2)

Publication Number Publication Date
CN111314938A CN111314938A (en) 2020-06-19
CN111314938B true CN111314938B (en) 2021-08-20

Family

ID=71147721

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010112316.5A Active CN111314938B (en) 2020-02-24 2020-02-24 An optimization method for cellular network time-frequency domain resource allocation for a single cell

Country Status (1)

Country Link
CN (1) CN111314938B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114071476B (en) * 2021-11-03 2024-09-24 厦门大学 Time-frequency two-dimensional communication resource allocation method based on energy consumption
CN115002814B (en) * 2022-06-09 2024-06-18 中国联合网络通信集团有限公司 Resource load determination method, device and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103619024A (en) * 2013-11-27 2014-03-05 北京邮电大学 Method for distributing spectrum resources between cellular users and D2D users in same cell
WO2018120935A1 (en) * 2016-12-31 2018-07-05 山东大学 Resource allocation and energy management method for collaborative cellular network

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105472751B (en) * 2015-12-24 2018-08-31 山东大学 The distribution method of D2D communication system federated resources based on cellular network
CN107708157A (en) * 2017-11-22 2018-02-16 重庆邮电大学 Intensive small cell network resource allocation methods based on efficiency
AU2018436721B2 (en) * 2018-08-17 2024-09-19 Guangdong Oppo Mobile Telecommunications Corp.,Ltd. Discontinuous transmission method and device
CN109842931B (en) * 2019-03-13 2021-07-09 南京邮电大学 A NOMA-based D2D Cellular System Resource Allocation Method
CN110012509B (en) * 2019-04-11 2022-04-19 重庆邮电大学 Resource allocation method based on user mobility in 5G small cellular network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103619024A (en) * 2013-11-27 2014-03-05 北京邮电大学 Method for distributing spectrum resources between cellular users and D2D users in same cell
WO2018120935A1 (en) * 2016-12-31 2018-07-05 山东大学 Resource allocation and energy management method for collaborative cellular network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《Resource Allocation for Device-to-Device》;Tanhui Liu等;《IEEE》;20150226;全文 *

Also Published As

Publication number Publication date
CN111314938A (en) 2020-06-19

Similar Documents

Publication Publication Date Title
Zhang et al. Energy-efficient resource allocation in NOMA heterogeneous networks
CN109905918B (en) NOMA cellular Internet of vehicles dynamic resource scheduling method based on energy efficiency
JP5097822B2 (en) Method for solving the inability to control the power spectral density of a terminal in an OFDMA system
CN103369542B (en) Based on game theoretic with frequency heterogeneous network power distribution method
CN112601284A (en) Downlink multi-cell OFDMA resource allocation method based on multi-agent deep reinforcement learning
CN110062359B (en) High-reliability low-delay wireless resource allocation optimization method based on NOMA short coding block transmission in MTC
CN108737057A (en) Multicarrier based on deep learning recognizes NOMA resource allocation methods
CN106231610B (en) Cluster-based resource allocation method in Femtocell dual-layer network
Wei et al. A two-stage cluster-based resource management scheme in ultra-dense networks
CN102695131B (en) Distributed power control method in cognitive network on basis of cooperative game
CN102355718B (en) Method for coordinating uplink interference by combining high interference indication and overload indication
CN104796990B (en) D2D resource allocation methods based on Power Control in honeycomb heterogeneous network
CN107708157A (en) Intensive small cell network resource allocation methods based on efficiency
CN105208636B (en) The method that efficiency cooperative base station sleep mechanism improves system energy efficiency in dense network
CN104378772A (en) Cell-oriented amorphous coverage small base station deployment method in cellular network
CN107343268B (en) Non-orthogonal multicast and unicast transmission beamforming method and system
CN111314938B (en) An optimization method for cellular network time-frequency domain resource allocation for a single cell
Kong et al. Cooperative rate-splitting multiple access in heterogeneous networks
CN107071881B (en) A Game Theory-Based Distributed Energy Allocation Method for Small Cell Networks
CN103619066A (en) Method for distributing downlink interference mitigation based on distributed channel
CN109743736A (en) A User-Centric User Access and Resource Allocation Method for Ultra-Dense Networks
CN103281764A (en) Uplink power control method in femtocell double layered network based on convex pricing
CN106413098A (en) Resource distribution method based on outage probability in D2D network
CN107148078B (en) User access control method and device for hybrid full-duplex and half-duplex network
CN110324888B (en) Uplink user clustering method for maximizing feasible region of power distribution of NOMA (non-orthogonal multiple access) sub-channel

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