CN113411811A - Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling - Google Patents

Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling Download PDF

Info

Publication number
CN113411811A
CN113411811A CN202110583687.6A CN202110583687A CN113411811A CN 113411811 A CN113411811 A CN 113411811A CN 202110583687 A CN202110583687 A CN 202110583687A CN 113411811 A CN113411811 A CN 113411811A
Authority
CN
China
Prior art keywords
bandwidth
data
period
new user
service
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.)
Granted
Application number
CN202110583687.6A
Other languages
Chinese (zh)
Other versions
CN113411811B (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.)
Nanjing Power Supply Co of State Grid Jiangsu Electric Power Co Ltd
Original Assignee
Nanjing Power Supply Co of State Grid Jiangsu Electric Power Co Ltd
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 Nanjing Power Supply Co of State Grid Jiangsu Electric Power Co Ltd filed Critical Nanjing Power Supply Co of State Grid Jiangsu Electric Power Co Ltd
Priority to CN202110583687.6A priority Critical patent/CN113411811B/en
Publication of CN113411811A publication Critical patent/CN113411811A/en
Application granted granted Critical
Publication of CN113411811B publication Critical patent/CN113411811B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H04W28/20—Negotiating bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26—Resource reservation
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The bandwidth allocation method based on the new user discovery mechanism and the residual bandwidth dynamic scheduling comprises the following steps: 1. defining a large period and a small period; 2. reserving a part of guaranteed bandwidth at the beginning of each small period; 3. integrating eMBB and mMTC service data arriving in a large period; 4. performing ascending arrangement on the integrated service data according to the sending urgency; 5. sequentially putting the sequenced data blocks into the residual bandwidth of each small period, and sending the data blocks in each large period; 6. and judging whether a new user is accessed through a random access process, if so, judging whether a discovery window is triggered, and performing bandwidth allocation according to the triggering condition of the discovery window. The invention can support the coexistence of three services of uRLLC, eMBB and mMTC and well meet the differentiation requirements of different services; the discovery window may advantageously reduce the latency of new users. The algorithm principle of the invention is simple, the system load degree is low, and the processing time delay can be effectively reduced.

Description

Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a bandwidth allocation method based on a new user discovery mechanism and dynamic scheduling of remaining bandwidth.
Background
5G has gradually become a key technology for national strategic decision and development of various industries, and the technical characteristics of ultralow time delay, ultrahigh bandwidth and massive links form a new generation of mobile communication network. The 5G service covers the network service of the traditional network operator and also meets the communication requirements of various vertical industries. The smart grid service is a typical industry vertical representative. The traditional communication network cannot deal with the diversity of service types and the difference of service requirements of the smart grid, and a network slicing technology is taken as one of 5G subversive technologies, so that a physical network can be sliced and divided into a plurality of logic networks which are isolated from each other, designed according to needs and independently operated and maintained, and a highly flexible network service is used for customizing a slicing type for an electric power network in a personalized way.
The existing network configuration can not meet the requirements of various service equipment types and requirements of the power network, network architecture and function diversification and heterogeneity, and the occurrence of the 5G network slicing technology becomes a key point for solving the problems. The network slicing technology relies on a software defined network and a network function virtualization technology, so that a logic network is flexibly deployed, and network functions are managed in a centralized mode. Slicing the service of the corresponding type according to the 5G typical application scenario is the most common slicing way. Typical application scenarios of 5G are Enhanced Mobile Broadband (eMBB), Massive Machine Type Communication (mtc), Ultra-reliable and Low latency Communication (urrllc). The method has the main idea that the power network service is fused with the 5G application scene, and the parameter setting of the slices is carried out according to the service level requirements of the slices of the power network.
With the integration of technologies such as big data, internet of things, artificial intelligence and the like and power network services, the power network services are developing towards intellectualization. The smart grid services are divided into mobile application, control and information acquisition application scenes which respectively correspond to 5G eMBB, uRLLC and mMTC application scenes, and the difference requirements of different services on performance indexes such as network bandwidth, communication time delay and communication reliability determine that the 5G network slicing technology plays a key role in the smart grid. The mobile application service slice mainly bears tasks including intelligent inspection, electric power emergency communication and the like, an intelligent terminal in the tasks needs to carry out movable video return and realize the whole process high-definition visualization of electric power network emergency command and accident emergency repair field, and the requirements on network bandwidth are high and generally higher than 10Mbps level; the control service slice mainly bears service scenes for controlling the operation and maintenance core links of the power network, including accurate load control, distributed power supply, distribution automation and the like, the control service directly relates to the safety of the power grid, if errors occur, the operation of the power grid can be influenced, and the power system is in fault, so that the requirements on the reliability and the safety of communication are extremely high, the reliability requirement is 99.999%, meanwhile, the requirement on the communication delay is strict, and the control delay is within 10 ms; the information acquisition service slice mainly bears the services of power grid data acquisition, including power transmission and transformation state detection, power utilization information acquisition and the like, and the information acquisition service slice has large data volume and extremely high requirements on the coverage capability of a communication network, but has low requirements on communication reliability and communication delay.
The contention and allocated process of time-frequency domain resources among different slices is the key to ensure the personalized requirements of the service slices. The reasonable bandwidth allocation is beneficial to the resource isolation of different slices and ensures that mutual interference is avoided, which is also the core idea of the 5G access network slicing technology.
Disclosure of Invention
In order to solve the defects in the prior art, the invention aims to provide a bandwidth allocation method based on a new user discovery mechanism and residual bandwidth dynamic scheduling.
The invention adopts the following technical scheme:
the bandwidth allocation method based on the new user discovery mechanism and the residual bandwidth dynamic scheduling comprises the following steps:
step 1: defining a large period TTI and a small period mini-slot;
step 2: reserving a part of guaranteed bandwidth at the beginning of each small period;
and step 3: integrating eMBB service data and mMTC service data which arrive in a large period;
and 4, step 4: performing ascending arrangement on the eMBB and mMTC service data integrated in the step 3 according to the proposed sending urgency;
and 5: sequentially putting the data blocks sequenced in the step 4 into the residual bandwidth of each small period in the step 2, and sending the data blocks in each large period;
step 6: judging whether a new user is accessed through a random access process, and if the new user waits for access, judging whether a discovery window is triggered; if the discovery window is triggered, the allocation of the guaranteed bandwidth is carried out again; otherwise, ending the bandwidth allocation of the current period.
In step 1, one large-period TTI is defined as 1ms, and each large-period TTI includes 14 OFDM symbols;
taking every two OFDM symbols in each large period as a small period mini-slot, wherein each small period mini-slot corresponds to 1/7 large periods, namely 0.143 ms;
in step 2, the size of the reserved guaranteed bandwidth is estimated according to the actual arrival rate of the corresponding service in the previous small period and is represented by g, and the calculation method comprises the following steps:
g＝nn*tu
Figure BDA0003087215150000031
where nn is the number of arrivals of the data frame of the uRLLC in the last small period, tuThe size of the bandwidth occupied by the uRLLC service data frame in the last small period, zc is the frame length of the uRLLC service data, each byte needs to be multiplied by 8 when being converted into bits, and C is the data transmission rate of the access network.
In step 2, when the reserved guaranteed bandwidth of the current small period is not enough to transmit all urrllc service data in the mini-slot of the current small period, the data which is not enough to transmit enters a waiting queue, and is ready to be transmitted in the reserved guaranteed bandwidth of the next small period, and the data in the waiting queue has the highest priority.
In step 3, the integration method is to arrange all the mtc service data and the eMBB service data together according to the receiving order, that is, the mtc service data and the eMBB service data are out of order and are interleaved with each other according to the receiving order.
In step 3, setting the length of the mMTC service data frame to mzc, wherein the preferred value of mzc is 200 bytes; the eMB service data frame length is set to ezc, and the preferred value of ezc is 1500 bytes.
In step 4, the eMBB service data and the mtc service data are composed of data blocks, and the latency requirements of the eMBB service and the mtc service are respectively
Figure BDA0003087215150000032
And
Figure BDA0003087215150000033
the urgency of transmission of data blocks in eMBB service and mMTC service are used
Figure BDA0003087215150000034
And
Figure BDA0003087215150000035
represents:
Figure BDA0003087215150000036
Figure BDA0003087215150000037
Figure BDA0003087215150000038
and
Figure BDA0003087215150000039
the smaller the value is, the higher the urgency of the data block is, and the data block needs to be sent preferentially;
Figure BDA00030872151500000310
and
Figure BDA00030872151500000311
representing the time delay urgency of the current data block;
Figure BDA00030872151500000312
and
Figure BDA00030872151500000313
the smaller the size
Figure BDA00030872151500000314
And
Figure BDA00030872151500000315
the smaller the value, the priority transmission is required;
let the data block set J in each large cycle equal to<b1,b2,b2,…bn,…bN>，bnRepresenting the nth data block, b, of the set of data blocks JNRepresenting the Nth data block in the data block set J, wherein the data block set J shares N data, the number of the data blocks of the eMBB and mMTC services is represented as m1And m2I.e. m1For the load of eMBB service in J, m2Load of mMTC service in J; the transmission time of each data block is T ═<t1,t2,t3,…tn,…tN>，tnIndicates the transmission time of the nth data block in J, tNRepresenting the sending time of the Nth data block in the data block set;
t represents the time value at the current time.
In step 5, the method for calculating the remaining bandwidth of each small period includes:
Figure BDA0003087215150000041
wherein, B represents the residual broadband of each small week, and T represents the time length of the small period mini-slot.
In step 5, the data block queues arranged at the beginning of each large period are sequentially placed into the remaining bandwidth of the small period, and when one remaining bandwidth margin is not enough to place the last data block, the queues continue to be inserted into the next remaining bandwidth until the remaining bandwidth of seven small periods is used up, and then the data blocks are transmitted.
In step 6, when the arrival rate of the uRLLC service arriving in the mini-slot of the current small period is smaller than a set threshold D, a discovery window is triggered; the size of the discovery window is 200-250 mus;
once the discovery window is triggered, canceling the guaranteed bandwidth allocated to the uRLLC service data in the discovery window, and using the bandwidth of the original guaranteed bandwidth to send user data to be sent after a new user accesses a control plane;
after the discovery window is triggered, the guaranteed bandwidth of the urrllc service in the next small period mini-slot becomes larger, and the increment should be larger than the size of all the guaranteed bandwidths cancelled before.
The threshold D is 50%, i.e. when the uRLLC service data arrival rate is below 50%, a discovery window is triggered.
Compared with the prior art, the invention has the following beneficial effects:
1. the system can support coexistence of three services of uRLLC, eMBB and mMTC and well meet differentiation requirements of different services according to a network slicing technology of time-frequency domain resources of an access network. The introduction of the bandwidth is ensured, the time delay of the uRLLC service can be well reduced, meanwhile, the urgency is proposed, and the priority of each data block in the integrated service is well sequenced.
2. The access condition of the new user is discovered through the random discovery process, enough access bandwidth is provided for the new user to transmit data queued for sending when waiting for access, the time delay of the new user can be well reduced by introducing the discovery window, and short-time large bandwidth is provided for the new user.
3. The algorithm principle is simple, and for a resource control system, the system load degree is low, so that the processing time delay can be effectively reduced.
Drawings
Fig. 1 is a flowchart of a bandwidth allocation method based on a new user discovery mechanism and a residual bandwidth dynamic scheduling algorithm according to the present invention;
FIG. 2 is a schematic diagram of dividing a TTI large period and a mini-slot small period in a time domain according to the present invention;
FIG. 3 is a diagram illustrating ascending order of transmission data blocks based on urgency of transmission according to the present invention;
FIG. 4 is a schematic diagram of an overall dynamic bandwidth allocation scheme provided by the present invention;
fig. 5 is a simulation diagram of the occurrence probability distribution of the uRLLC service delay based on the guaranteed bandwidth provided by the present invention;
the reference numbers are listed below:
1-low urgency data blocks;
2-medium urgency data blocks;
3-high urgency data blocks;
Detailed Description
The present application is further described below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present application is not limited thereby.
The invention discloses a broadband allocation method based on new user discovery evaluation value and residual bandwidth dynamic scheduling, and FIG. 1 is a schematic diagram of the invention, and comprises the following steps:
step 1: defining a large period TTI and a small period mini-slot;
the traditional transmission time interval is 1ms, so that a traditional transmission time interval of 1ms is defined as a large-period TTI, and each large-period TTI comprises 14 OFDM symbols;
a micro time slot, namely mini-slot, is adopted as a small period; taking every two OFDM symbols in each large period as a mini-slot, wherein each mini-slot corresponds to 1/7 large periods, namely 0.143 ms;
as shown in fig. 2, a schematic diagram of a transmission time interval with a large period TTI and a small period mini-slot is provided.
Step 2: reserving a part of guaranteed bandwidth at the beginning of each small period for transmitting uRLLC service data arriving in the last mini-slot;
reserving a part of guaranteed bandwidth at the beginning time of each mini-slot, wherein the size of the reserved guaranteed bandwidth is estimated according to the actual arrival rate of the corresponding service in the last small period and is represented by g, so that the data of the uRLLC service reaching the last mini-slot is transmitted to meet the requirement of low time delay of the uRLLC service data;
the urrllc service data arrives at each mini-slot according to poisson distribution, the frame length of the urrllc service data is zc, and in this embodiment, the frame length of the urrllc service data is zcThe frame length in (2) is 100 bytes. And reserving a guaranteed bandwidth in each mini-slot for transmitting the uRLLC service data arriving in the last mini-slot. Setting the number of the arrival of the uRLLC service data frame in the last small period to be nn, and setting the bandwidth size occupied by the uRLLC service data frame in the last small period to be tuThen, g is calculated as:
g＝nn*tu
Figure BDA0003087215150000061
where zc is the data frame length of the uRLLC service, which is 100bytes in this embodiment, and each byte needs to be multiplied by 8 to be converted into a bit, and C is the data transmission rate of the access network, which is 1Gbps in this embodiment.
When the reserved guarantee bandwidth of the small period is not enough to transmit all uRLLC service data in the current mini-slot period, the data which are not enough to transmit enter a waiting queue to be ready to be transmitted in the reserved guarantee bandwidth of the next small period, and the data in the waiting queue have the highest priority.
As shown in fig. 3, the integrated data block queues are sorted according to the transmission urgency, and a data block with a larger number in the reference numeral indicates that the transmission urgency is higher, the data block needs to be referred to the front of the queue; a data block with a smaller number of reference symbols indicates a lower urgency to transmit and is placed at the end of the queue. The arrow indicates the extraction of the data block before the data block pointed to. This alignment process is repeated once before each large period, thereby synchronously updating the transmission urgency of each data block.
And step 3: integrating eMBB service data and mMTC service data which arrive in a large period;
because the requirements of the mMTC service and the eMB service on time delay are low, the guaranteed bandwidth does not need to be reserved, and the two services are selected to be integrated. The integration here means that all mtc service data and eMBB service data are arranged together according to an acceptance order, that is, the mtc service data and the eMBB service data are out of order and are interleaved with each other according to the acceptance order.
According to the service characteristics of mMTC and eMB, the length of an mMTC service data frame is set to mzc, and in the embodiment, a preferred value of mzc is 200 bytes; the eMBB traffic data frame length is set to ezc, ezc with a preferred value of 1500 bytes. The mMTC service data has large information quantity, so the arrival rate is high, but the transmitted information is some collected information, so the length of a single data block is not very large; the eMBB service has few service users and thus few transmission data, but since most of the transmission data is video and voice information, the size of a single data block is large.
And 4, step 4: performing ascending arrangement on the eMBB and mMTC service data integrated in the step 3 according to the proposed sending urgency;
in this step, the integrated data queues are sorted in ascending order by using the sending urgency as a parameter.
The eMBB service data and the mtc service data are composed of data blocks.
Let the data block set J in each large cycle equal to<b1,b2,b3,…bn,…bN>，bnRepresenting the nth data block, b, of the set of data blocks JNIndicates the Nth data block in the data block set J, and the data block set J has N data in total. The total data amount in the data block set cannot exceed the residual bandwidth B in a small period;
the loads of eMBB and mMTC services are counted in each large period, and the number of data blocks of the two services is represented as m1And m2I.e. m1For the load of eMBB service in J, m2The load of mMTC traffic in J. The transmission time of each data block is T ═<t1,t2,t3,…tn,…tN>，tnIndicates the transmission time, t, of the nth data block in the set of data blocks JNAnd the sending time of the Nth data block in the data block set is shown, the data block set has N data blocks in total, and the time value of the current time is shown by t. The time delay requirements of the eMBB service data block and the mMTC service data block are respectively
Figure BDA0003087215150000071
And
Figure BDA0003087215150000072
the urgency of transmission of data blocks in eMBB service and mMTC service are used
Figure BDA0003087215150000073
And
Figure BDA0003087215150000074
represents:
Figure BDA0003087215150000075
Figure BDA0003087215150000076
Figure BDA0003087215150000077
and
Figure BDA0003087215150000078
the smaller the value, the higher the urgency of the data block, and the transmission priority is required. As can be seen from the above equation, the transmission priority is affected by two factors, i.e.,
Figure BDA0003087215150000079
and
Figure BDA00030872151500000710
Figure BDA00030872151500000711
representing the urgency of the delay for the current data block,
Figure BDA00030872151500000712
and
Figure BDA00030872151500000713
the smaller the size
Figure BDA00030872151500000714
And
Figure BDA00030872151500000715
the smaller the value, the priority transmission is required; m is1/m2Representing the ratio of the load of the eMBB service to the load of the mMTC service, when the eMBB service loads m1Greater than mMTC traffic load m2When the temperature of the water is higher than the set temperature,
Figure BDA00030872151500000716
when the mMTC service data is larger, the sending priority of the mMTC service data is reduced, otherwise, when the eMBB service load m is larger1Less than mMTC traffic load m2In time, the priority of sending the mtc traffic data increases.
And 5: the data blocks which are sequenced in the step 4 are sequentially placed into the residual bandwidth of each small period and are sent in each large period;
as shown in fig. 4, a schematic diagram of the overall dynamic bandwidth allocation scheme is given.
The remaining bandwidth for each small period is calculated. The calculation formula is expressed as follows:
Figure BDA00030872151500000717
wherein, B represents the residual bandwidth of each small week, T represents a small period, namely the duration of mini-slot, the value of which is 0.143ms, C represents the data transmission rate of the access network, the value of which is 1Gbps, and one byte is equal to 8 bits.
The overall transmission period of the data block set is one large period, i.e., 1 ms. The total allocable residual bandwidth is then the sum of the residual bandwidths in the seven mini-slots.
The data block queues arranged at the beginning of each large period are sequentially placed into the black residual bandwidth in fig. 4, and when one residual bandwidth margin is not enough to place the last data block, the queues continue to be inserted into the next residual bandwidth until seven residual bandwidths are used up, and then the data blocks are transmitted.
Step 6: judging whether a new user is accessed through a random access process, and if the new user waits for access, judging whether a discovery window is triggered; if the discovery window is triggered, the allocation of the guaranteed bandwidth is carried out again; otherwise, ending the bandwidth allocation of the current period.
And judging whether to distribute a discovery window for the new access user according to the discovery window triggering condition. And triggering a discovery window when the arrival rate of the uRLLC service arriving in the mini-slot of the current small period is smaller than a set threshold D. The window size is found to be 200-250 mus; in this embodiment, the threshold D is 50%, i.e. when the uRLLC service data arrival rate is below 50%, the discovery window is triggered.
Once the discovery window is triggered, the guaranteed bandwidth allocated to the uRLLC service in the discovery window is cancelled, and the user data to be sent after the new user is accessed in the control plane is sent by using the broadband of the original guaranteed bandwidth, so that the requirements of time delay and short-time bandwidth of the new user are met.
After the discovery window is triggered, the guaranteed bandwidth of the uRLLC service in the next mini-slot is increased, and the increase quantity is larger than the size of all the guaranteed bandwidths cancelled before, so as to make up the guaranteed bandwidth of the uRLLC service cancelled due to the triggering of the discovery window;
if the discovery window is not triggered, the current cycle bandwidth allocation ends.
In order to visually show the effect of the proposed bandwidth allocation scheme, Matlab simulation is performed on the time delay occurrence probability distribution of the uRLLC service. As shown in fig. 5, the urrllc service follows a poisson-distributed arrival pattern, and has a guaranteed bandwidth at each mini-slot to transmit the service data that arrives in the last period.
Because the service follows Poisson distribution, the delay distribution of the service is approximate to a straight line. But there is a possibility that the total amount of traffic arriving exceeds the guaranteed bandwidth handling rate in one mini-slot, and a part of the data block is not sent in the first mini-slot but is kept in the data node's buffer queue. However, the data of this part will have the highest priority in the guaranteed bandwidth of the next mini-slot, and it can be known from the simulation result fig. 5 that most of the data is sent in the first mini-slot, but some of the data is sent in the next small period, but through the simulation result, the time delay of all data blocks is controlled within 0.25ms, which is far less than the time delay requirement of the smart grid low-delay slice of 10 ms.
When the data is transmitted within the time delay requirement range, the communication reliability also meets the requirement of 99.999 percent.
The present applicant has described and illustrated embodiments of the present invention in detail with reference to the accompanying drawings, but it should be understood by those skilled in the art that the above embodiments are merely preferred embodiments of the present invention, and the detailed description is only for the purpose of helping the reader to better understand the spirit of the present invention, and not for limiting the scope of the present invention, and on the contrary, any improvement or modification made based on the spirit of the present invention should fall within the scope of the present invention.

Claims (11)

1. A bandwidth allocation method based on a new user discovery mechanism and residual bandwidth dynamic scheduling is characterized by comprising the following steps:
step 1: defining a large period TTI and a small period mini-slot;
step 2: reserving a part of guaranteed bandwidth at the beginning of each small period;
and step 3: integrating eMBB service data and mMTC service data which arrive in a large period;
and 4, step 4: performing ascending arrangement on the eMBB and mMTC service data integrated in the step 3 according to the proposed sending urgency;
and 5: sequentially putting the data blocks sequenced in the step 4 into the residual bandwidth of each small period in the step 2, and sending the data blocks in each large period;
step 6: judging whether a new user is accessed through a random access process, and if the new user waits for access, judging whether a discovery window is triggered; if the discovery window is triggered, the allocation of the guaranteed bandwidth is carried out again; otherwise, ending the bandwidth allocation of the current period.
2. The method of claim 1, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in step 1, the one large-period TTI is defined as 1ms, and each large-period TTI includes 14 OFDM symbols;
taking every two OFDM symbols in each large period as a small period mini-slot, each small period mini-slot corresponds to 1/7 large periods, namely 0.143 ms.
3. The method of claim 2, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in step 2, the reserved guaranteed bandwidth is estimated according to the actual arrival rate of the corresponding service in the previous small period and is represented by g, and the calculation method includes:
g＝nn*tu
Figure FDA0003087215140000011
where nn is the number of arrivals of the data frame of the uRLLC in the last small period, tuThe size of the bandwidth occupied by the uRLLC service data frame in the last small period, zc is the frame length of the uRLLC service data, each byte needs to be multiplied by 8 when being converted into bits, and C is the data transmission rate of the access network.
4. The method of claim 1 or 2, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in the step 2, when the reserved guaranteed bandwidth of the current small period is not enough to transmit all urrllc service data in the mini-slot of the current small period, the data which is not enough to transmit enters a waiting queue, and is ready to be transmitted in the reserved guaranteed bandwidth of the next small period, and the data in the waiting queue has the highest priority.
5. The method of claim 4, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in the step 3, the integration method is to arrange all the mtc service data and the eMBB service data together according to an acceptance order, that is, the mtc service data and the eMBB service data are out of order and are interleaved with each other according to the acceptance order.
6. The method of claim 5, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in the step 3, the length of the mtc service data frame is set to mzc, mzc with a preferred value of 200 bytes; the eMB service data frame length is set to ezc, and the preferred value of ezc is 1500 bytes.
7. The method of claim 1 or 6, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in step 4, the eMBB service data and the mtc service data are composed of data blocks, and the time delay requirements of the eMBB service and the mtc service are respectively
Figure FDA0003087215140000021
And
Figure FDA0003087215140000022
the urgency of transmission of data blocks in eMBB service and mMTC service are used
Figure FDA0003087215140000023
And
Figure FDA0003087215140000024
represents:
Figure FDA0003087215140000025
Figure FDA0003087215140000026
Figure FDA0003087215140000027
and
Figure FDA0003087215140000028
the smaller the value is, the higher the urgency of the data block is, and the data block needs to be sent preferentially;
Figure FDA0003087215140000029
and
Figure FDA00030872151400000210
representing the time delay urgency of the current data block;
Figure FDA00030872151400000211
and
Figure FDA00030872151400000212
the smaller the size
Figure FDA00030872151400000213
And
Figure FDA00030872151400000214
the smaller the value, the priority transmission is required;
let the data block set J in each large cycle be < b1,b2,b3,…bn,…bN＞，bnRepresenting the nth data block, b, of the set of data blocks JNRepresenting the Nth data block in the data block set J, wherein the data block set J has N data in total, eThe number of data blocks of MBB and mMTC services is represented as m1And m2I.e. m1For the load of eMBB service in J, m2Load of mMTC service in J; the transmission time of each data block is T ═<t1,t2,t3,…tn,…tN＞，tnIndicates the transmission time of the nth data block in J, tNRepresenting the sending time of the Nth data block in the data block set;
t represents the time value at the current time.
8. The method of claim 3, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in step 5, the method for calculating the remaining bandwidth of each small period includes:
Figure FDA0003087215140000031
wherein, B represents the residual broadband of each small week, and T represents the time length of the small period mini-slot.
9. The method of claim 1 or 8, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in step 5, the data block queues arranged at the beginning of each large period are sequentially placed into the remaining bandwidth of the small period, and when one remaining bandwidth margin is not enough to place the last data block, the queues continue to be inserted into the next remaining bandwidth until the remaining bandwidth of seven small periods is used up, and then the data blocks are transmitted.
10. The method of claim 9, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
in the step 6, when the arrival rate of the uRLLC service data arriving in the mini-slot of the current small period is smaller than a set threshold D, a discovery window is triggered; the size of the discovery window is 200-250 mus;
once the discovery window is triggered, canceling the guaranteed bandwidth allocated to the uRLLC service data in the discovery window, and using the bandwidth of the original guaranteed bandwidth to send user data to be sent after a new user accesses a control plane;
after the discovery window is triggered, the guaranteed bandwidth of the uRLLC service data in the next small period mini-slot is increased, and the increase amount is larger than the size of all the guaranteed bandwidths cancelled before.
11. The method of claim 10, wherein the bandwidth allocation is based on a new user discovery mechanism and a dynamic scheduling of remaining bandwidth, and wherein:
the threshold D is 50%, i.e. when the uRLLC service data arrival rate is below 50%, a discovery window is triggered.
CN202110583687.6A 2021-05-27 2021-05-27 Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling Active CN113411811B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110583687.6A CN113411811B (en) 2021-05-27 2021-05-27 Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110583687.6A CN113411811B (en) 2021-05-27 2021-05-27 Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling

Publications (2)

Publication Number Publication Date
CN113411811A true CN113411811A (en) 2021-09-17
CN113411811B CN113411811B (en) 2022-11-04

Family

ID=77674622

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110583687.6A Active CN113411811B (en) 2021-05-27 2021-05-27 Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling

Country Status (1)

Country Link
CN (1) CN113411811B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114500514A (en) * 2022-02-14 2022-05-13 京东科技信息技术有限公司 File transmission method and device, electronic equipment and computer readable storage medium
CN115175024A (en) * 2022-06-01 2022-10-11 苏州大学 Passive optical network bandwidth resource scheduling method and system for mobile transmission

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007121674A1 (en) * 2006-04-21 2007-11-01 Huawei Technologies Co., Ltd. A scheduling method and apparatus in communication systems
CN110521146A (en) * 2017-07-28 2019-11-29 Lg电子株式会社 Receive the method and its equipment of synchronization signal block
CN112087782A (en) * 2020-09-11 2020-12-15 杭州电子科技大学 Bandwidth allocation method for coexistence of EMBB and URLLC in X-Haul network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007121674A1 (en) * 2006-04-21 2007-11-01 Huawei Technologies Co., Ltd. A scheduling method and apparatus in communication systems
CN110521146A (en) * 2017-07-28 2019-11-29 Lg电子株式会社 Receive the method and its equipment of synchronization signal block
CN112087782A (en) * 2020-09-11 2020-12-15 杭州电子科技大学 Bandwidth allocation method for coexistence of EMBB and URLLC in X-Haul network

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114500514A (en) * 2022-02-14 2022-05-13 京东科技信息技术有限公司 File transmission method and device, electronic equipment and computer readable storage medium
CN114500514B (en) * 2022-02-14 2023-12-12 京东科技信息技术有限公司 File transmission method and device for cloud storage, electronic equipment and storage medium
CN115175024A (en) * 2022-06-01 2022-10-11 苏州大学 Passive optical network bandwidth resource scheduling method and system for mobile transmission
CN115175024B (en) * 2022-06-01 2023-07-25 苏州大学 Method and system for scheduling bandwidth resources of passive optical network for mobile transmission

Also Published As

Publication number Publication date
CN113411811B (en) 2022-11-04

Similar Documents

Publication Publication Date Title
CN113411811B (en) Bandwidth allocation method based on new user discovery mechanism and residual bandwidth dynamic scheduling
CN110248417B (en) Resource allocation method and system for communication service in power Internet of things
CN106982467B (en) Access congestion control method based on dynamic allocation of PRACH resources
CN103493568A (en) Method of scheduling and admission control for guaranteed bit rate and/or maximum bit rate services
CN111181873B (en) Data transmission method, data transmission device, storage medium and electronic equipment
CN109618375B (en) UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability
CN113207048B (en) Neural network prediction-based uplink bandwidth allocation method in 50G-PON (Passive optical network)
Sidhu et al. Packet scheduling of GOOSE messages in IEC 61850 based substation intelligent electronic devices (IEDs)
CN109699089A (en) A kind of channel access method and device
CN108271213A (en) Communication control method, unauthorized transmission method and device
Xu et al. Performance analysis of cognitive radio networks with burst dynamics
CN106656711B (en) A kind of predefined method of token bus time slot
CN109450817B (en) Mixed scheduling method for time-triggered Ethernet multi-service message transmission
CN114786276A (en) Service terminal access method, device, electronic equipment and storage medium
CN111800823A (en) Priority-based power wireless terminal data transmission method and device
Gao et al. Capacity limits for a cognitive radio network under fading channel
Cena et al. Evaluation of real-time communication performance in QoS-enabled infrastructure WLANs
Lea et al. A channel access protocol for integrated voice/data applications
CN111867105B (en) Action distribution method and device of backscattering terminal and electronic equipment
CN115883460B (en) Method and system for suppressing overcurrent abnormality of substation communication network based on 802.1Qci
CN104994587B (en) A kind of electric power wireless private network method for channel allocation of security isolation
CN108540403A (en) A kind of transformer station process layer network packet stream dispatching method and device
CN109462554B (en) Time slot scheduling method based on queue state
Suethanuwong et al. Searching of best-effort messages in TTEthemet switches during the timely blocking intervals
CN102202374A (en) Method and system for controlling access of machine-type communication (MTC) equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant