Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Real-time low-packet-loss service scheduling method in TD-LTE

A technology of real-time business and scheduling method, applied in the direction of digital transmission system, electrical components, error prevention, etc., can solve the problems of poor performance of DPS algorithm packet loss rate and low system throughput

Active Publication Date: 2014-09-24
HARBIN INST OF TECH
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the DPS algorithm can provide better packet loss rate performance when the number of users is small, as the number of users continues to increase, the packet loss rate performance of the DPS algorithm will deteriorate sharply, and the throughput of the system is also very low

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Real-time low-packet-loss service scheduling method in TD-LTE
  • Real-time low-packet-loss service scheduling method in TD-LTE
  • Real-time low-packet-loss service scheduling method in TD-LTE

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0023] Specific embodiment one: a kind of TD-LTE middle and low packet loss rate real-time service scheduling method of the present embodiment, specifically prepare according to the following steps:

[0024] Step 1, initialization, calculate the theoretical data rate of each user on each resource block according to the input CQI matrix, and the average spectral efficiency of each user on the entire bandwidth;

[0025] Step 2, calculate the priority value of each user in the current time slot according to the MDPS algorithm priority calculation formula;

[0026] Step 3. From the service list, find the user with the highest priority, and then calculate the target bit rate TBR that the user with the highest priority needs to satisfy;

[0027] Step 4. Find the resource block with the best channel condition from the unallocated resource blocks, allocate it to the user with the highest priority, and then update the resource block allocation matrix;

[0028] Step 5. Determine whethe...

specific Embodiment approach 2

[0037] Specific embodiment 2: The difference between this embodiment and specific embodiment 1 is that in the step 1, the theoretical data rate of each user k on each resource block i is calculated The method is:

[0038] r k i ( t ) = ( nsymbols - 3 ) × nsubcarriers × Q m × nbits k i ( t ) / 1024

[0039] In the formula, nsymbols is the number of OFDM symbols on a subframe, nsubcarriers is the number of subcarriers on a resource block, Q m It is the number of bits that a symbol can carry, which is determined by the modulation method. is the coding rate obtained by mapping the MCS and SINR mapping table ...

specific Embodiment approach 3

[0042] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is: the calculation method of each user priority in the MDPS algorithm proposed in the said step two is as follows:

[0043] K = arg min ( τ k + 1 - W k a + E ( Γ k ) )

[0044] In the formula, E(Г k ) is the average spectral efficiency of user k on all PRBs, τ k is the delay threshold of real-time service user k, W k (t) is the head-of-queue delay (HOL) of real-time service user k, a is a constant, and t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a real-time low-packet-loss service scheduling method in TD-LTE to solve the problems that in an existing TD-LTE system, the user packet loss is high, the throughput is low, the user delay situation, channel state and scheduling algorithm complexity is high, and the computing amount is large. The method comprises the steps that firstly, initializing is carried out; secondly, priority values of all users are worked out according to the MDPS algorithm; thirdly, the user with the highest priority is found out, and the met target bit rate is calculated; fourthly, a resource block with the best channel condition is found out and allocated to the user with the highest priority, and updating is carried out; fifthly, whether the data rate of the user with the highest priority is larger than or equal to TBR or not is judged; sixthly, the steps from the third to the fifth are repeatedly executed until all resource blocks are allocated to obtain a final resource block allocation matrix. The real-time low-packet-loss service scheduling method is applied to the mobile communication field.

Description

technical field [0001] The invention relates to a real-time service scheduling method with low packet loss rate in TD-LTE (Time Division Duplex Long Term Evolution). Background technique [0002] At present, the mobile communication network has begun to enter the gate of the fourth generation of mobile communication - LTE-A (Long Time Evolution-Advanced). Real-time services such as real-time voice and real-time video based on the mobile network have developed rapidly and become the focus of research in the field of communication. A good real-time business scheduling algorithm can effectively meet the business QoS (Quality of Service) requirements, and plays a key role in determining the performance of the system. [0003] Real-time transmission in the wireless network requires very low transmission delay, delay jitter, packet loss rate, and sufficient bandwidth to ensure the QoS requirements of the business. The early packet resource scheduling algorithms, such as Proportio...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W72/12H04L1/00
Inventor 吴宣利韩杏玲付楠楠吴玮赵婉君马哲明李想
Owner HARBIN INST OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com