Resource Allocation Method, Server, and Storage Medium

Abstract

Embodiments of the present invention relate to the field of communication technologies, and disclose a resource allocation method, a server, and a storage medium. In the embodiments of the present invention, the resource allocation method includes identifying users with communication requirements for a base station having a mobile edge computing (MEC) function; grouping the uplink tasks and downlink tasks of the users to obtain a plurality of task groups arranged in sequence, so as to allow the base station to sequentially complete data transmission of the plurality of task groups in a time-division multiplexing manner in a full-duplex mode; wherein each task group includes at least one of an uplink task and a downlink task, and for the users, the uplink task and the downlink task of the same MEC computing offloading user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located. The technical solution of the embodiments of the present invention can reduce the total system delay in the MEC scenario.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of communication technologies, and particularly to a resource allocation method, a server, and a storage medium. Background Art

[0002] With the explosive growth in the number of mobile devices, various emerging application services such as mobile video streams, augmented reality, virtual reality, and autonomous driving have brought unprecedented data traffic to mobile communication networks. However, mobile terminals often do not have strong computing capabilities. For these application services with low latency and high computational requirements, local computing on mobile terminals is difficult to ensure their service quality.

[0003] Mobile Edge Computing (MEC) can provide computing, storage, and communication resources at the network edge. Mobile users can offload their computing tasks to the MEC server for computing. Since the MEC server is close to the user terminal and has relatively strong computing capabilities, MEC can provide low-latency and high-bandwidth services for mobile users. In the MEC system, the transmission latency is an important part of the total system latency; when a user offloads a task to the MEC server for execution, it includes the process of task upload, task calculation, and result download. Among them, the transmission latency in the upload and download processes has a great impact on the total latency of the MEC system. With the continuous increase in MEC computing offloading users, in the current half-duplex mode, the total latency of the MEC system also increases continuously, seriously affecting the timeliness of data transmission. Summary of the Invention

[0004] Embodiments of the present invention aim to provide a resource allocation method, a server, and a storage medium, which can reduce the total system latency in the MEC scenario.

[0005] To solve the above technical problems, an embodiment of the present invention provides a resource allocation method, including: identifying users with communication requirements for a base station having Mobile Edge Computing (MEC) capabilities; grouping the uplink tasks and downlink tasks of the users to obtain a plurality of task groups arranged in sequence, so as to allow the base station to sequentially complete data transmission of the plurality of task groups in a time-division multiplexing manner in full-duplex mode; where each task group includes at least one of the uplink task and the downlink task, and among the users, the uplink task and the downlink task of the same MEC computing offloading user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located.

[0006] An embodiment of the present invention further provides a server, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and when the instructions are executed by the at least one processor, the at least one processor is enabled to execute the above method.

[0007] Compared with the prior art, embodiments of the present invention group the uplink tasks and downlink tasks of all users to obtain a plurality of task groups arranged in sequence, so as to allow the base station to complete the data transmission of the plurality of task groups in a time-division multiplexing manner in the full-duplex mode; wherein, the uplink tasks and downlink tasks of the same MEC computing offloading user are grouped into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located. That is, in the present application, an uplink task and a downlink task form a task group and the data transmission of the task group is completed in the full-duplex mode, and the grouping method in the present application allows normal data transmission between the user in the MEC scenario and the base station, thereby reducing the total system delay in the MEC scenario.

[0008] In one example, the grouping of the uplink tasks and downlink tasks of the user to obtain a plurality of task groups arranged in sequence includes: combining the uplink tasks and the downlink tasks to obtain a plurality of temporary task groups; wherein each temporary task group includes one uplink task and one downlink task, each uplink task exists in several of the temporary task groups, and each downlink task exists in several of the temporary task groups; estimating the data transmission time difference between each temporary task group in the full-duplex mode and in the half-duplex mode; and determining a plurality of the task groups arranged in sequence based on the data transmission time difference of each temporary task group. This embodiment provides a specific way to determine a plurality of task groups arranged in sequence; the data transmission time difference between the task group in the full-duplex mode and in the half-duplex mode can reflect the time saved by the task group when transmitting data in the full-duplex mode compared with the half-duplex mode. Therefore, screening based on the data transmission time difference can screen out a plurality of task groups that minimize the total system delay.

[0009] In one example, estimating the data transmission time difference of each of the temporary task groups in full-duplex mode and in half-duplex mode includes estimating the data transmission duration of each of the task groups in full-duplex mode and the minimum data transmission duration in half-duplex mode at least according to a preset maximum transmission power for data transmission and the data transmission volume of each of the temporary task groups; calculating the difference between the minimum data transmission duration of each of the temporary task groups in full-duplex mode and the minimum data transmission duration in half-duplex mode as the data transmission time difference of each of the temporary task groups. This embodiment provides a specific method for estimating the data transmission time difference of each temporary task group in full-duplex mode and in half-duplex mode.

[0010] In one example, in estimating the minimum data transmission duration of each of the temporary task groups in full-duplex mode at least according to a preset maximum transmission power for data transmission and the data transmission volume of each of the task groups, the minimum data transmission duration of each of the temporary task groups in full-duplex mode is estimated based on the binary search method. This embodiment provides a specific method for estimating the minimum data transmission duration of each temporary task group in full-duplex mode; the time complexity of the binary search method is relatively low, so the estimation can be performed relatively quickly, thereby further reducing the total system delay.

[0011] In one example, in estimating the minimum data transmission duration of each of the temporary task groups in full-duplex mode based on the binary search method, the optimal transmission power corresponding to each of the temporary task groups is also estimated; wherein, the time taken for the base station and the users of each of the temporary task groups to complete the data transmission of each of the temporary task groups based on the optimal transmission power is the minimum data transmission duration. In this embodiment, in addition to being able to configure the combination of uplink tasks and downlink tasks, the optimal transmission power and the minimum data transmission duration can also be configured.

[0012] In one example, based on the data transmission time difference of each of the temporary task groups, among the multiple task groups arranged in sequence, the multiple task groups arranged in sequence are determined based on the greedy algorithm. This embodiment provides a specific method for estimating and determining the multiple task groups arranged in sequence; the time complexity of the greedy algorithm is relatively low, so the screening can be performed relatively quickly, thereby further reducing the total system delay.

[0013] In one example, the resource allocation method is periodically executed; among the users identified as having communication requirements with a base station having mobile edge computing (MEC) capabilities, all users having communication requirements with the base station in the current period are identified. Description of the Drawings

[0014] One or more embodiments are exemplarily illustrated by pictures in the corresponding drawings. These exemplary illustrations do not constitute limitations on the embodiments. Elements with the same reference numerals in the drawings represent similar elements, unless otherwise stated. The drawings in the figures do not constitute a scale limitation.

[0015] Figure 1 is a flowchart of the resource allocation method according to the first embodiment of the present invention;

[0016] Figure 2 is a schematic diagram of communication between a user terminal and a base station in an MEC scenario according to the first embodiment of the present invention;

[0017] Figure 3 is a flowchart of the resource allocation method according to the second embodiment of the present invention;

[0018] Figure 4 is a block diagram of a server according to the third embodiment of the present invention. Specific embodiments

[0019] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the following will elaborate on each embodiment of the present invention with reference to the drawings. However, those of ordinary skill in the art can understand that in each embodiment of the present invention, many technical details are presented to help readers better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solutions claimed in the present application can still be implemented. The following division of each embodiment is for convenience of description and should not constitute any limitation on the specific implementation of the present invention. Each embodiment can be combined and cross-referenced with each other on the premise of no contradiction.

[0020] The first embodiment of the present invention relates to a resource allocation method. The specific process is as Figure 1 shown.

[0021] Step 101: Identify users with communication requirements for a base station having mobile edge computing (MEC) capabilities;

[0022] Step 102: Group the uplink tasks and downlink tasks of the users to obtain a plurality of task groups arranged in sequence, so as to allow the base station to sequentially complete data transmission of the plurality of task groups in a time-division multiplexing manner in a full-duplex mode;

[0023] Among them, each task group includes at least one of an uplink task and a downlink task. Among the users, the uplink task and the downlink task of the same MEC computing offloading user are divided into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located.

[0024] The implementation details of the resource allocation method in this embodiment will be specifically described below. The following content is only the implementation details provided for convenience of understanding and is not necessary for implementing this solution.

[0025] The resource allocation method in this embodiment can be applied to a server, which is set in a base station with mobile edge computing (MEC) function; among them, the MEC function of the base station can be integrated in the server or implemented by an independent MEC server located in the base station.

[0026] When a user needs to communicate with the base station, usually a communication request will be sent through the user terminal, and the communication request can include the task type and the data transmission volume of the task; the task type can reflect the user type. For example, if the task type is a single uplink task, then the user is an ordinary uplink user; if the task type is a single downlink task, then the user is an ordinary downlink user; if the task type is an MEC computing offloading task, then the user is an MEC computing offloading user; among them, the MEC computing offloading task includes an uplink task and a downlink task. As Figure 2 shown in the schematic diagram of the communication between the user terminal and the base station in the MEC scenario, the figure includes an ordinary uplink user A, an ordinary downlink user B, and an MEC computing offloading user C.

[0027] The server can consider the user who receives the communication request as a user with communication requirements with the base station; it should be noted that in this embodiment, data is transmitted in a time-division multiplexing manner, that is, each user multiplexes the same channel in time division; therefore, all users identified by the server as having communication requirements with the base station share the same channel; therefore, in step 101, the server can identify all users who have communication requirements with the base station and share the same channel. Among the identified users, in addition to MEC computing offloading users, ordinary uplink users and ordinary downlink users can also be included.

[0028] In an example, the server can execute the resource allocation method in this embodiment periodically with a preset duration as the period; at this time, each time all users who have communication requirements with the base station are identified from the users accessing the same channel of the base station within the current period.

[0029] In step 102, among multiple task groups arranged in sequence, each task group contains at least one of an uplink task and a downlink task. That is, an uplink task and a downlink task can be grouped together, or an uplink task can be independently grouped, or a downlink task can be independently grouped. Moreover, the uplink task and the downlink task of the same MEC computing offloading user are grouped into different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located. Since the users of each task group in this embodiment transmit data on the same channel in a time-division multiplexing manner in the full-duplex mode, and the uplink task and the downlink task of the same MEC computing offloading user cannot be executed at the same time, the uplink task and the downlink task of the same MEC computing offloading user cannot be grouped into the same task group. In addition, since each task only needs to be executed once to be completed, each task will only be assigned to one task group.

[0030] Let the number of uplink tasks be denoted as M, the number of downlink tasks be denoted as N, and the number of task groups be denoted as K. In an example, if the number M of uplink tasks is different from the number N of downlink tasks, there are task groups in the K task groups that contain only uplink tasks or only downlink tasks. For example, if M is less than N, there are task groups in the K task groups that contain only uplink tasks; if N is less than M, there are task groups in the K task groups that contain only downlink tasks.

[0031] Moreover, in step 102, the K task groups will also be sorted. Since the uplink task of the same MEC computing offloading user needs to be executed before the downlink task, after the K task groups are sorted, it is required that the task group where the uplink task of the same MEC computing offloading user is located is arranged in front of the task group where the downlink task of this MEC computing offloading user is located. Based on the above grouping and the arrangement of each task group, the base station can complete the data transmission of the K task groups in the full-duplex mode in a time-division multiplexing manner according to the arrangement order of the K task groups. Among them, the user terminal can transmit data to the base station based on a preset transmit power to complete the uplink task, and the base station can also transmit data to the user terminal based on a preset transmit power to complete the downlink task. The time occupied by each task group is the larger of the data transmission duration of the uplink task and the data transmission duration of the downlink task in this task group.

[0032] In this embodiment, the user's uplink tasks and downlink tasks are grouped to obtain a plurality of task groups arranged in sequence, so as to allow the base station to complete the data transmission of multiple task groups in a time-division multiplexing manner in the full-duplex mode; wherein, the uplink tasks and downlink tasks of the same MEC computing offloading user are assigned to different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located. That is, in this application, an uplink task and a downlink task form a task group and the data transmission of the task group is completed in the full-duplex mode, and the grouping method in this application allows the user in the MEC scenario to perform normal data transmission with the base station, thereby reducing the total system delay in the MEC scenario.

[0033] The second embodiment of the present invention relates to a resource allocation method. The second embodiment is substantially the same as the first embodiment, and the main difference is that: in the second embodiment, another specific way to obtain K task groups arranged in sequence is provided; as Figure 3 shown is the flowchart of the resource allocation method in the second embodiment of the present invention.

[0034] Step 201, identify the users with communication requirements with the base station having the mobile edge computing (MEC) function. This step is similar to step 101 in the first embodiment and will not be elaborated here.

[0035] Step 202, group the user's uplink tasks and downlink tasks to obtain a plurality of task groups arranged in sequence; including the following sub-steps:

[0036] Sub-step 2011, combine the user's uplink tasks and downlink tasks to obtain a plurality of temporary task groups; wherein, each temporary task group contains an uplink task and a downlink task, each uplink task exists in several temporary task groups, and each downlink task exists in several temporary task groups;

[0037] Sub-step 2012, estimate the data transmission time difference of each temporary task group in the full-duplex mode and in the half-duplex mode;

[0038] Sub-step 2013, based on the data transmission time difference of each temporary task group, determine a plurality of task groups arranged in sequence.

[0039] The following is a detailed description of the above sub-steps.

[0040] In sub-step 2011, assume that among the users identified in step 201, there are: N MEC computing offloading users, P ordinary uplink users, and Q ordinary downlink users. Each MEC computing offloading user has one uplink task and one downlink task, each ordinary uplink user has one uplink task, and each ordinary downlink user has one downlink task. Then, the number of temporary task groups can be: L = (P + N) * (Q + N) - N. That is, the uplink task of each ordinary uplink user can be combined with any downlink task to form a temporary task group; the uplink task of each MEC computing offloading user can be combined with any downlink task except the downlink task of this MEC computing offloading user to form a temporary task group; the downlink task of each ordinary downlink user can be combined with any uplink task to form a temporary task group; the downlink task of each MEC computing offloading user can be combined with any uplink task except the uplink task of this MEC computing offloading user to form a temporary task group.

[0041] In sub-step 2012, for each temporary task group, estimate the data transmission time difference between the full-duplex mode and the half-duplex mode of this temporary task group. In one example, the minimum data transmission duration of each temporary task group in the full-duplex mode and the minimum data transmission duration in the half-duplex mode can be estimated at least according to the preset maximum transmission power for data transmission and the data transmission volume of each temporary task group; and calculate the difference between the minimum data transmission duration of each temporary task group in the full-duplex mode and the minimum data transmission duration in the half-duplex mode as the data transmission time difference of each temporary task group.

[0042] The minimum data transmission duration of each temporary task group in the full-duplex mode can be estimated, for example, using the binary search method, as follows.

[0043] Denote the uplink task in the temporary task group as m and the downlink task as n; then, each temporary task group needs to meet the following conditions:

[0044]

[0045]

[0046]

[0047]

[0048] Among them, t m,n represents the data transmission duration occupied by the temporary task group (m, n), B represents the channel bandwidth, and Denote the transmit power of the user terminal performing the uplink task and the transmit power of the base station performing the downlink task in the temporary task group (m, n). h m,n Denote the channel power gain. Denote the data transmission volume of the uplink task and the data transmission volume of the downlink task. Denote the maximum transmit power of the uplink task and the maximum transmit power of the downlink task respectively, and α denotes the full-duplex self-interference cancellation ratio of the base station segment.

[0049] In order to minimize t allocated to each temporary task group m,n it is possible to first determine and such that one of them takes the maximum value, i.e., let or let That is, the optimal transmit power corresponding to one of the tasks is the maximum power value allowed by the system; and the optimal value of the other power is obtained by using the binary search method, i.e., the optimal transmit power of the other task. Among them, the end condition of the binary search method is that the difference between the solutions found in two adjacent searches is within a preset error range.

[0050] As above, after determining the values of and of the temporary task group by using the binary search method, the minimum data transmission duration of this temporary task group in the full-duplex mode can be obtained, denoted as That is, it represents the minimum delay that the data transmission of this temporary task group can achieve. Therefore, the time taken for the base station and the users of each temporary task group to complete the data transmission of each temporary task group based on the optimal transmit power is the minimum data transmission duration.

[0051] The minimum data transmission duration of each temporary task group in the half-duplex mode refers to the sum of the minimum data transmission duration of the uplink task in this temporary task group and the minimum data transmission duration of the downlink task in this temporary task group; the estimation method of the minimum data transmission duration of the uplink task or the downlink task, for example, can be that the minimum data transmission duration of the uplink task = the transmission data volume of the uplink task / the maximum transmit power of the uplink task; the minimum data transmission duration of the downlink task = the transmission data volume of the downlink task / the maximum transmit power of the downlink task. Denote the minimum transmission data duration of the uplink task m and the minimum transmission data duration of the downlink task n as The time difference between the minimum data transmission duration of the temporary task group in the full-duplex mode and the data transmission time in the half-duplex mode can be expressed as:

[0052]

[0053] In sub-step 2013, screening can be performed based on the greedy algorithm to obtain K task groups. Specifically, the greedy algorithm may include the following steps.

[0054] Step 3.1:

[0055] Sub-step 3.1.1: Select the first type of task group cluster from all existing temporary task groups (when sub-step 3.1.1 is executed for the first time, all existing temporary task groups are L). Each task group in the first type of task group cluster contains: the uplink tasks of ordinary uplink users or MEC computing offloading users, and the downlink tasks of ordinary downlink users.

[0056] Sub-step 3.1.2: Select a temporary task group with the largest data transmission time difference from the first type of task group cluster as the first selected task group K1(m1, n1). Among them, the minimum data transmission duration, the optimal transmit power of the uplink task, and the optimal transmit power of the downlink task of the task group K1(m1, n1) have been determined in the above sub-step 2012. And the optimal transmit power of the uplink task can be sent to the user terminal to which the uplink task belongs for the user terminal to transmit data to the base station based on the optimal transmit power when completing the uplink task subsequently.

[0057] Sub-step 3.1.3: Delete the temporary task groups containing the uplink task m1 and the downlink task n1 from all existing temporary task groups (when sub-step 3.1.3 is executed for the first time, all existing temporary task groups are L).

[0058] Sub-step 3.1.3: If it is determined that the uplink task m1 in K1 is the uplink task of the MEC computing offloading user, then go to Step 3.2.

[0059] Step 3.2:

[0060] Sub-step 3.2.1: Select the second type of task group cluster from the remaining temporary task groups after sub-step 3.1.3 is executed. Each temporary task group in the second type of task group cluster contains: the downlink task n2 of the MEC computing offloading user.

[0061] Sub-step 3.2.2: Select a temporary task group with the largest data transmission time difference from the second type of task group cluster as the second selected task group K2(m2, n2).

[0062] Sub-step 3.2.3: Delete the temporary task groups containing the uplink task m2 and the downlink task n2 from the remaining temporary task groups after sub-step 3.1.3 is executed. At this time, there are L - 2 remaining temporary task groups.

[0063] Sub-step 3.2.4, if it is determined that the uplink task m2 in task group K2 is the uplink task of another MEC computing offloading user, then return to step 3.2; if it is determined that the uplink task m2 in task group K2 is the uplink task of an ordinary uplink user, then return to step 3.1.

[0064] Through the continuous loop calculation of the above steps 3.1 and 3.2, until all K task groups arranged in sequence are selected.

[0065] In this embodiment, the binary search method is used to find the optimal transmission power of each task group, and based on this, the minimum data transmission duration of each task group is determined; then the greedy algorithm is used to screen out K task groups arranged in sequence; since the time complexities of both the binary search method and the greedy algorithm are relatively low, the time consumed by the resource allocation calculation process can be greatly reduced, thereby greatly reducing the total system delay in the MEC scenario. However, this embodiment does not make any restrictions in this regard. In other examples, other algorithms can also be used for calculation. Generally, algorithms with a time complexity less than polynomial time can be used.

[0066] The step division of the above various methods is only for clear description. When implemented, they can be combined into one step or some steps can be split into multiple steps. As long as the same logical relationship is included, they are all within the protection scope of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs, but not changing the core design of its algorithm and process are all within the protection scope of this patent.

[0067] The third embodiment of the present invention relates to a server, as Figure 4 shown, including:

[0068] At least one processor 401; and,

[0069] A memory 402 communicatively connected to the at least one processor 401; wherein,

[0070] The memory 402 stores instructions executable by the at least one processor 401, and the instructions are executed by the at least one processor 401 so that the at least one processor 401 can execute the above resource allocation method.

[0071] Wherein, the server is arranged in the base station.

[0072] Among them, the memory 402 and the processor 401 are connected in a bus manner. The bus may include any number of interconnected buses and bridges, and the bus connects various circuits of one or more processors 401 and the memory 402 together. The bus can also connect various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art, and thus will not be further described herein. The bus interface provides an interface between the bus and the transceiver. The transceiver can be a single component or multiple components, such as multiple receivers and transmitters, and provides a unit for communicating with various other devices over a transmission medium. The data processed by the processor 401 is transmitted over a wireless medium through the antenna. Further, the antenna also receives data and transmits the data to the processor 401.

[0073] The processor 401 is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interface, voltage regulation, power management, and other control functions. The memory 402 can be used to store data used by the processor 401 when executing operations.

[0074] The fourth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the above method embodiments are implemented.

[0075] That is, those skilled in the art can understand that all or part of the steps of implementing the above method embodiments can be completed by a program instructing relevant hardware. The program is stored in a storage medium, including several instructions for causing a device (which can be a single-chip microcomputer, a chip, etc.) or a processor (Krocessor) to execute all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs that can store program codes.

[0076] Those of ordinary skill in the art can understand that the above embodiments are specific embodiments for implementing the present invention, and in practical applications, various changes can be made in form and details without departing from the spirit and scope of the present invention.

Claims

1. A resource allocation method, characterized in that, comprising: identifying users with communication requirements for a base station having a Mobile Edge Computing (MEC) function; grouping the uplink tasks and downlink tasks of the users to obtain a plurality of task groups arranged in sequence, so as to allow the base station to complete data transmission of the plurality of task groups in sequence in a time-division multiplexing manner in full-duplex mode; wherein each of the task groups includes at least one of the uplink task and the downlink task, and among the users, the uplink task and the downlink task of the same MEC computing offloading user are assigned to different task groups, and the task group where the uplink task is located is arranged in front of the task group where the downlink task is located.

2. The resource allocation method according to claim 1, characterized in that, the grouping of the uplink tasks and downlink tasks of the users to obtain a plurality of task groups arranged in sequence includes: combining the uplink tasks and the downlink tasks to obtain a plurality of temporary task groups; wherein each of the temporary task groups includes an uplink task and a downlink task, each uplink task exists in several of the temporary task groups, and each downlink task exists in several of the temporary task groups; estimating the data transmission time difference of each of the temporary task groups in full-duplex mode and in half-duplex mode; determining a plurality of the task groups arranged in sequence based on the data transmission time difference of each of the temporary task groups.

3. The resource allocation method according to claim 2, characterized in that, the estimating the data transmission time difference of each of the temporary task groups in full-duplex mode and in half-duplex mode includes: estimating at least the minimum data transmission duration of each of the temporary task groups in full-duplex mode and the minimum data transmission duration of each of the temporary task groups in half-duplex mode according to a preset maximum transmission power for data transmission and the data transmission volume of each of the task groups; calculating the difference between the minimum data transmission duration of each of the temporary task groups in full-duplex mode and the minimum data transmission duration of each of the temporary task groups in half-duplex mode as the data transmission time difference of each of the temporary task groups.

4. The resource allocation method according to claim 3, characterized in that, in the estimating at least the minimum data transmission duration of each of the temporary task groups in full-duplex mode according to a preset maximum transmission power for data transmission and the data transmission volume of each of the task groups, the minimum data transmission duration of each of the temporary task groups in full-duplex mode is estimated based on the binary search method.

5. The resource allocation method according to claim 4, characterized in that, in the step of estimating the minimum data transmission duration of each of the temporary task groups in full-duplex mode based on the binary search method, the optimal transmission power corresponding to each of the temporary task groups is also estimated; wherein the time taken for the base station and the users of each of the temporary task groups to complete data transmission of each of the temporary task groups based on the optimal transmission power is the minimum data transmission duration.

6. The resource allocation method according to claim 2, characterized in that, Based on the data transmission time differences of each of the temporary task groups, among the multiple task groups arranged in sequence, multiple task groups arranged in sequence are determined based on the greedy algorithm.

7. The resource allocation method according to claim 1, wherein, the resource allocation method is periodically executed; among the users identified as having communication requirements with a base station having mobile edge computing (MEC) capabilities, all users having communication requirements with the base station within the current period are identified.

8. A server, wherein, comprising: at least one processor; and, a memory communicatively connected to the at least one processor; wherein, the memory stores instructions executable by the at least one processor, and when the instructions are executed by the at least one processor, the at least one processor is enabled to execute the resource allocation method according to any one of claims 1 to 7.

9. The server according to claim 8, wherein, the server is disposed in the base station.

10. A computer-readable storage medium storing a computer program, wherein, when the computer program is executed by a processor, the resource allocation method according to any one of claims 1 to 7 is implemented.

Images