CN111278052B - Industrial field data multi-priority scheduling method based on 5G slice - Google Patents

Industrial field data multi-priority scheduling method based on 5G slice Download PDF

Info

Publication number
CN111278052B
CN111278052B CN202010064702.1A CN202010064702A CN111278052B CN 111278052 B CN111278052 B CN 111278052B CN 202010064702 A CN202010064702 A CN 202010064702A CN 111278052 B CN111278052 B CN 111278052B
Authority
CN
China
Prior art keywords
slice
scheduling
priority
user
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010064702.1A
Other languages
Chinese (zh)
Other versions
CN111278052A (en
Inventor
唐朝伟
阮帅
温浩田
冯鑫鑫
黄宝进
刘洪宾
汤东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University
Original Assignee
Chongqing University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University filed Critical Chongqing University
Priority to CN202010064702.1A priority Critical patent/CN111278052B/en
Publication of CN111278052A publication Critical patent/CN111278052A/en
Application granted granted Critical
Publication of CN111278052B publication Critical patent/CN111278052B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1268—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Landscapes

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

Abstract

The invention discloses a 5G slice-based industrial field data multi-priority scheduling method, which comprises the steps that S1, a 5G base station obtains resource request data and channel state data of industrial field users; s2: the scheduler of the 5G base station judges whether the task buffer queue is empty or not in the t scheduling period; if the scheduling period is empty, waiting for the next scheduling period, and if the scheduling period is not empty, entering S3; s3: a scheduler of the 5G base station allocates corresponding resources to different slices according to the resource request data of the user; s4: and respectively scheduling resources for the users in the same slice. The invention completes the resource allocation of three 5G slices, ensures the flexible scheduling and isolation of the resources among the slices, improves the throughput of the system, and simultaneously improves the fairness of the scheduling method for different service quality requirements.

Description

Industrial field data multi-priority scheduling method based on 5G slice
Technical Field
The invention relates to the technical field of mobile communication, in particular to a 5G slice-based industrial field data multi-priority scheduling method.
Background
Radio resources in a mobile communication system are limited, and the radio resources include frequency, time, space, power, code words and other resources, so how to fully utilize the limited radio resources to meet the increasing demand of wireless services is the task that needs to be completed by a radio resource scheduling and allocating mechanism. There are various definitions of resource scheduling assignment mechanisms, but the following are widely accepted definitions: the scheduler on the base station needs to dynamically control the allocation of the time-frequency resources in real time, and allocate the time-frequency resources to a certain user within a certain time. The scheduling algorithm requires a balance between the Quality of Service (QoS) of the users and the maximization of the system capacity. Three important indexes of the resource scheduling algorithm are the spectrum utilization rate, the user fairness and the user QoS requirement.
In an industrial field, industrial field data mainly refers to data collected by industrial production equipment and target products in real time in an internet of things running mode, and the data includes data of running states of the equipment and the products, such as operation and running conditions, working condition conditions, environmental parameters and the like. The data can be uploaded to a cloud terminal through a 5G base station for data processing and analysis, and then the data is reused by a user for application such as intelligent design, intelligent production, networked collaborative manufacturing, intelligent service and personalized customization.
There are three application scenarios in 5G, including eMMB (Enhanced Mobile Broadband), urrllc (Ultra Reliable & Low Latency Communication, Low Latency, high reliability Communication) and mtc (Massive Machine Type Communication, Massive internet of things). According to the time constraint, the business of the uRLLC belongs to real-time information, in this scene, the requirement on time delay is very high and often reaches the level of 1ms, such as industrial automation control, real-time cooperative robots and other real-time monitoring and real-time early warning data, and if the transmission flow of the data is too long, the value of the data is difficult to be played in the production process. The eMMB mainly shows an increase in network capacity, supports a large amount of data transmission by different devices, and increases the bandwidth also mean an increase in transmission rate. The ultra-large network throughput and the faster rate enable users to obtain better user experience, including applications such as remote wireless industrial video monitoring, industrial AR (Augmented Reality), and the like. mMTC is a large-scale Internet of things, the equipment of the general Internet of things is very simple, and the quantity of data information to be transmitted is not large.
There are three common scheduling algorithms: a polling algorithm, a maximum carrier-to-interference ratio algorithm and a proportional fairness algorithm.
The polling algorithm is to sequentially allocate resources to different users requesting for scheduling in a circulating manner, and only the fairness among the users is considered in the algorithm, so that the system throughput is lost; the maximum carrier-to-interference ratio algorithm always provides resources for users with the best channels, the algorithm can maximize the system throughput, but the fairness among cell users cannot be guaranteed; the proportional fairness algorithm considers the ratio of the instantaneous rate to the long-term average rate when selecting the users, and simultaneously adjusts different users by using the weight value, so that the aim of simultaneously considering the overall throughput of the system and the fairness of the users is fulfilled, but the QoS information of the service is not considered.
The development of 5G is brought by the explosive increase of data rate and capacity requirements and the differentiation requirements of large scale, high reliability, low time delay and the like. Therefore, in the face of different scenes of an industrial field in 5G and different QoS requirements of services, a targeted multi-priority scheduling method needs to be designed, wireless resources are reasonably distributed and managed for different 5G slices under the condition of limited wireless resources, and the resource utilization rate and the fairness among users are improved as much as possible under the condition that the service requirements of high-priority services in an intelligent manufacturing factory are met.
Disclosure of Invention
Aiming at the problem of unreasonable wireless resource allocation in the prior art, the invention provides a 5G slice-based industrial field data multi-priority scheduling method
In order to achieve the purpose, the invention provides the following technical scheme:
A5G slice-based industrial field data multi-priority scheduling method specifically comprises the following steps:
s1, acquiring industrial field resource request data and channel state data of a user by the 5G base station;
s2: a scheduler of the 5G base station judges whether a task cache queue is empty or not in t scheduling periods; if the scheduling period is empty, waiting for the next scheduling period, and if the scheduling period is not empty, entering S3;
s3: a scheduler of the 5G base station allocates corresponding resources to different slices according to the resource request data of the user;
s4: and respectively scheduling resources for the users in the same slice.
Preferably, in S1, the method for the 5G base station to acquire data includes:
when the user terminal has uplink data to be sent, the data to be sent is firstly put into a cache, then a cache state report is submitted to a base station gNB through a physical uplink control channel, and an uplink scheduling request is sent to inform the base station gNB of the data to be sent;
a scheduler of a base station gNB receives an uplink scheduling request of a user terminal, performs resource allocation on the user terminal according to a buffer status report of the user terminal and an uplink channel condition of the user terminal, and sends a resource allocation result to the user terminal through a physical downlink control channel;
the user terminal uses the resource allocated by the base station gNB to transmit data to the base station gNB through the physical uplink shared channel.
Preferably, in S3, the slices include eMMB slices, urrllc slices, and mtc slices.
Preferably, in S3, the resource allocation specifically includes the following steps:
s3-1: the number of RBs scheduled by the scheduler is Q, and at the scheduling time t, the total number of users requesting resources is N, and then the priority of each slice in each RB is:
Figure RE-BDA0002375613570000031
in the formula (1), the first and second groups,
Figure RE-BDA0002375613570000032
indicating the priority of the ith slice in the jth RB in the tth scheduling period, wherein the priority is calculated according to the rate of all users in the ith slice in the jth RB in order to improve the system throughput; n isi(t) represents the number of users of the ith slice in the tth scheduling period;
Figure RE-BDA0002375613570000041
indicating the instantaneous transmission rate of the kth user of the ith slice in the jth RB in the tth scheduling period;
s3-2: selecting the jth RB in the ith slice for scheduling, and judging whether the current scheduled RB is adjacent to the RB which is already allocated to the slice; if yes, go to step S3-3; if not, let j ═ j +1, repeat step S3-2;
s3-3: allocating a jth RB for the ith slice, and deleting the RB from the RB queue; judging whether the ith slice obtains the required resources in real time, if so, executing a step S3-4; if not, let j ═ j +1, re-execute step S3-2;
s3-4: judging whether the RB queue is empty or not, or whether all slices acquire required resources or not; if so, ending the slice resource scheduling; if not, executing i-i +1 and repeatedly executing the steps.
Preferably, in S4, the method for scheduling resources for users in the same slice includes:
s4-1, dividing the resource into M RB groups according to the number of users in the slice after the slice resource scheduling is finished;
s4-2, calculating the priority of each user in the slice on the RB group according to the following calculation formula:
Figure RE-BDA0002375613570000042
in the formula (2), the first and second groups,
Figure RE-BDA0002375613570000043
indicating the priority of the s-th user in the f-th RB group in the t-th scheduling period; rhos(t) represents the t scheduling period, the highest packet loss rate tolerated by the s user, and ps(t) is an element (0, 1); so-log (p)s(t)) indicates that the lower the highest packet loss rate tolerated, the higher the priority; tau iss(t) represents the t-th scheduling period, the maximum waiting time delay of the s-th user, τs(t) the smaller, the higher the user priority;
Figure RE-BDA0002375613570000044
indicating the instantaneous transmission rate of the s-th user in the f-th RB group in the t-th scheduling period; rs(t) represents the instantaneous transmission rate before the s-th userThe higher the instantaneous transmission rate is, the better the channel quality condition is, and the higher the priority is; ds(t) represents the t-th scheduling period, the amount of data the s-th user waits to transmit,
Figure RE-BDA0002375613570000045
the higher the traffic is, the higher the proportion of the pending traffic of the s-th user in the total traffic of all the requesting users in the moment is, the higher the priority is in the t-th scheduling period; b represents the total number of users in the slice;
s4-3, allocating the RB group with the highest corresponding priority for each user in turn according to the priority of the user, and judging whether the RB queue in the slice is empty in real time; if so, ending the resource allocation; if not, the steps are repeatedly executed.
The invention also provides a computer storage medium having a computer program stored thereon, wherein the computer program performs the steps of any of the methods described above.
In summary, due to the adoption of the technical scheme, compared with the prior art, the invention at least has the following beneficial effects:
1. the invention completes the resource allocation of three 5G slices, ensures the flexible scheduling and isolation of resources among the slices, ensures the allocation of the required resources of high-priority services such as uRLLC slice service and the like, and improves the throughput of the system.
2. The invention comprehensively considers the performance indexes of the data service such as transmission rate, time delay requirement, packet loss rate, data volume to be transmitted and the like, preferentially schedules the users with good channel condition, high time delay requirement, strong high reliability requirement and large data volume to be transmitted, and improves the fairness and the throughput of the scheduling algorithm.
Description of the drawings:
fig. 1 is a flowchart illustrating a 5G slice-based industrial field data multi-priority scheduling method according to an exemplary embodiment of the present invention.
Fig. 2 is a flowchart illustrating a method for scheduling slice resources according to an exemplary embodiment of the present invention.
Fig. 3 is a flowchart illustrating an intra-slice user scheduling method according to an exemplary embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to examples and embodiments. It should be understood that the scope of the above-described subject matter is not limited to the following examples, and any techniques implemented based on the disclosure of the present invention are within the scope of the present invention.
In the description of the present invention, it is to be understood that the terms "longitudinal", "lateral", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are used merely for convenience of description and for simplicity of description, and do not indicate or imply that the referenced devices or elements must have a particular orientation, be constructed in a particular orientation, and be operated, and thus, are not to be construed as limiting the present invention.
With the development of communication technology, the 5G era has been entered now, and the process of communication between the user side and the server side is a resource scheduling process, and the uplink scheduling process of the 5G NR (NEW radio) is now:
when a User Equipment (UE) has Uplink data to be transmitted, the data to be transmitted is first put into a Buffer, and then a Physical Uplink Control Channel (PUCCH) is used to submit a Buffer State Report (BSR) to a base station gNB, and an SR (Scheduling Request) is sent to notify the base station gNB that the data needs to be transmitted.
And secondly, an uplink scheduler of the base station gNB receives an uplink scheduling request of the UE, and performs resource allocation on the UE according to a buffer state report of the UE and an uplink channel condition of the UE, wherein the uplink channel condition is obtained by the UE periodically sending an SRS (Sounding Reference Signal) to the base station gNB. The resource allocation result is transmitted to the UE through a PDCCH (Physical Downlink Control Channel) using an UL Grant (UpLink Grant).
The UE transmits data to the base station through a PUSCH (Physical Uplink Shared Channel) using resources allocated to it by the base station gNB.
That is, the uplink scheduler of the base station gNB receives the buffer status report and the uplink channel status of the UE, and then completes dynamic scheduling of the time-frequency resources according to the built-in scheduling algorithm, so as to perform effective allocation of resources for the user and improve the utilization rate of the resources.
As shown in fig. 1, the present invention provides a 5G slice-based industrial field data multi-priority scheduling method, which specifically includes the following steps:
s1: and the 5G base station acquires industrial field resource request data and channel state data of a user.
In this embodiment, when a user performs data query by using a terminal network, the terminal may send queried resource request data to the 5G base station in real time through a corresponding uplink channel, and a scheduler of the 5G base station performs resource scheduling according to the received resource request data and channel state data.
S2: is the scheduler of the 5G base station determine whether the task buffer queue is empty in the t-th scheduling period? If it is empty, wait for the next scheduling period, and if it is not empty, proceed to the next step S3.
In this embodiment, the task cache queue is empty: representing that the resource scheduling requests of all users have been satisfied in the t-th scheduling period. And a scheduling decision scheme is periodically provided for data scheduling services generated in real time on an industrial site by adopting dynamic scheduling.
S3: and the scheduler of the 5G base station allocates the corresponding resources to different slices according to the resource request data of the users.
The slice is a networking mode according to needs, an operator can cut out a plurality of virtual end-to-end networks on a unified infrastructure, and each network slice is logically isolated from a wireless access network to a bearer network and then to a core network and is adapted to various types of service applications. However, there are three application scenarios in 5G, which are embb (Enhanced Mobile Broadband), urrllc (Ultra Reliable & Low Latency Communication, Low Latency, high reliability Communication) and mtc (Massive Machine Type Communication), so the present invention may adopt three slices, including embb slice, urrllc slice and mtc slice.
In this embodiment, resources allocated to different slices are isolated and independent from each other in the frequency domain, and can be flexibly adjusted, so that air interface congestion of one network slice does not affect other network slices. And the high-priority slice can be allocated with spectrum resources with better channel conditions, so that the throughput of the system is improved, and the service guarantee of high-priority services is improved.
In the embodiment, for service requirements of different services of industrial field data, the uRLLC slice needs low delay and high reliability, for example, a remote control real-time cooperative robot needs to give priority to allocation resources, so that queuing delay is reduced; the eMB slice has a lot of service demands of high data volume, the throughput of the whole network can be improved by preferentially distributing resources, but the uRLLC slice does not have too high requirements on time delay; the scheduling priority of the mMTC slice is the lowest, and under most conditions of massive sensors, the uplink data volume is not large and the requirement on time delay is not high. Therefore, in the invention, the urrllc slice is of a first priority (highest priority), the eMMB slice is of a second priority, the mtc slice is of a third priority, and RB (Resource Block) resources are respectively configured according to the priorities.
Then, as shown in fig. 2, the slice resource scheduling specifically includes the following steps:
s3-1: when the number of RBs (Resource blocks) schedulable by the scheduler is Q, and the total number of users requesting resources at the scheduling time t is N, the priority of each slice in each RB is defined by formula (1):
Figure RE-BDA0002375613570000081
in the formula (1), the first and second groups,
Figure RE-BDA0002375613570000082
indicating that the ith slice is at the t-th scheduling periodThe priority of j RBs is calculated according to the rate of all users in the ith slice in the jth RB in order to improve the system throughput; n isi(t) represents the number of users of the ith slice in the tth scheduling period;
Figure RE-BDA0002375613570000083
indicating the instantaneous transmission rate of the kth user of the ith slice in the jth RB in the tth scheduling period.
A priority matrix M is thus obtained:
Figure RE-BDA0002375613570000091
wherein Q is1Represents the number of RBs in the urrllc slice; q2Represents the number of RBs in an eMMB slice; q3Denotes the number of RBs in mMTC slice, and Q ═ Q1+Q2+Q3。
S3-2: and selecting the jth RB in the ith slice for scheduling, and judging whether the current scheduled RB is adjacent to the RB which is already allocated to the slice. If yes, go to step S3-3; if not, let j be j +1, and repeat step S3-2.
In this embodiment, both 4G LTE and 5G NR use an OFDM (orthogonal frequency division multiplexing) system technology, and in the OFDM system, 12 subcarriers are consecutive in frequency, and one slot in time domain is referred to as 1 RB (Resource Block). The adjacent RBs represent two resource blocks in frequency succession. The significance of this is to keep all RB spectra inside each slice contiguous; less signal interference occurs from slice to slice.
In this embodiment, to ensure fast allocation of resources, i is preferably 1, and j is preferably 1.
S3-3: allocating a jth RB for the ith slice, and deleting the RB from the RB queue; and judging whether the ith slice obtains the required resource in real time. If yes, go to step S3-4; if not, let j be j +1, re-execute step S3-2.
S3-4: judging whether the RB queue is empty or not, or whether all slices acquire required resources or not; if so, ending the slice resource scheduling; if not, executing i-i +1 and repeatedly executing the steps.
In this embodiment, after slice resource scheduling, the urrllc slice, the eMMB slice, and the mtc slice respectively obtain respective continuous and isolated RB groups, and then user scheduling in the slices will not interfere with each other.
S4: and carrying out resource scheduling on users in the same slice.
The scheduling process in a slice can be understood as a logical cell, and the scheduler performs resource scheduling on the users belonging to the cell by using the resources obtained by slice resource scheduling. Aiming at the QoS requirements of different data in a 5G industrial field, in the process of scheduling users in slices, the performance indexes needing to be comprehensively considered comprise transmission rate, time delay requirements, packet loss rate, data volume to be transmitted and the like.
As shown in fig. 3, the intra-slice user scheduling method includes the following steps:
and S4-1, after the slice resource scheduling is finished, dividing the resource into M RB groups with the same size according to the number of users in the slice.
In this embodiment, for example, if the number of RBs acquired in a slice is a and there are B users in the slice, the number of RB groups obtained is
Figure RE-BDA0002375613570000101
S4-2, calculating the priority of each user in the slice on the RB group according to the following calculation formula:
Figure RE-BDA0002375613570000102
in the formula (2), the first and second groups,
Figure RE-BDA0002375613570000103
indicating the priority of the s-th user in the f-th RB group in the t-th scheduling period; rhos(t) represents the t scheduling period, the highest packet loss rate tolerated by the s user, and ps(t) is an element (0, 1); therefore-log(ρs(t)) indicates that the lower the highest packet loss rate tolerated, the higher the priority; tau iss(t) represents the t-th scheduling period, the maximum waiting time delay of the s-th user, τs(t) the smaller, the higher the user priority;
Figure RE-BDA0002375613570000104
indicating the instantaneous transmission rate of the s-th user in the f-th RB group in the t-th scheduling period; rs(t) represents the instantaneous transmission rate before the s-th user, the higher the instantaneous transmission rate is, the better the channel quality condition is, the higher the priority is; ds(t) represents the t-th scheduling period, the amount of data the s-th user waits to transmit,
Figure RE-BDA0002375613570000105
the higher the traffic is, the higher the proportion of the pending traffic of the s-th user in the total traffic of all the requesting users in the moment is, the higher the priority is in the t-th scheduling period; b represents the total number of users in the slice.
S4-3, allocating the corresponding highest priority RB group for each user in turn according to the priority of the user, and judging whether the RB queue in the slice is empty in real time; if so, ending the resource allocation; if not, the steps are repeatedly executed.
Meanwhile, the invention also provides a computer storage medium.
The computer storage medium of the embodiment of the present invention stores a computer program, and when the computer program is executed by a processor, the computer program implements any one of the steps of the above-mentioned 5G slice-based industrial field data multi-priority scheduling method, and the computer storage medium may adopt any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.

Claims (5)

1. A5G slice-based industrial field data multi-priority scheduling method is characterized by specifically comprising the following steps:
s1, acquiring industrial field resource request data and channel state data of a user by the 5G base station;
s2: the scheduler of the 5G base station judges whether the task buffer queue is empty or not in the t scheduling period; if the scheduling period is empty, waiting for the next scheduling period, and if the scheduling period is not empty, entering S3;
s3: a scheduler of the 5G base station allocates corresponding resources to different slices according to the resource request data of the user;
s4: respectively scheduling resources for users in the same slice;
s4-1, dividing the resource into M RB groups according to the number of users in the slice after the slice resource scheduling is finished;
s4-2, calculating the priority of each user in the slice on the RB group according to the following calculation formula:
Figure FDA0003198163660000011
in the formula (2), the first and second groups,
Figure FDA0003198163660000012
indicating the priority of the s-th user in the f-th RB group in the t-th scheduling period; rhos(t) represents the t scheduling period, the highest packet loss rate tolerated by the s user, and ps(t) is an element (0, 1); so-log (p)s(t)) indicates that the lower the highest packet loss rate tolerated, the higher the priority; tau iss(t) represents the t-th scheduling period, the maximum waiting time delay of the s-th user, τs(t) the smaller, the higher the user priority;
Figure FDA0003198163660000013
indicating the instantaneous transmission rate of the s-th user in the f-th RB group in the t-th scheduling period; rs(t) before the s-th userThe higher the instantaneous transmission rate is, the better the channel quality condition is, and the higher the priority is; ds(t) represents the amount of data waiting for transmission for the tth scheduling period and the sth user;
Figure FDA0003198163660000014
the higher the traffic is, the higher the proportion of the to-be-sent traffic of the s-th user in the total traffic of all the requesting users in the t-th scheduling period is, the higher the priority is; b represents the total number of users in the slice;
s4-3, allocating the RB group with the highest corresponding priority for each user in turn according to the priority of the user, and judging whether the RB queue in the slice is empty in real time; if so, ending the resource allocation; if not, the steps are repeatedly executed.
2. The multi-priority scheduling method for industrial field data based on 5G slices according to claim 1, wherein in S1, the method for the 5G base station to acquire data is:
when the user terminal has uplink data to be sent, the data to be sent is firstly put into a cache, then a cache state report is submitted to a base station gNB through a physical uplink control channel, and an uplink scheduling request is sent to inform the base station gNB of the data to be sent;
a scheduler of a base station gNB receives an uplink scheduling request of a user terminal, performs resource allocation on the user terminal according to a buffer status report of the user terminal and an uplink channel condition of the user terminal, and sends a resource allocation result to the user terminal through a physical downlink control channel;
the user terminal uses the resource allocated by the base station gNB to transmit data to the base station gNB through the physical uplink shared channel.
3. The method for 5G slice-based multi-priority scheduling of industrial field data according to claim 1, wherein in S3, the slices include eMB slices, uRLLC slices and mMTC slices.
4. The multi-priority scheduling method for industrial field data based on 5G slices according to claim 1, wherein in S3, the resource allocation specifically includes the following steps:
s3-1: the number of RBs scheduled by the scheduler is Q, and in the t-th scheduling period, the total number of users requesting resources is N, and then the priority of each slice in each RB is:
Figure FDA0003198163660000021
in the formula (1), the first and second groups,
Figure FDA0003198163660000022
indicating the priority of the ith slice in the jth RB in the tth scheduling period, wherein the priority is calculated according to the rate of all users in the ith slice in the jth RB in order to improve the system throughput; n isi(t) represents the number of users of the ith slice in the tth scheduling period;
Figure FDA0003198163660000023
indicating the instantaneous transmission rate of the kth user of the ith slice in the jth RB in the tth scheduling period;
s3-2: selecting the jth RB in the ith slice for scheduling, and judging whether the current scheduled RB is adjacent to the RB which is already allocated to the slice; if yes, go to step S3-3; if not, let j ═ j +1, repeat step S3-2;
s3-3: allocating a jth RB for the ith slice, and deleting the RB from the RB queue; judging whether the ith slice obtains the required resources in real time, if so, executing a step S3-4; if not, let j ═ j +1, re-execute step S3-2;
s3-4: judging whether the RB queue is empty or not, or whether all slices acquire required resources or not; if so, ending the slice resource scheduling; if not, executing i-i +1 and repeatedly executing the steps.
5. A computer storage medium having a computer program stored thereon, the computer program performing the steps of the method according to any one of claims 1 to 4.
CN202010064702.1A 2020-01-20 2020-01-20 Industrial field data multi-priority scheduling method based on 5G slice Active CN111278052B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010064702.1A CN111278052B (en) 2020-01-20 2020-01-20 Industrial field data multi-priority scheduling method based on 5G slice

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010064702.1A CN111278052B (en) 2020-01-20 2020-01-20 Industrial field data multi-priority scheduling method based on 5G slice

Publications (2)

Publication Number Publication Date
CN111278052A CN111278052A (en) 2020-06-12
CN111278052B true CN111278052B (en) 2021-09-14

Family

ID=71003422

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010064702.1A Active CN111278052B (en) 2020-01-20 2020-01-20 Industrial field data multi-priority scheduling method based on 5G slice

Country Status (1)

Country Link
CN (1) CN111278052B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111770581B (en) * 2020-06-30 2023-09-29 广东电网有限责任公司 Method and device for scheduling wireless resources of power communication network
CN111769988B (en) * 2020-06-30 2021-07-20 中国科学院计算技术研究所 Management method for sharing base station resources by multiple slices
CN112333824A (en) * 2020-10-27 2021-02-05 广东电网有限责任公司广州供电局 Uplink resource scheduling method and device
CN112492635B (en) * 2020-12-11 2023-06-02 中国联合网络通信集团有限公司 Determination method and device for scheduling priority
CN112888069B (en) * 2021-01-12 2022-10-11 温州科技职业学院 5G network slicing system serving city center environment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109743213A (en) * 2019-02-28 2019-05-10 腾讯科技（深圳）有限公司 A kind of network sliced sheet processing method and equipment and system
CN109819429A (en) * 2019-02-28 2019-05-28 重庆大学 Communication network restoration and reconstruction and dynamic networking method
CN110662261A (en) * 2018-06-30 2020-01-07 华为技术有限公司 Resource allocation method and device for network slices

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9201673B2 (en) * 2008-07-30 2015-12-01 Microsoft Technology Licensing, Llc Efficient detection and response to spin waits in multi-processor virtual machines
CN104507169B (en) * 2014-12-15 2017-12-22 东南大学 Reduce the three dimensional resource dynamic allocation method and device of system uplink propagation delay time
CN106793130A (en) * 2016-12-20 2017-05-31 南京邮电大学 A kind of uplink resource allocating method under H2H and M2M terminal coexistence scenes
US10855814B2 (en) * 2017-10-20 2020-12-01 Comcast Cable Communications, Llc Non-access stratum capability information

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110662261A (en) * 2018-06-30 2020-01-07 华为技术有限公司 Resource allocation method and device for network slices
CN109743213A (en) * 2019-02-28 2019-05-10 腾讯科技（深圳）有限公司 A kind of network sliced sheet processing method and equipment and system
CN109819429A (en) * 2019-02-28 2019-05-28 重庆大学 Communication network restoration and reconstruction and dynamic networking method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
面向5G网络切片的无线资源调度算法研究;丁焓;《中国优秀硕士学位论文全文数据库信息科技辑》;20190215;第二章-第四章 *

Also Published As

Publication number Publication date
CN111278052A (en) 2020-06-12

Similar Documents

Publication Publication Date Title
CN111278052B (en) Industrial field data multi-priority scheduling method based on 5G slice
US20220116799A1 (en) Method and device for o-ran-based performance optimization and configuration
KR101480598B1 (en) Techniques for initiating communication in a wireless network
CN102137496B (en) Method and device for joint dispatching of PUSCH (physical uplink shared channel) resources and PHICH (physical hybrid automatic repeat request indicator channel) resources
EP2830380B1 (en) Uplink transmission scheduling of non-Guaranteed Bit Rate bearers based on quality class indicator
CN106454920B (en) Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network
CN112637911B (en) Resource allocation method and system for eMB and urllc in coexistence in 5G system
Mamane et al. Scheduling algorithms for 5G networks and beyond: Classification and survey
KR20160040197A (en) Infrastructure equipment, wireless communications network and method
Jang et al. QoS-constrained resource allocation scheduling for LTE network
CN102404862B (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
Fu et al. A QoS-aware scheduling algorithm based on service type for LTE downlink
KR20170043611A (en) Service scheduling method and device
WO2020078456A1 (en) Service sending method and device and terminal
CN101827446B (en) Radio bearer scheduling method and device
CN102307393A (en) Resource distribution method and apparatus thereof
Libório et al. Network Slicing in IEEE 802.11 ah
CN112714081A (en) Data processing method and device
JP6204002B2 (en) Method and device for allocating time-frequency resources to a data packet for transmitting the data packet over a communication network, a computer program for performing such a method, and information storage for storing such a computer program Storage medium
CN107155220B (en) Resource scheduling method and device
CN112188624B (en) LTE downlink control channel resource allocation method
CN109803352B (en) Resource allocation method and device for fog wireless access network
CN112738901B (en) Uplink resource scheduling method and device
Chayon et al. Downlink Radio Resource Management Through CoMP and Carrier Aggregation for LTE-Advanced Network
Nashaat et al. A Multi-service Adaptive LTE Uplink Scheduler Based on Reservation for Machine-to-Machine Communication

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Tang Chaowei

Inventor after: Ruan Shuai

Inventor after: Wen Haotian

Inventor after: Feng Xinxin

Inventor after: Huang Baojin

Inventor after: Liu Hongbin

Inventor after: Tang Dong

Inventor before: Tang Chaowei

Inventor before: Ruan Shuai

Inventor before: Wen Haotian

Inventor before: Feng Xinxin

Inventor before: Huang Baojin

Inventor before: Liu Hongbin

Inventor before: Tang Dong

GR01 Patent grant
GR01 Patent grant