A method and device for dynamic resource allocation of wireless access network under imperfect channel conditions

By calculating the resource requirements of users for different communication scenarios in an imperfect channel state, and using Lyapunov optimization technology to dynamically allocate time-frequency resources, the problem of low resource allocation efficiency in wireless access network is solved and efficient resource utilization is achieved Isolated from slices.

CN115397021BInactive Publication Date: 2024-11-29BEIJING UNIV OF POSTS & TELECOMM
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202210843300.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-07-18
Publication Date
2024-11-29
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In an imperfect channel state, it is difficult for the prior art to effectively allocate resources on the wireless access network, resulting in the inability to maximize the use of limited radio resources.

Method used

By calculating the maximum information transmission rate, total communication delay and packet loss rate of the user in the orthogonal frequency division multiple access downlink scenario for enhanced mobile broadband communication, ultra-reliable low-latency communication and large-scale machine type communication scenarios, Establish constraints and use Lyapunov optimization to dynamically allocate time-frequency resources to users.

Benefits of technology

It realizes efficient allocation of wireless access network resources in an imperfect channel state, maximizes the use of limited radio resources, and ensures isolation between slices and service quality requirements of different slice types.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115397021B_ABST
    Figure CN115397021B_ABST
Patent Text Reader

Abstract

The present invention provides a method and device for dynamic resource allocation of a wireless access network under imperfect channel conditions. For three communication scenarios of enhanced mobile broadband communication, ultra-reliable low-latency communication and large-scale machine type communication, by calculating channel information under imperfect channel conditions, according to the service quality requirements and isolation requirements of users in the three communication scenarios, by establishing constraints and using Lyapunov optimization to dynamically allocate time and frequency resources to users, efficient allocation of limited radio resources is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a method and device for dynamic resource allocation of a wireless access network under an imperfect channel state. Background Art

[0002] Currently, network slicing is one of the most cost-effective ways to meet the different needs of multiple logical network services and is a key enabler for 5G to provide a variety of services in a flexible manner. Network slicing is a resource allocation mechanism that dynamically shares available computing, communication, and storage resources between existing services while ensuring their isolation and the required performance level. It allows a large number of heterogeneous communication services to be provided on a common network infrastructure. The network slicing process can be performed on the core network (CN) and the radio access network (RAN) to create end-to-end logical networks or slices. Although network slicing on the core network has mature planning and disposal solutions, network slicing and resource configuration in the radio access network remains a challenging problem due to more complex resource coupling and the randomness of the wireless channel.

[0003] At present, most research works focus on the architecture of RAN slices, and insufficient research is done on the resource allocation and optimization of RAN slices. Network slicing allows for the sharing of infrastructure, thereby allowing multiple tenants to coexist as different slices of the network. However, the form of coexistence imposes isolation requirements between network slices, which must operate in an independent manner and not be affected by other network slices. In the wireless field, isolation means that any changes in one slice, for example, by adding new users, user changes in inter-cell interference, and fluctuations in channel conditions, should not have a negative impact on other slices. Due to practical limitations such as channel state information (CSI) estimation errors, quantization errors, and CSI feedback delays, it is impossible to obtain ideal CSI. Therefore, it is an urgent problem to allocate slice resources under imperfect channel conditions and maximize the use of limited radio resources. Summary of the invention

[0004] The embodiments of the present invention provide a method and device for dynamic resource allocation in a wireless access network under an imperfect channel state, so as to eliminate or improve one or more defects existing in the prior art, solve the problem of allocating resources to users in a wireless access network under an imperfect channel state, and maximize the use of limited radio resources.

[0005] On the one hand, the present invention provides a method for dynamic resource allocation of a wireless access network under an imperfect channel state, the method being implemented for an orthogonal frequency division multiple access downlink scenario, comprising the following steps:

[0006] Under imperfect channel conditions, the maximum information transmission rate of users is calculated for multiple communication scenarios, including enhanced mobile broadband communication, ultra-reliable low-latency communication, and massive machine type communication.

[0007] According to the maximum information transmission rate of each communication scenario, the total communication delay and packet loss rate of each user in the corresponding communication scenario are calculated respectively, and the isolation coefficient in the corresponding communication scenario is calculated according to the maximum information transmission rate, total communication delay and packet loss rate of each user in each communication scenario;

[0008] Constructing constraints for each user, the constraints include: minimizing resource usage as a goal, the actual capacity in each network slice not exceeding the set capacity, each time-frequency resource in the network slice is allocated to only one user, and the isolation coefficient of each user is not less than the set isolation coefficient;

[0009] The constraint condition is converted into a queue stability problem, a Lyapunov function is introduced to convert the queue stability problem into a Lyapunov offset minimization problem, the Lyapunov function is converted into a drift penalty function, and the drift penalty function introduces a first control parameter to weigh the queue length and actual transmission rate of each user;

[0010] Assuming that the sum of the square terms in the drift plus penalty function is bounded, a partial derivative of the drift plus penalty function is calculated, and when the partial derivative is greater than a third set value, the time-frequency resource is allocated to the corresponding user, otherwise, no allocation is made.

[0011] In some embodiments, under an imperfect channel state, the maximum information transmission rate of the user is calculated for various communication scenarios, including:

[0012] The actual channel coefficient for the u-th user at time i and frequency j is modeled as:

[0013]

[0014] in, represents the actual channel coefficient, represents the estimated channel coefficient, represents the estimation error, represents the channel estimation error variance.

[0015] Then the signal-to-noise ratio of user u in the imperfect channel state is The calculation formula is:

[0016]

[0017] in, represents the channel gain of the u-th user, represents the transmission power of the uth user at time i and frequency j, Indicates noise.

[0018] Maximum information transmission rate of the uth user at time i and frequency j in the communication scenarios of enhanced mobile broadband communication and massive machine type communication The calculation formula is:

[0019]

[0020] in, represents the bandwidth of the u-th user at time i and frequency j.

[0021] In the communication scenario of ultra-reliable low-latency communication, the maximum information transmission rate of the u-th user at time i and frequency j The calculation formula is:

[0022]

[0023]

[0024]

[0025]

[0026] in, is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0; represents the channel discreteness of the u-th user at time i and frequency j; represents the packet length of the uth user at time i and frequency j, is the Gaussian Q function, yes The inverse function of represents the bit error rate of the uth user at time i and frequency j; BW represents bandwidth; Represents the signal-to-noise ratio of user u in the communication scenario of ultra-reliable and low-latency communication.

[0027] In some embodiments, the total communication delay and packet loss rate of each user in the corresponding communication scenario are calculated according to the maximum information transmission rate of each communication scenario, including:

[0028] The calculation formula of the total communication delay d is:

[0029]

[0030]

[0031] in, is the transmission delay, For decoding delay, For queuing delay, For queue squeezing, is the actual transmission rate;

[0032] The packet loss rate The calculation formula is:

[0033]

[0034]

[0035]

[0036] in, Indicates the packet loss rate due to decoding errors, Indicates the maximum allowed packet loss rate, Indicates that the queuing delay exceeds the maximum queuing delay limit. Indicates the packet arrival rate, Indicates the actual transmission rate of the user; T indicates the total time, Indicates time.

[0037] In some embodiments, the isolation coefficient in the corresponding communication scenario is calculated according to the maximum information transmission rate, total communication delay and packet loss rate of each user in each communication scenario, including:

[0038] In the communication scenario of ultra-reliable low-latency communication, the isolation coefficient The calculation formula is:

[0039]

[0040] in, The maximum delay allowed for ultra-reliable low-latency communication, The actual latency for ultra-reliable low-latency communications, The maximum packet loss rate allowed for ultra-reliable low-latency communication, Actual packet loss rate for ultra-reliable low-latency communications;

[0041] In the communication scenario of enhanced mobile broadband communication, the isolation coefficient The calculation formula is:

[0042]

[0043] in, To enhance the maximum delay allowed for mobile broadband communications, To enhance the actual latency of mobile broadband communications, To enhance the actual transmission rate of mobile broadband communications, The minimum transmission rate required to enhance mobile broadband communications;

[0044] In the communication scenario of large-scale machine type communication, the isolation coefficient The calculation formula is:

[0045]

[0046] in, The maximum latency allowed for large-scale machine-type communications, is the actual latency of large-scale machine-type communication, The maximum packet loss rate allowed for large-scale machine-type communications, is the actual packet loss rate for large-scale machine-type communications.

[0047] In some embodiments, constraints are constructed for each user, wherein minimizing resource usage is the goal expressed as:

[0048]

[0049] in, is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0; N is the total number of carrier frequencies, U is the total number of users, and M is a natural number;

[0050] The actual capacity of each network slice does not exceed the set capacity, which can be expressed as:

[0051]

[0052] in, represents the actual capacity of the network slice at time t, represents the maximum capacity of each network slice, S represents the set of network slices, and T represents the total time;

[0053] Each time-frequency resource in a network slice is allocated to only one user as:

[0054]

[0055]

[0056] In the communication scenario of ultra-reliable low-latency communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as:

[0057]

[0058] in, Represents the isolation coefficient of users in the communication scenario of ultra-reliable low-latency communication, Indicates the minimum limit of the isolation coefficient in the communication scenario of ultra-reliable low-latency communication;

[0059] In the communication scenario of enhanced mobile broadband communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as:

[0060]

[0061] in, represents the isolation coefficient of users in the communication scenario of enhanced mobile broadband communication, Indicates the minimum limit of the isolation factor in the communication scenario of enhanced mobile broadband communication;

[0062] In the communication scenario of large-scale machine type communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as:

[0063]

[0064] in, represents the isolation coefficient of users in the communication scenario of large-scale machine-type communication, Indicates the minimum limit of the isolation coefficient in the communication scenario of large-scale machine-type communication.

[0065] In some embodiments, converting the constraint condition into a queue stability problem includes:

[0066] Create a user virtual queue, the expression is:

[0067]

[0068]

[0069]

[0070]

[0071] in, represents the virtual queue established for the capacity constraint, Represents a slice, represents the virtual queue established to enhance the isolation constraint of users in mobile broadband communication scenarios. Indicates users in enhanced mobile broadband communication scenarios, represents the virtual queue established for the isolation constraints of users in the ultra-reliable low-latency communication scenario. Indicates users in ultra-reliable and low-latency communication scenarios. represents a virtual queue established for the isolation constraints of users in large-scale machine-type communication scenarios, represents a user in a large-scale machine type communication scenario, and t represents a time slot.

[0072] In some embodiments, a Lyapunov function is introduced to transform the queue stability problem into a Lyapunov offset minimization problem, and the Lyapunov function is converted into a drift penalty function, including:

[0073] Construct the Lyapunov function describes the square of the backlog of all virtual queues at time slot t, The expression is:

[0074]

[0075] Among them, Q s (t) represents the virtual queue established for capacity constraints at time slot t, U u (t) represents the virtual queue established at time slot t for the isolation constraint of the users in the ultra-reliable low-latency communication scenario, E u (t) represents the virtual queue established at time slot t to enhance the isolation constraint of users in the mobile broadband communication scenario, M u (t) represents the virtual queue established at time slot t for the isolation constraint of users in the large-scale machine type communication scenario;

[0076] Define Lyapunov drift as:

[0077]

[0078] Convert the Lyapunov function to a drift-penalty function. Assuming the sum of the squared terms is bounded, the bound is B, then:

[0079]

[0080] Wherein, V represents the first control parameter; is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0, and t represents the time slot.

[0081] In some embodiments, the partial derivative of the drift plus penalty function is calculated, and when the partial derivative is greater than a third set value, the time-frequency resource is allocated to the corresponding user, otherwise, the time-frequency resource is not allocated, including:

[0082] Taking the partial derivative of the drift plus penalty function, we get the following formula:

[0083]

[0084] Then

[0085]

[0086] when When the time-frequency resource is allocated to the corresponding user, otherwise it is not allocated.

[0087] On the other hand, the present invention also provides a device for dynamic resource allocation of a wireless access network under imperfect channel conditions, comprising a processor and a memory, wherein the memory stores computer instructions, and the processor is used to execute the computer instructions stored in the memory. When the computer instructions are executed by the processor, the device implements the steps of the above method.

[0088] On the other hand, the present invention further provides a computer-readable storage medium having a computer program stored thereon, which implements the steps of the above method when executed by a processor.

[0089] The beneficial effects of the present invention are at least:

[0090] The method and device for dynamic resource allocation of a wireless access network under imperfect channel conditions described in the present invention take into account three communication scenarios: enhanced mobile broadband communication, ultra-reliable low-latency communication, and large-scale machine type communication. By calculating channel information under imperfect channel conditions, based on the service quality requirements and isolation requirements of users in the three communication scenarios, constraints are established and Lyapunov optimization is used to dynamically allocate time and frequency resources to users, thereby achieving efficient allocation of limited radio resources.

[0091] Additional advantages, purposes, and features of the present invention will be described in part in the following description, and will become apparent to those skilled in the art after studying the following, or may be learned from the practice of the present invention. The purposes and other advantages of the present invention may be achieved and obtained by the structures specifically indicated in the specification and the accompanying drawings.

[0092] Those skilled in the art will appreciate that the objectives and advantages that can be achieved with the present invention are not limited to the above specific description, and the above and other objectives that can be achieved by the present invention will be more clearly understood from the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0093] The drawings described herein are used to provide a further understanding of the present invention, constitute a part of the present application, and do not constitute a limitation of the present invention. In the drawings:

[0094] Figure 1 The present invention is a flowchart of a method for dynamic resource allocation in a wireless access network under an imperfect channel state according to an embodiment of the present invention.

[0095] Figure 2 This is a graph showing the relationship between the variance of the channel estimation error and the number of allocated resources in scenarios of strong mobile broadband communication, ultra-reliable low-latency communication, and large-scale machine type communication according to the method of the present invention.

[0096] Figure 3It is a queue stability convergence time diagram of different first control parameters of the method of the present invention in strong mobile broadband communication, ultra-reliable low-latency communication and large-scale machine type communication scenarios.

[0097] Figure 4 A graph showing the relationship between the change in the number of one type of users and the change in the number of resources allocated to other types of users in the scenario of strong mobile broadband communication, ultra-reliable low-latency communication and large-scale machine type communication according to the method of the present invention.

[0098] Figure 5 A graph showing the relationship between changes in the quality of service requirements of one type of user and changes in the amount of resources allocated to other types of users in the method of the present invention under strong mobile broadband communication, ultra-reliable low-latency communication and large-scale machine type communication scenarios.

[0099] Figure 6 The figure is a relationship diagram between the amount of resources allocated and the bandwidth of the physical resource block in the scenarios of strong mobile broadband communication, ultra-reliable low-latency communication and large-scale machine type communication according to the method of the present invention and the traditional method. DETAILED DESCRIPTION

[0100] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments and the accompanying drawings. Here, the illustrative embodiments of the present invention and their descriptions are used to explain the present invention, but are not intended to limit the present invention.

[0101] It should also be noted that, in order to avoid obscuring the present invention due to unnecessary details, only structures and / or processing steps closely related to the solutions according to the present invention are shown in the accompanying drawings, while other details that are not closely related to the present invention are omitted.

[0102] It should be emphasized that the term “include / comprises” when used herein refers to the presence of features, elements, steps or components, but does not exclude the presence or addition of one or more other features, elements, steps or components.

[0103] Due to practical limitations such as channel state information (CSI) estimation error, quantization error, and CSI feedback delay, it is impossible to obtain an ideal CSI. Therefore, the existing technology cannot effectively solve the problem of slicing resource allocation under imperfect channel conditions and maximize the use of limited radio resources. The present invention provides a method and device for dynamic resource allocation of a wireless access network under imperfect channel conditions, which is used to solve the slicing problem of a wireless access network (RAN). For three main 5G communication scenarios including enhanced mobile broadband communication (eMBB), ultra-reliable low-latency communication (URLLC), and massive machine type communication (mMTC), a radio resource allocation scheme for a cellular network downlink wireless access network is given. For imperfect channel state information (CSI), with the goal of reducing resource usage, Lyapunov optimization is used to dynamically allocate time and frequency resources to users, while ensuring slice isolation to meet different QoS (Quality of Service) requirements for different slice types.

[0104] Specifically, the present invention provides a method for dynamic resource allocation of a wireless access network under an imperfect channel state, the method being implemented for an orthogonal frequency division multiple access downlink scenario, and comprising the following steps S101 to S105:

[0105] Step S101: Under an imperfect channel state, the maximum information transmission rate of the user is calculated for various communication scenarios, including enhanced mobile broadband communication, ultra-reliable low-latency communication, and large-scale machine type communication.

[0106] Step S102: Calculate the total communication delay and packet loss rate of each user in the corresponding communication scenario according to the maximum information transmission rate of each communication scenario, and calculate the isolation coefficient in the corresponding communication scenario according to the maximum information transmission rate, total communication delay and packet loss rate of each user in each communication scenario.

[0107] Step S103: Construct constraints for each user, the constraints include: minimizing resource usage as the goal, the actual capacity in each network slice does not exceed the set capacity, each time-frequency resource in the network slice is allocated to only one user, and the isolation coefficient of each user is not less than the set isolation coefficient.

[0108] Step S104: converting the constraint condition into a queue stability problem, introducing a Lyapunov function to convert the queue stability problem into a problem of minimizing the Lyapunov offset, converting the Lyapunov function into a drift penalty function, and introducing a first control parameter into the drift penalty function to weigh the queue length and actual transmission rate of each user.

[0109] Step S105: Assuming that the sum of the square terms in the drift penalty function is bounded, the partial derivative of the drift penalty function is calculated. When the partial derivative is greater than a third set value, time-frequency resources are allocated to the corresponding user, otherwise no allocation is made.

[0110] The prior art usually only considers scheduling of wireless network resources under perfect CSI conditions, which has limitations. In actual applications, channel state estimation is often imperfect. Therefore, in order to improve the allocation effect of network resources in actual applications, step S101 of this application estimates and processes under imperfect channel conditions, taking into account the actual application scenario requirements of users, and calculates channel information for enhanced mobile broadband communication (eMBB), ultra-reliable low-latency communication (URLLC) and massive machine type communication (mMTC). It should be noted that the present invention is mainly for processing the orthogonal frequency division multiple access (OFDMA) downlink (DL) scenario.

[0111] In an Orthogonal Frequency Division Multiple Access (OFDMA) downlink (DL) scenario, the available time intervals are i={1,2,...,M}, and the available frequency bandwidths are divided into j={1,2,...,N}.

[0112] In some embodiments, in step S101, under an imperfect channel state, the maximum information transmission rate of the user is calculated for each of a plurality of communication scenarios, and the steps include steps S1011 to S1014:

[0113] Step S1011: Model the actual channel coefficient of the u-th user at time i and frequency j as:

[0114]

[0115] in, represents the actual channel coefficient, represents the estimated channel coefficient, represents the estimation error, represents the channel estimation error variance.

[0116] Step S1012: The signal-to-noise ratio of user u in an imperfect channel state is The calculation formula is:

[0117]

[0118] in, represents the channel gain of the u-th user, represents the transmission power of the uth user at time i and frequency j, Indicates noise.

[0119] Step S1013: In the communication scenarios of enhanced mobile broadband communication and massive machine type communication, the maximum information transmission rate of the u-th user at time i and frequency j The calculation formula is:

[0120]

[0121] in, represents the bandwidth of the u-th user at time i and frequency j.

[0122] Step S1014: In the communication scenario of ultra-reliable low-latency communication, the maximum information transmission rate of the u-th user at time i and frequency j The calculation formula is as follows:

[0123]

[0124]

[0125]

[0126]

[0127] in, is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0; represents the channel discreteness of the u-th user at time i and frequency j; represents the packet length of the uth user at time i and frequency j, is the Gaussian Q function, yes The inverse function of represents the bit error rate of the uth user at time i and frequency j; BW represents bandwidth; Represents the signal-to-noise ratio of user u in the communication scenario of ultra-reliable and low-latency communication.

[0128] In steps S1011 to S1014, after the signal-to-noise ratio is calculated under the imperfect channel state, the maximum information transmission rate in the enhanced mobile broadband communication (eMBB) and massive machine type communication (mMTC) scenarios is calculated according to the Shannon formula, specifically referring to Formula 3. For the ultra-reliable low-latency communication (URLLC) scenario, since the URLLC system requires the transmission of small-sized data packets and has strict delay constraints, it is calculated with reference to Formulas 4 to 7.

[0129] In step S102, the total communication delay and packet loss rate of each user are calculated, and the isolation coefficient is calculated based on the obtained values ​​in combination with different communication scenarios.

[0130] Specifically, in step S102, the total communication delay and packet loss rate of each user in the corresponding communication scenario are calculated according to the maximum information transmission rate of each communication scenario, wherein the calculation formula of the total communication delay d is as follows:

[0131]

[0132]

[0133] in, is the transmission delay, For decoding delay, For queuing delay, For queue squeezing, is the actual transmission rate.

[0134] Packet loss rate The calculation formula is:

[0135]

[0136]

[0137]

[0138] in, Indicates the packet loss rate due to decoding errors, Indicates the maximum allowed packet loss rate, Indicates that the queuing delay exceeds the maximum queuing delay limit. Indicates the packet arrival rate, Indicates the actual transmission rate of the user; T indicates the total time, Indicates time.

[0139] Furthermore, because the slices of the radio access network should rely on a flexible resource sharing strategy, it is necessary to ensure the isolation between slices. The resource isolation of the slices ensures that any change in the network status of a slice should not cause a negative impact on the QoS of other slices. Therefore, this article adopts an isolation indicator to reflect whether it meets the QoS requirements. In step S102, the isolation coefficient under the corresponding communication scenario is calculated according to the maximum information transmission rate, total communication delay and packet loss rate of each user under each communication scenario, including:

[0140] 3GPP divides the URLLC standard into two parts: low latency and high reliability. Therefore, the isolation factor of URLLC is expressed in the form of latency and packet loss rate. In the communication scenario of ultra-reliable low-latency communication, the isolation factor The calculation formula is:

[0141]

[0142] in, The maximum delay allowed for ultra-reliable low-latency communication, The actual latency for ultra-reliable low-latency communications, The maximum packet loss rate allowed for ultra-reliable low-latency communication, Actual packet loss rate for ultra-reliable low latency communications.

[0143] The eMBB scenario refers to further improving user experience and other performance based on the existing mobile broadband services. High data rates and low latency are needed to improve current mobile services in a wide range of areas. Compared with the LTE (Long Term Evolution) system, the access rate requirements are increased by dozens of times. Therefore, the isolation factor of eMBB is expressed in the form of throughput and latency. In the communication scenario of enhanced mobile broadband communication, the isolation factor The calculation formula is:

[0144]

[0145] in, To enhance the maximum delay allowed for mobile broadband communications, To enhance the actual latency of mobile broadband communications, To enhance the actual transmission rate of mobile broadband communications, The minimum transmission rate required to enhance mobile broadband communications.

[0146] Massive machine type communication (mMTC) is mainly aimed at large-scale IoT services and can be regarded as a special URLLC that emphasizes reliability but reduces the requirements for latency performance. In the communication scenario of massive machine type communication, the isolation coefficient The calculation formula is:

[0147]

[0148] in, The maximum latency allowed for large-scale machine-type communications, is the actual latency of large-scale machine-type communication, The maximum packet loss rate allowed for large-scale machine-type communications, is the actual packet loss rate for large-scale machine-type communications.

[0149] In step S103, constraints are constructed for each user, wherein minimizing resource usage is the goal expressed as:

[0150]

[0151] in, is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0; N is the total number of carrier frequencies, U is the total number of users, and M is a natural number.

[0152] The actual capacity of each network slice does not exceed the set capacity, which can be expressed as:

[0153]

[0154] in, represents the actual capacity of the network slice at time t, represents the maximum capacity of each network slice, S represents the set of network slices, and T represents the total time.

[0155] Each time-frequency resource in a network slice is allocated to only one user as:

[0156]

[0157]

[0158] In the communication scenario of ultra-reliable low-latency communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as:

[0159]

[0160] in, Represents the isolation coefficient of users in the communication scenario of ultra-reliable low-latency communication, Indicates the minimum limit of the isolation factor in the communication scenario of ultra-reliable low-latency communication.

[0161] In the communication scenario of enhanced mobile broadband communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as:

[0162]

[0163] in, represents the isolation coefficient of users in the communication scenario of enhanced mobile broadband communication, Indicates the minimum limit of the isolation factor in the communication scenario of enhanced mobile broadband communication.

[0164] In the communication scenario of large-scale machine type communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as:

[0165]

[0166] in, represents the isolation coefficient of users in the communication scenario of large-scale machine-type communication, Indicates the minimum limit of the isolation coefficient in the communication scenario of large-scale machine-type communication.

[0167] Furthermore, in step S104, the constraint condition is converted into a queue stability problem, including:

[0168] A virtual queue is defined for the constraint in step S103, thereby transforming the constraint into a queue stability problem and establishing a user virtual queue, which is expressed as:

[0169]

[0170]

[0171]

[0172]

[0173] in, represents the virtual queue established for the capacity constraint, Represents a slice, represents the virtual queue established to enhance the isolation constraint of users in mobile broadband communication scenarios. Indicates users in enhanced mobile broadband communication scenarios, represents the virtual queue established for the isolation constraints of users in the ultra-reliable low-latency communication scenario. Indicates users in ultra-reliable and low-latency communication scenarios. represents a virtual queue established for the isolation constraints of users in a large-scale machine-type communication scenario. represents a user in a large-scale machine type communication scenario, and t represents a time slot.

[0174] Furthermore, in step S104, a Lyapunov function is introduced to transform the queue stability problem into a Lyapunov offset minimization problem, and the Lyapunov function is converted into a drift penalty function, including:

[0175] Construct the Lyapunov function describes the square of the backlog of all virtual queues at time slot t, a scalar measure of network congestion, The expression is:

[0176]

[0177] Among them, Q s (t) represents the virtual queue established for capacity constraints at time slot t, U u (t) represents the virtual queue established at time slot t for the isolation constraint of the users in the ultra-reliable low-latency communication scenario, E u(t) represents the virtual queue established at time slot t to enhance the isolation constraint of users in the mobile broadband communication scenario, M u (t) represents the virtual queue established at time slot t for the isolation constraint of users in the large-scale machine type communication scenario;

[0178] Define Lyapunov drift as:

[0179]

[0180] In step S105, the Lyapunov function is converted into a drift penalty function, and the queue stability problem is converted into a Lyapunov offset minimization problem. Assuming that the sum of the square terms is bounded, the bound is B, then:

[0181]

[0182] Wherein, V represents the first control parameter; is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0, and t represents the time slot.

[0183] In some embodiments, the partial derivative of the drift plus penalty function is calculated, and when the partial derivative is greater than a third set value, time-frequency resources are allocated to the corresponding user, otherwise no allocation is made, including:

[0184] Taking the partial derivative of the drift plus penalty function, we get the following formula:

[0185]

[0186] Then

[0187]

[0188] when When the time-frequency resource is allocated to the corresponding user, otherwise no allocation is made.

[0189] Therefore, the steps of the method for dynamic resource allocation of a wireless access network under an imperfect channel state of the present invention can be summarized as follows:

[0190] (1) Determine the system parameters, namely, the available time interval M, the available frequency bandwidth N, the number of users U, and the performance requirements for each type of user.

[0191] (2) Construct a channel model and obtain the estimated channel and estimation error based on the error variance of the channel coefficients.

[0192] (3) Calculate the signal-to-noise ratio and maximum information transmission power.

[0193] (4) Calculate the delay and packet loss rate.

[0194] (5) Calculate the user isolation coefficient in each communication scenario based on the values ​​obtained in (3) and (4).

[0195] (6) Determine the optimization objectives and constraints.

[0196] (7) The constraints are transformed into virtual queues to obtain the quadratic Lyapunov function.

[0197] (8) Introducing the Lyapunov drift penalty function, the random optimization problem is transformed into the Lyapunov optimization problem.

[0198] (9) Solve this optimization problem for each time slot.

[0199] (10) However, greedily solving the problem in each time slot has high complexity and is therefore not scalable for large networks. Therefore, the partial derivative of the drift penalty function is taken to simplify the computation.

[0200] (11) Initialize the parameter system.

[0201] (12) Update the user virtual queue at the beginning of each time slot.

[0202] (13) Calculate the u value and allocate resources when u>V.

[0203] The effect of the present invention is described below in conjunction with experimental data:

[0204] Figure 2 This is the effect of the variance of the channel estimation error on the number of allocated resources. When the variance of the estimated channel error is small, the number of allocated resources is small. As the variance increases, the number of allocated resources gradually increases. Therefore, the estimation error has an effect on the number of allocated resources. When the error is relatively small, the number of allocated resources can be saved.

[0205] Figure 3 The convergence time to queue stability for different users and values ​​of the first control parameter V is shown. The convergence time increases with increasing first control parameter V, because fewer resources are allocated and therefore the queue takes longer to reach a steady state. The larger traffic arrivals for eMBB result in shorter convergence times, while mMTC has the smallest traffic arrivals and the longest convergence time. This is because with larger arrivals the queue state increases faster and therefore the queue reaches the desired steady-state size faster. Regardless of the choice of Lyapunov first control parameter V, the constraints are not violated, only the time required to satisfy them increases.

[0206] Figure 4 Changing the number of three types of users separately, when the number of one type of users changes, will not cause changes in the number of resources allocated to other types of users. Figure 5The QoS requirements of three types of users are changed, and the other two types of users are not affected by the changes in the traffic arrival of another type of users. Therefore, the isolation between slices can be guaranteed.

[0207] In the study of resource allocation algorithm for multi-service smart grid 5G network, physical resource blocks (PRBs) are allocated to users, and control parameters are used Adjust the subcarrier spacing, , that is, adjusting the bandwidth of the physical resource block, such as Figure 6 As shown, = 2, 1 or 0, the resources allocated by the study are compared with the number of resources allocated by the method of the present invention (eMBB, URLLC and mMTC under Lyapunov optimization, marked as LyapunoveMBB, LyapunovURLLC and LyapunovmMTC). = 2, the number of resources allocated by this study is more than that of the present invention, and the resource utilization rate is lower. =1, the number of resources allocated by eMBB and URLLC cannot meet the user needs. = 0, the resources allocated to mMTC users are still more than those of the present invention, because the study allocates one PRB resource to each mMTC user, which will lead to a waste of resources. =2, mMTC user selection = 0, more resources are still required than the method of the present invention. It can be seen that the method of the present invention can minimize the usage of resources.

[0208] On the other hand, the present invention also provides a device for dynamic resource allocation of a wireless access network under imperfect channel conditions, comprising a processor and a memory, wherein the memory stores computer instructions, and the processor is used to execute the computer instructions stored in the memory. When the computer instructions are executed by the processor, the device implements the steps of the above method.

[0209] The embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps of the aforementioned edge computing server deployment method are implemented. The computer-readable storage medium can be a tangible storage medium, such as a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a floppy disk, a hard disk, a removable storage disk, a CD-ROM, or any other form of storage medium known in the technical field.

[0210] In summary, the method and device for dynamic resource allocation of a wireless access network under imperfect channel conditions described in the present invention take into account three communication scenarios: enhanced mobile broadband communication, ultra-reliable low-latency communication, and large-scale machine type communication. By calculating the channel information under imperfect channel conditions, the service quality requirements and isolation requirements of users in the three communication scenarios are targeted, constraints are established, and Lyapunov optimization is used to dynamically allocate time and frequency resources to users, thereby achieving efficient allocation of limited radio resources.

[0211] It should be understood by those skilled in the art that the exemplary components, systems, and methods described in conjunction with the embodiments disclosed herein can be implemented in hardware, software, or a combination of the two. Whether to implement in hardware or software depends on the specific application and design constraints of the technical solution. Professional technicians can use different hardware or software for each specific application.

[0212] Methods are used to implement the described functions, but such implementation should not be considered beyond the scope of the present invention. When implemented in hardware, it can be, for example, an electronic circuit, an application-specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present invention are programs or code segments used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or communication link via a data signal carried in a carrier.

[0213] It should be clear that the present invention is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present invention is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present invention.

[0214] In the present invention, features described and / or illustrated for one embodiment may be used in the same or similar manner in one or more other embodiments, and / or combined with features of other embodiments or replace features of other embodiments.

[0215] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the embodiments of the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for dynamic resource allocation in a wireless access network under imperfect channel conditions, characterized in that: The method is implemented for an orthogonal frequency division multiple access downlink scenario, and includes the following steps: Under imperfect channel conditions, the maximum information transmission rate of users is calculated for multiple communication scenarios, including enhanced mobile broadband communication, ultra-reliable low-latency communication, and massive machine type communication. According to the maximum information transmission rate of each communication scenario, the total communication delay and packet loss rate of each user in the corresponding communication scenario are calculated respectively, and the isolation coefficient in the corresponding communication scenario is calculated according to the maximum information transmission rate, total communication delay and packet loss rate of each user in each communication scenario; Constructing constraints for each user, the constraints include: minimizing resource usage as a goal, the actual capacity in each network slice not exceeding the set capacity, each time-frequency resource in the network slice is allocated to only one user, and the isolation coefficient of each user is not less than the set isolation coefficient; The constraint condition is converted into a queue stability problem, a Lyapunov function is introduced to convert the queue stability problem into a Lyapunov offset minimization problem, the Lyapunov function is converted into a drift penalty function, and the drift penalty function introduces a first control parameter to weigh the queue length and actual transmission rate of each user; Assuming that the sum of the square terms in the drift plus penalty function is bounded, a partial derivative of the drift plus penalty function is calculated, and when the partial derivative is greater than a third set value, the time-frequency resource is allocated to the corresponding user, otherwise, no allocation is made.

2. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 1, characterized in that: Under imperfect channel conditions, the maximum information transmission rate of users is calculated for various communication scenarios, including: The actual channel coefficient for the u-th user at time i and frequency j is modeled as: in, represents the actual channel coefficient, represents the estimated channel coefficient, represents the estimation error, represents the channel estimation error variance; Then the signal-to-noise ratio of user u in the imperfect channel state is The calculation formula is: in, represents the channel gain of the u-th user, represents the transmission power of the uth user at time i and frequency j, Indicates noise; Maximum information transmission rate of the uth user at time i and frequency j in the communication scenarios of enhanced mobile broadband communication and massive machine type communication The calculation formula is: in, represents the bandwidth of the u-th user at time i and frequency j; In the communication scenario of ultra-reliable low-latency communication, the maximum information transmission rate of the u-th user at time i and frequency j The calculation formula is: in, is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0; represents the channel discreteness of the u-th user at time i and frequency j; represents the packet length of the uth user at time i and frequency j, is the Gaussian Q function, yes The inverse function of represents the bit error rate of the uth user at time i and frequency j; BW represents bandwidth; Represents the signal-to-noise ratio of user u in the communication scenario of ultra-reliable and low-latency communication.

3. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 2, characterized in that: According to the maximum information transmission rate of each communication scenario, the total communication delay and packet loss rate of each user in the corresponding communication scenario are calculated respectively, including: The calculation formula of the total communication delay d is: in, is the transmission delay, For decoding delay, For queuing delay, For queue squeezing, is the actual transmission rate; The packet loss rate The calculation formula is: in, Indicates the packet loss rate due to decoding errors, Indicates the maximum allowed packet loss rate, Indicates that the queuing delay exceeds the maximum queuing delay limit. Indicates the packet arrival rate, Indicates the actual transmission rate of the user; T indicates the total time, Indicates time.

4. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 3, characterized in that: The isolation coefficient in the corresponding communication scenario is calculated based on the maximum information transmission rate, total communication delay and packet loss rate of each user in each communication scenario, including: In the communication scenario of ultra-reliable low-latency communication, the isolation coefficient The calculation formula is: in, The maximum delay allowed for ultra-reliable low-latency communication, The actual latency for ultra-reliable low-latency communications, The maximum packet loss rate allowed for ultra-reliable low-latency communication, Actual packet loss rate for ultra-reliable low-latency communications; In the communication scenario of enhanced mobile broadband communication, the isolation coefficient The calculation formula is: in, To enhance the maximum delay allowed for mobile broadband communications, To enhance the actual latency of mobile broadband communications, To enhance the actual transmission rate of mobile broadband communications, The minimum transmission rate required to enhance mobile broadband communications; In the communication scenario of large-scale machine type communication, the isolation coefficient The calculation formula is: in, The maximum latency allowed for large-scale machine-type communications, is the actual latency of large-scale machine-type communication, The maximum packet loss rate allowed for large-scale machine-type communications, is the actual packet loss rate for large-scale machine-type communications.

5. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 4, characterized in that: Construct constraints for each user, where minimizing resource usage is the goal expressed as: in, is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0; N is the total number of carrier frequencies, U is the total number of users, and M is a natural number; The actual capacity of each network slice does not exceed the set capacity, which can be expressed as: in, represents the actual capacity of the network slice at time t, represents the maximum capacity of each network slice, S represents the set of network slices, and T represents the total time; Each time-frequency resource in a network slice is allocated to only one user as: In the communication scenario of ultra-reliable low-latency communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as: in, Represents the isolation coefficient of users in the communication scenario of ultra-reliable low-latency communication, Indicates the minimum limit of the isolation coefficient in the communication scenario of ultra-reliable low-latency communication; In the communication scenario of enhanced mobile broadband communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as: in, represents the isolation coefficient of users in the communication scenario of enhanced mobile broadband communication, Indicates the minimum limit of the isolation factor in the communication scenario of enhanced mobile broadband communication; In the communication scenario of large-scale machine type communication, the isolation coefficient of each user is not less than the set isolation coefficient expressed as: in, represents the isolation coefficient of users in the communication scenario of large-scale machine-type communication, Indicates the minimum limit of the isolation coefficient in the communication scenario of large-scale machine-type communication.

6. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 5, characterized in that: Transform the constraints into a queue stability problem, including: Create a user virtual queue, the expression is: in, represents the virtual queue established for the capacity constraint, Represents a slice, represents the virtual queue established to enhance the isolation constraint of users in mobile broadband communication scenarios. Indicates users in enhanced mobile broadband communication scenarios, represents the virtual queue established for the isolation constraints of users in the ultra-reliable low-latency communication scenario. Indicates users in ultra-reliable and low-latency communication scenarios. represents a virtual queue established for the isolation constraints of users in large-scale machine-type communication scenarios, represents a user in a large-scale machine type communication scenario, and t represents a time slot.

7. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 6, characterized in that: The Lyapunov function is introduced to transform the queue stability problem into the problem of minimizing the Lyapunov offset, and the Lyapunov function is converted into a drift penalty function, including: Construct the Lyapunov function describes the square of the backlog of all virtual queues at time slot t, The expression is: Among them, Q s (t) represents the virtual queue established for capacity constraints at time slot t, U u (t) represents the virtual queue established at time slot t for the isolation constraint of the users in the ultra-reliable low-latency communication scenario, E u (t) represents the virtual queue established at time slot t to enhance the isolation constraint of users in the mobile broadband communication scenario, M u (t) represents the virtual queue established at time slot t for the isolation constraint of users in the large-scale machine type communication scenario; Define Lyapunov drift as: Convert the Lyapunov function into a drift-penalty function, assuming that the sum of the square terms is bounded, bounded by B, then: Wherein, V represents the first control parameter; is a binary parameter. At time i, if frequency j is assigned to the uth user, then is 1, otherwise it is 0, and t represents the time slot.

8. The method for dynamic resource allocation of wireless access network under imperfect channel conditions according to claim 7, characterized in that: The partial derivative of the drift plus penalty function is calculated, and when the partial derivative is greater than a third set value, the time-frequency resource is allocated to the corresponding user, otherwise, the time-frequency resource is not allocated, including: Taking the partial derivative of the drift plus penalty function, we get the following formula: Then when When the time-frequency resource is allocated to the corresponding user, otherwise it is not allocated.

9. A device for dynamic resource allocation of a wireless access network under imperfect channel conditions, comprising a processor and a memory, characterized in that: The memory stores computer instructions, and the processor is used to execute the computer instructions stored in the memory. When the computer instructions are executed by the processor, the device implements the steps of the method as claimed in any one of claims 1 to 8.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method according to any one of claims 1 to 8 are implemented.

Citation Information

Patent Citations

  • A network slicing dynamic joint user association and power allocation method based on NOMA

    CN109041193A