CN106954232B - Time delay optimized resource allocation method - Google Patents

Time delay optimized resource allocation method Download PDF

Info

Publication number
CN106954232B
CN106954232B CN201710217276.9A CN201710217276A CN106954232B CN 106954232 B CN106954232 B CN 106954232B CN 201710217276 A CN201710217276 A CN 201710217276A CN 106954232 B CN106954232 B CN 106954232B
Authority
CN
China
Prior art keywords
user
service
wireless resource
scheduled
time slot
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
CN201710217276.9A
Other languages
Chinese (zh)
Other versions
CN106954232A (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201710217276.9A priority Critical patent/CN106954232B/en
Publication of CN106954232A publication Critical patent/CN106954232A/en
Application granted granted Critical
Publication of CN106954232B publication Critical patent/CN106954232B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/26—TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service]
    • H04W52/265—TPC 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies

Landscapes

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

Abstract

The invention discloses a resource allocation method for time delay optimization, which relates to the technical field of wireless communication; firstly, a wireless resource manager determines a user to be scheduled on a current time slot, calculates a priority factor of each service of the user to be scheduled according to QSIs (quad Small form-factor) of all the users to be scheduled on the current time slot and a previous time slot, generates a priority sequence table of user services, and is used for guiding the control of the wireless resource manager on transmission power required by data of the service with the highest priority of the user to be scheduled and a decision of wireless resource block allocation, and then sends a resource allocation result to the corresponding user to be scheduled; finally, updating the QSI of the cache queue corresponding to each service of each user; the invention ensures the boundedness of all buffer queues in the network so as to reduce the average transmission delay of the service, and leads the energy efficiency performance of the network to approach the optimal value on the premise of realizing the stability of the network.

Description

Time delay optimized resource allocation method
Technical Field
The invention relates to the technical field of wireless communication, in particular to a time delay optimized resource allocation method in a wireless access network.
Background
According to the research report published by Cisco in 2016, that more than 55% of data traffic is currently from video streaming and voice conversation services, such delay sensitive real-time services will remain exponentially growing in the next 5 years, and it is expected that by 2020, real-time services will generate more than 75% of the total data traffic. Therefore, in order to ensure that real-time services operated by intelligent terminals such as smart phones, tablet computers and wearable devices can bring more excellent user experience to customers, the mobile internet application puts higher requirements on the time delay performance of the wireless network.
The low delay requirement of real-time services on wireless networks makes the traditional resource allocation method no longer able to effectively guarantee the overall performance of wireless networks. The basic starting point of the conventional resource allocation method is to flexibly and dynamically adjust available resources of a wireless network for served users according to acquired physical layer Information, such as Channel State Information (CSI) and inter-cell interference conditions, and optimize spectrum efficiency or energy efficiency of the network.
However, this resource allocation method cannot perform resource allocation that effectively reduces the service transmission delay according to the actual delay condition of the service requested by the user, and cannot perform a delay-optimized resource allocation strategy for the delay characteristic of the service requested by the user. The resource allocation method that optimizes the physical layer performance index only by using the physical layer information cannot provide high-level service quality assurance for the user, and cannot further improve the delay performance of the wireless network. Therefore, it is necessary to provide a resource allocation method capable of performing delay optimization according to the delay characteristics of the Service requested by the user and the Queue State Information (QSI) of the corresponding buffer Queue, so as to reduce the transmission delay of the Service requested by the user, implement the stability of the network, and provide better Quality of Service (QoS) for the user.
At present, most of resource allocation methods for performing delay optimization aiming at real-time services generally consider the delay condition of a user, the priority of the services and the current CSI of the user, and can meet the QoS requirements of the user on the real-time services and realize better overall performance of the network.
As an index currently widely studied by academia and industry, energy efficiency is used to estimate how energy is efficiently utilized, and both the total rate and the overall energy consumption of the optimized network need to be considered. Therefore, it is desirable to provide a new resource allocation method for optimizing time delay, which can ensure that the average transmission time delay of each user service is within a set threshold range, and improve the energy efficiency performance of the network to the greatest extent.
Disclosure of Invention
In view of this, the present invention provides a resource allocation method for time delay optimization, which is a resource allocation method for realizing network energy efficiency and average transmission time delay balance, and the method dynamically controls allocation of wireless resources according to CSI and QSI of each user, aiming at maximizing network energy efficiency, and simultaneously optimizing the average transmission time delay of a service as required according to different service time delay characteristics, so as to ensure that the average transmission time delay of the service does not exceed a set threshold.
The method comprises the following specific steps:
step one, a wireless resource manager counts service types which can be sensed by a network and have different time delay characteristics;
the service types are N; denoted as {1,2, …, N, …, N }; n is a service serial number; k users are attached to the system; denoted as {1,2, …, K, …, K }; and k is the user identification.
Step two, aiming at each resource allocation time slot, the wireless resource manager configures service control parameters for each service at the starting moment and determines the set of all available wireless resource blocks in the current time slot;
(1) the wireless resource manager configures service control parameters for N services which can be sensed by the network in sequence;
Vna service control parameter for service n;
(2) the wireless resource manager determines the set of all available wireless resource blocks in the current time slot;
numbering all available wireless resource blocks in sequence and counting the number; defining the set of all available wireless resource blocks as {1,2, …, R }, wherein the available wireless resource blocks refer to wireless resource blocks which are not allocated to any user and are in an idle state, and the natural number R is the total number of all available wireless resource blocks in the current time slot;
step three, aiming at each resource allocation time slot, the wireless resource manager acquires the QSI of the cache queue corresponding to each service of each user, determines all users needing to be scheduled and acquires the CSI of all users to be scheduled in the current time slot;
the QSI of the cache queue refers to the backlog quantity of the service data to be transmitted in the cache queue; the CSI is the channel gain of the user on the available wireless resource block;
the wireless resource manager determines all users needing to be scheduled in the current time slot according to whether a cache queue corresponding to each service of each user is empty, and acquires CSI reported by all users to be scheduled in the current time slot;
step four, aiming at each service of each user to be scheduled, the wireless resource manager respectively acquires the QSI of the corresponding buffer queue at the current time slot t and the previous time slot t-1;
step five, the wireless resource manager calculates the priority of each service of each user to be scheduled and determines the service with the highest priority of each user to be scheduled according to the time slot t and the QSI of the time slot t-1;
the formula for calculating the priority of each service of each user k' to be scheduled is as follows:
PRIk′,n(t)＝(Qk′,n(t))2-(Qk′,n(t-1))2
PRIk′,n(t) is the priority factor of the user k' to be scheduled on the time slot t with respect to the service n, Qk′,n(t) is QSI of a buffer queue corresponding to the service n of a user k' to be scheduled on the time slot t;
for each user to be scheduled, the priority of the service corresponding to the maximum priority factor is the highest;
the wireless resource manager selects the wireless resource block with the minimum number value from the available wireless resource block set, and calculates the optimal transmitting power and the utility factor required by transmitting the highest priority service data of each user to be scheduled on the wireless resource block;
the method comprises the following specific steps:
firstly, the wireless resource manager selects the wireless resource block with the minimum serial number value as r from the available wireless resource block set determined in the step two;
then, calculating the required optimal transmitting power when transmitting the data of the highest priority service of each user to be scheduled on a wireless resource block r;
aiming at a user k' to be scheduled, the optimal transmitting power formula required when the data of the service n with the highest priority is transmitted on the wireless resource block r is calculated as follows:
Figure BDA0001262621880000031
Pk′,n,r(t) is the optimal transmitting power needed when the wireless resource block r is used for transmitting the data of the service n with the highest priority of the user k' to be scheduled on the time slot t; w is the bandwidth of radio resource block r; epsilon is an energy efficiency factor with a value between 0 and 1, and the closer the epsilon value is to a natural number 1, the higher the electric energy conversion rate of the system is;
Figure BDA0001262621880000032
is the energy efficiency value of the user k' to be scheduled on the time slot t; sigma2Is the corresponding Gaussian white noise power on the wireless resource block r; gk′,r(t) is the channel gain of the user k' to be scheduled on the wireless resource block r on the time slot t; pmaxMaximum transmit power for a wireless access point;
Pk′,n,rthe value of (t) follows the following formula: the function taking the minimum value is defined as
Figure BDA0001262621880000033
The function of taking the maximum value is defined as
Figure BDA0001262621880000034
Finally, according to the optimal transmitting power required by each user to be scheduled, calculating a utility factor for transmitting the highest priority service data of each user to be scheduled by using a wireless resource block r;
aiming at a user k' to be scheduled, calculating a utility factor when transmitting data of a service with the highest priority on a wireless resource block r, wherein the formula is as follows:
Figure BDA0001262621880000041
Figure BDA0001262621880000042
the utility factor is the utility factor when the data of the highest priority service n of the user k' to be scheduled is transmitted by using the wireless resource block r on the time slot t;
step seven, determining the allocation decision and power control result of the wireless resource block r according to the utility factor when the wireless resource block r with the minimum number value is used for transmitting the highest priority service data of each user to be scheduled, and updating the wireless resource block set by the wireless resource manager;
firstly, sorting utility factors obtained by calculation of all users to be scheduled, and selecting a minimum value; simultaneously obtaining the user serial number corresponding to the minimum utility factor and the value of the service serial number thereof;
when the utility factor obtains the minimum value, the value function of the corresponding user serial number and the service serial number thereof is as follows:
Figure BDA0001262621880000043
then, selecting the user k corresponding to the minimum utility factor*And its highest priority service n*On the basis of (1), judging whether the conditions are met
Figure BDA0001262621880000044
If so, the radio resource manager allocates the radio resource block r to the user k*For transmitting the traffic n with the highest priority*And set on slot t the wireless access point serves user k by radio resource block r*Transmitting service n with highest priority*The optimum transmission power of the data is
Figure BDA0001262621880000045
Otherwise, the radio resource manager does not allocate the radio resource block r to any user to be scheduled;
step eight, the wireless resource manager judges whether all the available wireless resource blocks are traversed or not; if yes, executing step nine; otherwise, returning to the step six;
step nine, the wireless resource manager sends the allocation decision and the power control result of each wireless resource block to the corresponding user to be scheduled;
step ten, counting the data transmission rate of each user in the current time slot t, the total transmission power required to be consumed and calculating the energy efficiency value of the next time slot t + 1;
firstly, for a user k to be scheduled allocated to a wireless resource blockoThe energy efficiency value calculation method is as follows:
Figure BDA0001262621880000046
Figure BDA0001262621880000047
is to acquire a user k at a time slot toThe data transmission rate of (d);
Figure BDA0001262621880000048
is that user k is on time slot toThe required total transmission power, which is defined as
Figure BDA0001262621880000049
For other users i not allocated to radio resource blockoThe energy efficiency value is calculated as follows:
Figure BDA00012626218800000410
step eleven, the wireless resource manager updates the QSI of the cache queue corresponding to each service of each user;
for a user k to be scheduled which is allocated to a radio resource block on a time slot toThe QSI updating method of the cache queue corresponding to the service n with the highest priority level comprises the following steps:
Figure BDA0001262621880000051
Figure BDA0001262621880000052
for user k at current time slot toThe new data arrival rate of the service n with the highest priority;
for a user k to be scheduled which is allocated to a radio resource block on a time slot toIts non-priority highest service noThe QSI updating method of the corresponding cache queue comprises the following steps:
Figure BDA0001262621880000053
for other users i not allocated to radio resource block on time slot toThe QSI updating method of the cache queue corresponding to each service comprises the following steps:
Figure BDA0001262621880000054
step twelve, the wireless resource manager finishes the wireless resource allocation process in the current time slot t, and judges whether all the resource allocation time slots are finished, if yes, the process is finished; otherwise, when entering the starting time of the next wireless resource allocation time slot, the step two is returned to be executed.
The invention has the advantages that:
compared with the prior art, the method not only fully considers the CSI of the user, but also fully utilizes the QSI of the cache queue, and the resource allocation method for optimizing the time delay preferentially allocates the resources to the user to be scheduled which most urgently needs to transmit the service data, so that the boundedness of all the cache queues in the network is ensured, and the average transmission time delay of various services requested by the user is kept within the set threshold. Meanwhile, when power control and wireless resource block allocation are carried out, the aim of reducing the average transmission delay of various services and the high energy efficiency of the network is taken as the target, on the premise of realizing the stability of the network, the energy efficiency performance of the network is close to the optimal value, and the service experience of a user is effectively improved.
Drawings
FIG. 1 is a schematic diagram of an embodiment of a delay-optimized resource allocation method according to the present invention;
fig. 2 is a schematic flow chart of the delay-optimized resource allocation method according to the present invention.
DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION
In order to make the objects, designs and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings and examples.
As shown in fig. 1, when a radio resource manager executes a user scheduling and service priority determining process, the radio resource manager firstly obtains QSIs of each service corresponding to a buffer queue of each user from a baseband processor buffer, determines all users needing to be scheduled on a current time slot, and then obtains CSI reported by all users to be scheduled on the current time slot through an uplink control channel;
the wireless resource manager acquires QSI of a cache queue corresponding to each service of each user to be scheduled from a baseband processor cache region, calculates priority factors of each service of all users to be scheduled, generates a user service priority sequence list according to the numerical values of the priority factors from large to small, and is used for guiding the wireless resource manager to control the transmitting power required by the users to be scheduled and allocate wireless resource blocks, and then sends decision results to all corresponding users to be scheduled through a downlink control channel; and finally, updating the QSI of the cache queue corresponding to each service of each user in the cache region of the baseband processor.
The wireless resource manager executes a resource allocation process, monitors the service request of each user at a moment by taking one time slot as the minimum granularity in time, and a wireless resource allocation algorithm runs according to a period, namely, each time slot updates the resource allocation strategy of a wireless access point once, each wireless resource block occupies one time slot in a time domain, the bandwidth in a frequency domain is W, and the corresponding white Gaussian noise powerIs σ2Each wireless resource block can only be used by one user in one time slot, each user may be allocated to a plurality of wireless resource blocks in one time slot, or may not be allocated to a wireless resource block, and the user allocated to the wireless resource block only transmits data of the service with the highest priority in one time slot.
As shown in fig. 2, the specific operation steps are as follows:
step one, a wireless resource manager counts service types with different time delay characteristics supported by a network;
the method comprises the steps that a service control function entity in a network can sense N service types with different time delay characteristics, a buffer area of a baseband processor can establish a buffer queue for each service requested by each user, the set of all users in the network is {1,2, …, K }, the set of all service types is {1,2, …, N }, wherein a natural number K is the number of all attached users in the network, and a natural number N is the number of all service types.
Step two, aiming at each resource allocation time slot, the wireless resource manager configures service control parameters for each service in turn at the starting time, and determines the set of all available wireless resource blocks in the current time slot;
firstly, the wireless resource manager classifies the services according to the different time delay characteristics of the N services, and configures service control parameters for each service capable of being sensed in sequence;
specifically, the first service is defined as a virtual reality service, the second service is defined as a video streaming service, the third service is positioned as an email service, and so on; the radio resource manager configures the control parameter, V, for each service in turnnIs the service control parameter of service N, N is the sequence number of the request service and N belongs to {1,2, …, N };
the service control parameter is a non-negative number used for balancing the average transmission delay of the service and the network energy efficiency performance, generally speaking, for the service with high real-time requirement, the service control parameter is set to be a smaller value, and for the service with non-real-time performance, the service control parameter can be set to be a larger value; smaller service control parameters can ensure lower average service transmission delay, and larger service control parameters can realize higher energy efficiency performance;
during initialization setting, for services with high real-time requirements such as virtual reality and the like, the corresponding service control parameter is set to be a smaller value so as to ensure that the average transmission delay of the services is lower, and for background-level services such as e-mails and the like, the corresponding service control parameter can be set to be a larger value so as to ensure that the network realizes high energy efficiency performance;
in addition, the service control parameters can be reconfigured at the next resource allocation time slot according to the change of the current network performance requirement, and particularly, if the delay performance requirement of the network operator on the service n is increased, the V can be properly setnReduced to achieve a lower average transmission delay, and similarly, if the energy efficiency performance requirement for the user requesting service n increases, V may be appropriately setnIncreased to achieve higher energy efficiency performance of the network;
then, traversing all wireless resource blocks, and determining a set of all available wireless resource blocks in the current time slot;
the wireless resource manager traverses all wireless resource blocks which can be allocated to the wireless access point planned by a network operator, determines the number of all available wireless resource blocks in the current time slot, performs sequence numbering, and determines the set of all available wireless resource blocks, wherein the available wireless resource blocks refer to wireless resource blocks which can be allocated to any user, namely wireless resource blocks in an idle state;
the set of all available radio resource blocks in the current slot is defined as {1,2, …, R }, where the natural number R is the total number of all available radio resource blocks in the current slot.
Step three, aiming at each resource allocation time slot, the wireless resource manager acquires the QSI of each service corresponding to each user in the current time slot, determines all users needing to be scheduled and acquires the CSI of all users to be scheduled in the current time slot by reporting through an uplink control channel;
the wireless resource manager monitors the request services of all attached users, judges whether a cache queue related to the request services needs to be established for the users or not, then traverses the cache queues corresponding to all the services of all the users, determines the users needing to be scheduled in the current time slot and acquires CSI of all the users to be scheduled in the current time slot.
Specifically, when a user K requests a service n at the starting time of a current wireless resource allocation time slot t, K is a user identifier and belongs to K ∈ {1,2, …, K }; the wireless resource manager accesses the buffer area of the baseband processor and acquires the QSI value Q of the user k at the time slot t relative to the buffer queue corresponding to the request service nk,n(t) if there is no Qk,n(t) the observed value returns, then Q is establishedk,n(t) and assigning Qk,n(t) ═ 0, otherwise, nothing is done;
if there is user to attach network or the service data of user has been transmitted, the wireless resource manager deletes the buffer queue corresponding to the service from the buffer area of base band processor; then, traversing the buffer queues of all services of all users, if a certain user is observed that the buffer queue corresponding to each service is not established, determining that the user is a non-scheduling user in the current time slot, otherwise, determining that the user is a scheduling user in the current time slot;
the resource manager collects the CSI values of all users to be scheduled in the current wireless resource allocation time slot, namely all the users to be scheduled report the CSI values of the users to be scheduled in the current time slot to the wireless resource manager through an uplink control channel, the cache queue corresponds to each service of each user, the QSI of the cache queue refers to the backlog quantity of the service data to be transmitted in the cache queue, and the CSI is the channel gain of the users on the available wireless resource blocks.
Step four, aiming at each service of each user to be scheduled, the wireless resource manager accesses a baseband processor cache region and respectively acquires the QSI (quad Small form-factor interface) of the cache queue corresponding to each service of all the users to be scheduled at the current time slot t and the previous time slot t-1;
step five, the wireless resource manager calculates the priority factor of each service of each user to be scheduled and determines the service with the highest priority of each user to be scheduled according to the time slot t and the QSI of the time slot t-1;
the method for calculating the priority factor of each service of each user to be scheduled comprises the following steps:
according to PRIk,n(t)＝(Qk,n(t))2-(Qk,n(t-1))2Determining a priority factor PRI of a user k with respect to a service n over a time slot tk,n(t)；
For each user to be scheduled, generating a service priority determination priority sequence table from big to small according to the service priority factor of each user, wherein the user service corresponding to the maximum priority factor has the highest priority, and the PRIk,n(t) reflects the degree of traffic data backlog change of a user k's traffic n within a slot interval time, when PRIk,nWhen the value of (t) is larger, it indicates that the backlog increment of the data of the buffer queue corresponding to the service n by the user k is larger, so that the scheduling priority of the service n should be correspondingly higher, thereby effectively reducing the condition that the average transmission delay of the service is large when the buffer queue is in a high full state, and simultaneously effectively reducing the phenomenon that the packet loss occurs to newly arrived service data.
Specifically, for user k, the service corresponding to the maximum priority factor has the highest priority, that is, the service that user k needs to be scheduled most urgently in time slot t is the ith service, wherein,
Figure BDA0001262621880000081
function(s)
Figure BDA0001262621880000082
PRI at time slot t for user kk,n(t) taking the value of the service sequence number at the maximum value.
The wireless resource manager selects the wireless resource block with the minimum number value from the determined available wireless resource block set, calculates the optimal transmitting power required by each user to be scheduled to transmit the service data with the highest priority on the wireless resource block, and calculates the utility factor of each user to be scheduled to use the wireless resource block;
the method comprises the following specific steps:
firstly, the wireless resource manager selects the wireless resource block with the minimum number value from the set of the available wireless resource blocks determined in the step two;
the number of the extracted radio resource block is assumed to be r.
Then, calculating the optimal transmitting power required when each user to be scheduled transmits the data of the service with the highest priority on the minimum wireless resource block r;
the wireless resource manager acquires the service control parameter of the highest priority service of each user to be scheduled, the QSI, the energy efficiency value and the CSI of the corresponding cache queue in the current time slot, and calculates the optimal transmitting power required by the highest priority service data of each user to be scheduled on the wireless resource block;
the optimal transmitting power formula is as follows:
Figure BDA0001262621880000083
wherein, Pk,n,r(t) is the optimal transmitting power needed when transmitting the data of the service n with the highest priority of the user k by using a wireless resource block r on a time slot t, and W is the bandwidth of the wireless resource block r; gk,r(t) is CSI, P, of user k on radio resource block r on time slot tmaxIs the maximum transmit power of the wireless access point,
Figure BDA0001262621880000091
for the energy efficiency value of user k in time slot t, the corresponding white Gaussian noise power on the wireless resource block is sigma2，Pk,n,rThe value of (t) follows the following formula: the function taking the minimum value is defined as
Figure BDA0001262621880000092
The function of taking the maximum value is defined as
Figure BDA0001262621880000093
In particular, transmitting user k with wireless resource block r on slot t has priority of the highestOptimum transmission power P required for data of high service nk,r,n(t) is related to not only CSI of the current time slot t but also QSI, if the channel gain of the user k on the wireless resource block r is larger, the transmission power is also larger to achieve higher data transmission rate and spectrum utilization rate, and in addition, if the QSI of the user k on the service n with the highest priority is larger, the transmission power is also larger, because the data transmission rate is increased by increasing the transmission power, the average transmission delay of the service n can be controlled within a certain range, thereby achieving the stability of the network.
According to the optimal transmitting power required by each user to be scheduled, calculating the utility factor for transmitting the highest priority service data of each user to be scheduled by using the wireless resource block, wherein the specific method comprises the following steps:
Figure BDA0001262621880000094
wherein
Figure BDA0001262621880000095
Is the utility factor when using wireless resource block r to transmit the data of the highest priority service n of user k in time slot t.
In particular, utility factor
Figure BDA0001262621880000096
Is a weighted subtraction of the required transmit power and the achieved data transmission rate for serving user k using radio resource block r, if the utility factor
Figure BDA0001262621880000097
The smaller the numerical value is, the less transmission power can be consumed by the user k to transmit the service n with the highest priority by using the wireless resource block r to obtain the larger data transmission rate, that is, the lower average transmission delay of the service and the higher network energy efficiency can be realized, and the more the user k should be allocated to the wireless resource block r.
Step seven, determining the allocation decision and power control result of the wireless resource block r according to the utility factor when the wireless resource block r with the minimum number value is used for transmitting the highest priority service data of each user to be scheduled, and updating the wireless resource block set;
the wireless resource block allocation strategy method comprises the following steps:
if the condition is satisfied
Figure BDA0001262621880000098
And is
Figure BDA0001262621880000099
When the user k is served by the wireless access point through the wireless resource block r, the optimal transmitting power is Pk,n,r(t), otherwise, the radio resource manager does not allocate a radio resource block r to any user to be scheduled, wherein the function
Figure BDA00012626218800000910
Is composed of
Figure BDA00012626218800000911
And taking the values of the user serial number and the service serial number at the minimum value.
Step eight, the wireless resource manager deletes the wireless resource block r from the wireless resource block set, updates the available wireless resource block set and judges whether all the available wireless resource blocks are traversed or not; if yes, executing step nine; otherwise, returning to the step six;
step nine, the wireless resource manager sends the allocation decision and the power control result of each wireless resource block to the corresponding user to be scheduled;
the wireless resource manager sends the determined power control result and the wireless resource block allocation decision to a corresponding user to be scheduled through a downlink control channel;
step ten, the wireless resource manager counts the data transmission rate of the service with the highest transmission priority of each user in the current time slot t, the total transmission power required to be consumed and calculates the energy efficiency value of the next time slot t + 1;
updating QSIs of cache queues corresponding to all services of all users according to the data transmission rate of all users in the current time slot and the arrival rate of the new data of the requested service, and ending the resource allocation process of the current time slot;
the specific process is as follows:
firstly, for a user k to be scheduled allocated to a wireless resource blockoThe energy efficiency value calculation method is as follows:
Figure BDA0001262621880000101
wherein
Figure BDA0001262621880000102
Is to acquire a user k at a time slot toThe data transmission rate of (a) is,
Figure BDA0001262621880000103
is that user k is on time slot toThe required total transmission power, which is defined as
Figure BDA0001262621880000104
Epsilon is an energy efficiency factor between 0 and 1, and the closer the epsilon value is to the natural number 1, the higher the electric energy conversion rate of the system.
For other users i not allocated to radio resource blockoThe energy efficiency value is calculated as follows:
Figure BDA0001262621880000105
step eleven, the wireless resource manager updates the QSI of the cache queue corresponding to each service of each user; (ii) a
If the user is allocated to the wireless resource block on the time slot t, the wireless resource manager updates the cache queues corresponding to the services with the highest priority of all the users allocated to the wireless resource block according to the following formula:
Qk,n(t+1)＝max[Qk,n(t)-Rk(t),0]+Ak,n(t)；
wherein k is the user identification allocated to the wireless resource block, n is the sequence number of the highest priority service of the user k, and Rk(t) is the data transmission rate of user k at the current time slot t, Ak,n(t) requesting new data arrival rate for highest priority traffic n for user k at current time slot t,
for the user to be scheduled which is allocated to the wireless resource block on the time slot t, the wireless resource manager updates the cache queue corresponding to the non-priority highest service according to the following formula:
Figure BDA0001262621880000106
wherein n isoThe sequence number of the service with the highest non-priority level of the user k,
for other users which are not allocated with wireless resource blocks on the time slot t, the wireless resource manager updates the corresponding buffer queues of all the services according to the following formula:
Figure BDA0001262621880000107
step twelve, the wireless resource manager finishes the wireless resource allocation process in the current time slot t, and judges whether all the resource allocation time slots are finished, if yes, the process is finished; otherwise, when entering the starting time of the next wireless resource allocation time slot, the step two is returned to be executed.
The core idea of the invention is that when each service of each user to be scheduled is processed with priority, the service with the maximum change rate of the cache queue of each user to be scheduled is used as the service with absolute high priority preferentially aiming at the service with the large change rate of the cache queue, so that the backlog quantity of the service data to be transmitted in the cache queue can be reduced to the minimum state, thereby reducing the average transmission delay of the service and ensuring the stability of the network; when the data of the service with the highest priority level is determined for each user to be scheduled to be transmitted, the aim of reducing the average transmission time delay of the service and improving the network energy efficiency is taken, power control and wireless resource block distribution are carried out on the user to be scheduled by combining different time delay characteristics of the service, a buffer queue QSI and the CSI of the user, the transmission of the accumulated pressure data of the high-real-time service (such as a real enhanced service and a video stream service) can be guaranteed within a short time, the service with insensitive time delay (such as an electronic mail service) is exchanged for higher energy efficiency performance at the expense of certain time delay performance, the energy efficiency performance of the network approaches to the optimal value on the premise of realizing the stability of the network, and the construction of a green energy network is effectively promoted.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (3)

1. A time delay optimized resource allocation method is characterized by comprising the following specific steps:
step one, a wireless resource manager counts service types which can be sensed by a network and have different time delay characteristics;
the service types are N; denoted as {1,2, …, N, …, N }; n is a service serial number; k users are attached to the system; denoted as {1,2, …, K, …, K }; k is a user identifier;
step two, aiming at each resource allocation time slot, the wireless resource manager configures service control parameters for each service at the starting moment and determines the set of all available wireless resource blocks in the current time slot;
step three, aiming at each resource allocation time slot, the wireless resource manager acquires the QSI of the cache queue corresponding to each service of each user, determines all users needing to be scheduled and acquires the CSI of all users to be scheduled in the current time slot;
the QSI of the cache queue refers to the backlog quantity of the service data to be transmitted in the cache queue; the CSI is the channel gain of the user on the available wireless resource block;
the wireless resource manager determines all users needing to be scheduled in the current time slot according to whether a cache queue corresponding to each service of each user is empty, and acquires CSI reported by all users to be scheduled in the current time slot;
step four, aiming at each service of each user to be scheduled, the wireless resource manager respectively acquires the QSI of the corresponding buffer queue at the current time slot t and the previous time slot t-1;
step five, the wireless resource manager calculates the priority of each service of each user to be scheduled and determines the service with the highest priority of each user to be scheduled according to the time slot t and the QSI of the time slot t-1;
the formula for calculating the priority of each service of each user k' to be scheduled is as follows:
PRIk′,n(t)＝(Qk′,n(t))2-(Qk′,n(t-1))2
PRIk′,n(t) is the priority factor of the user k' to be scheduled on the time slot t with respect to the service n, Qk′,n(t) is QSI of a buffer queue corresponding to the service n of a user k' to be scheduled on the time slot t;
for each user to be scheduled, the priority of the service corresponding to the maximum priority factor is the highest;
the wireless resource manager selects the wireless resource block with the minimum number value from the available wireless resource block set, and calculates the optimal transmitting power and the utility factor required by transmitting the highest priority service data of each user to be scheduled on the wireless resource block;
the method comprises the following specific steps:
firstly, the wireless resource manager selects the wireless resource block with the minimum serial number value as r from the available wireless resource block set determined in the step two;
then, calculating the required optimal transmitting power when transmitting the data of the highest priority service of each user to be scheduled on a wireless resource block r;
aiming at a user k' to be scheduled, the optimal transmitting power formula required when the data of the service n with the highest priority is transmitted on the wireless resource block r is calculated as follows:
Figure FDA0002228588080000021
Pk′,n,r(t) is the optimal transmitting power needed when the wireless resource block r is used for transmitting the data of the highest priority service n of the user k' to be scheduled on the time slot t; w is the bandwidth of radio resource block r; epsilon is an energy efficiency factor with a value between 0 and 1, and the closer the epsilon value is to a natural number 1, the higher the electric energy conversion rate of the system is;
Figure FDA0002228588080000022
is the energy efficiency value of the user k' to be scheduled on the time slot t; sigma2Is the corresponding Gaussian white noise power on the wireless resource block r; gk′,r(t) is the channel gain of the user k' to be scheduled on the wireless resource block r on the time slot t; pmaxMaximum transmit power for a wireless access point; vnA service control parameter for service n;
finally, according to the optimal transmitting power required by each user to be scheduled, calculating a utility factor for transmitting the highest priority service data of each user to be scheduled by using a wireless resource block r;
aiming at a user k' to be scheduled, calculating a utility factor when transmitting data of a service with the highest priority on a wireless resource block r, wherein the formula is as follows:
Figure FDA0002228588080000023
Figure FDA0002228588080000024
the utility factor is the utility factor when the data of the highest priority service n of the user k' to be scheduled is transmitted by using the wireless resource block r on the time slot t;
step seven, determining the allocation decision and power control result of the wireless resource block r according to the utility factor when the wireless resource block r with the minimum number value is used for transmitting the highest priority service data of each user to be scheduled, and updating the wireless resource block set by the wireless resource manager;
step eight, the wireless resource manager judges whether all the available wireless resource blocks are traversed or not; if yes, executing step nine; otherwise, returning to the step six;
step nine, the wireless resource manager sends the allocation decision and the power control result of each wireless resource block to the corresponding user to be scheduled;
step ten, counting the data transmission rate of each user in the current time slot t, the total transmission power required to be consumed and calculating the energy efficiency value of the next time slot t + 1;
firstly, for a user k to be scheduled allocated to a wireless resource blockoThe energy efficiency value calculation method is as follows:
Figure FDA0002228588080000025
Figure FDA0002228588080000026
is to acquire a user k at a time slot toThe data transmission rate of (d);
Figure FDA0002228588080000027
is that user k is on time slot toThe required total transmission power, which is defined as
Figure FDA0002228588080000028
For other users i not allocated to radio resource blockoThe energy efficiency value is calculated as follows:
Figure FDA0002228588080000031
step eleven, the wireless resource manager updates the QSI of the cache queue corresponding to each service of each user;
for a user k to be scheduled which is allocated to a radio resource block on a time slot toThe highest priority service thereofThe QSI updating method of the cache queue corresponding to the n comprises the following steps:
Figure FDA0002228588080000032
Figure FDA0002228588080000033
for user k at current time slot toThe new data arrival rate of the highest priority service n;
for a user k to be scheduled which is allocated to a radio resource block on a time slot toIts non-highest priority traffic noThe QSI updating method of the corresponding cache queue comprises the following steps:
Figure FDA0002228588080000034
for other users i not allocated to radio resource block on time slot toThe QSI updating method of the cache queue corresponding to each service comprises the following steps:
Figure FDA0002228588080000035
step twelve, the wireless resource manager finishes the wireless resource allocation process in the current time slot t, and judges whether all the resource allocation time slots are finished, if yes, the process is finished; otherwise, when entering the starting time of the next wireless resource allocation time slot, the step two is returned to be executed.
2. The method according to claim 1, wherein in the second step, the radio resource manager sequentially configures service control parameters for N services that can be perceived by the network; let VnA service control parameter for service n;
the wireless resource manager determines the set of all available wireless resource blocks in the current time slot; the method comprises the steps of numbering all available wireless resource blocks in sequence and counting the number; the definition set is {1,2, …, R }, the available radio resource blocks refer to the radio resource blocks in idle state which are not allocated to any user, and the natural number R is the total number of all available radio resource blocks in the current time slot.
3. The delay-optimized resource allocation method according to claim 1, wherein the seventh step is specifically:
firstly, sorting utility factors obtained by calculation of all users to be scheduled, and selecting a minimum value; simultaneously obtaining the user serial number corresponding to the minimum utility factor and the value of the service serial number thereof;
when the utility factor obtains the minimum value, the value function of the corresponding user serial number and the service serial number thereof is as follows:
Figure FDA0002228588080000036
then, selecting the user k corresponding to the minimum utility factor*And its highest priority service n*On the basis of (1), judging whether the conditions are met
Figure FDA0002228588080000037
If so, the radio resource manager allocates the radio resource block r to the user k*For transmitting its highest priority traffic n*And set on slot t the wireless access point serves user k by radio resource block r*Transmitting its highest priority traffic n*The optimum transmission power of the data is
Figure FDA0002228588080000038
Otherwise, the radio resource manager will not allocate the radio resource block r to any user to be scheduled.
CN201710217276.9A 2017-04-05 2017-04-05 Time delay optimized resource allocation method Active CN106954232B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710217276.9A CN106954232B (en) 2017-04-05 2017-04-05 Time delay optimized resource allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710217276.9A CN106954232B (en) 2017-04-05 2017-04-05 Time delay optimized resource allocation method

Publications (2)

Publication Number Publication Date
CN106954232A CN106954232A (en) 2017-07-14
CN106954232B true CN106954232B (en) 2020-03-17

Family

ID=59475390

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710217276.9A Active CN106954232B (en) 2017-04-05 2017-04-05 Time delay optimized resource allocation method

Country Status (1)

Country Link
CN (1) CN106954232B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107864093A (en) * 2017-09-19 2018-03-30 贵州电网有限责任公司 A kind of multilayer union route and Survivability Strategy based on economic factors
CN109803365B (en) * 2017-11-17 2021-06-18 大唐移动通信设备有限公司 Power control method, device, equipment and computer readable storage medium
CN108260199B (en) * 2018-02-27 2020-10-16 重庆邮电大学 Power control method in heterogeneous cellular network base station
CN110557760A (en) * 2018-05-30 2019-12-10 智观诚通讯科技(昆山)有限公司 Wireless network transmission method, server and system based on deep learning
CN109548161B (en) * 2018-12-17 2023-02-17 深圳信息职业技术学院 Method, device and terminal equipment for scheduling wireless resources
CN110248417B (en) * 2019-06-19 2023-04-07 全球能源互联网研究院有限公司 Resource allocation method and system for communication service in power Internet of things
CN111328144B (en) * 2020-01-20 2023-04-18 赣江新区智慧物联研究院有限公司 Wireless resource allocation method, device, readable storage medium and computer equipment
CN113194440B (en) * 2021-04-28 2022-10-04 西安电子科技大学 Method for preempting transmission resources in Internet of vehicles

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101026577A (en) * 2007-01-19 2007-08-29 北京邮电大学 Scheduling method for ensuring time delay stability of non-real-time business data packet for OFDMA system
CN105764144A (en) * 2016-02-01 2016-07-13 北京邮电大学 Signaling processing method and system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101003922B1 (en) * 2008-08-04 2010-12-30 인하대학교 산학협력단 Method of schedulling providing multimedia service

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101026577A (en) * 2007-01-19 2007-08-29 北京邮电大学 Scheduling method for ensuring time delay stability of non-real-time business data packet for OFDMA system
CN105764144A (en) * 2016-02-01 2016-07-13 北京邮电大学 Signaling processing method and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Delay-Optimal Fronthaul Allocation via Perturbation;Wei Wang;《IEEE ICC》;20150612;全文 *

Also Published As

Publication number Publication date
CN106954232A (en) 2017-07-14

Similar Documents

Publication Publication Date Title
CN106954232B (en) Time delay optimized resource allocation method
CN107743100B (en) Online adaptive network slice virtual resource allocation method based on service prediction
CN109041193B (en) NOMA-based network slice dynamic combined user association and power allocation method
EP2097990B1 (en) Power overload control method useful with enhanced dedicated channel traffic
JP5824533B2 (en) LTE scheduling
Zhou et al. Low complexity cross-layer design with packet dependent scheduling for heterogeneous traffic in multiuser OFDM systems
CN113746677B (en) 5G new air interface-oriented network intra-slice resource allocation method
CN103596285A (en) Wireless resource scheduling method, wireless resource scheduler and system thereof
WO2014070937A1 (en) System and methods to achieve optimum efficiency-jain fairness in wireless systems
JP4990279B2 (en) Allocation of radio resources to reduce terminal transmission power
CN104619034B (en) Towards the grouping scheduling method of real time business in a kind of LTE communication system
CN114867030A (en) Double-time-scale intelligent wireless access network slicing method
CN111954230B (en) Computing migration and resource allocation method based on integration of MEC and dense cloud access network
Libório et al. Network Slicing in IEEE 802.11 ah
Merlhe et al. Dynamic cell-less radio access network meta-scheduler for high system capacity increase
CN111328144B (en) Wireless resource allocation method, device, readable storage medium and computer equipment
CN103458525B (en) Scheduling strategy system of selection and device in heterogeneous network
CN107277932B (en) User scheduling method of multi-user MIMO system
CN107257583B (en) Virtual resource allocation method based on self-return small cellular network
CN113778682A (en) Resource allocation method for MEC system
Rezaei et al. A new fairness index and novel approach for QoS-aware resource allocation in LTE networks based on utility functions
Wang et al. A priority-based EDF scheduling algorithm for H. 264 video transmission over WiMAX network
Saed et al. Low Complexity in Exaggerated Earliest Deadline First Approach for Channel and QoS-aware Scheduler.
Pereira et al. Energy-efficient fragmentation-avoidance uplink packet scheduler for SC-FDMA-based systems
CN113811008B (en) Quick response radio resource management method

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