M2M Uplink Priority Scheduling Algorithm Based on Dynamic Grouping

Based on the Delay Tolerance Remaining Time(DTRT),an uplink priority scheduling algorithm for dynamic grouping of traffic is proposed.A Resource Block(RB) allocation method with variable size is adopted to satisfy the adjacency constraints of RB,and a hybrid automatic polling mechanism is introduced...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Ji suan ji gong cheng Ročník 45; číslo 8; s. 129 - 134
Hlavní autor:	JIN Yeqi, XU Youyu, ZHENG Min, TAN Chong, WANG Hong
Médium:	Journal Article
Jazyk:	čínština angličtina
Vydáno:	Editorial Office of Computer Engineering 01.08.2019
Témata:	internet of things(iot)\|traffic dynamic grouping\|delay tolerance\|priority scheduling\|automatic polling mechanism
ISSN:	1000-3428
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Based on the Delay Tolerance Remaining Time(DTRT),an uplink priority scheduling algorithm for dynamic grouping of traffic is proposed.A Resource Block(RB) allocation method with variable size is adopted to satisfy the adjacency constraints of RB,and a hybrid automatic polling mechanism is introduced to solve the unfair scheduling problem of low priority traffic.Simulation results show that the system throughput of this algorithm is increased by 15% and 41% compared with PF algorithm and RR algorithm respectively,and it has better performance in terms of traffic delay and traffic differentiation.
ISSN:	1000-3428
DOI:	10.19678/j.issn.1000-3428.0051120