2017 25th Telecommunication Forum (TELFOR) 2017
DOI: 10.1109/telfor.2017.8249288
|View full text |Cite
|
Sign up to set email alerts
|

A new channel-aware LTE-A uplink resource allocation scheduling algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
2
0
3

Year Published

2018
2018
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 8 publications
0
2
0
3
Order By: Relevance
“…No domínio do tempo, um RB possui duração de 0,5ms (um slot). A eNodeB é responsável pela alocação de RB aos UE, obedecendo as regras de escalonamento [9].…”
Section: Redes Lte-aunclassified
See 2 more Smart Citations
“…No domínio do tempo, um RB possui duração de 0,5ms (um slot). A eNodeB é responsável pela alocação de RB aos UE, obedecendo as regras de escalonamento [9].…”
Section: Redes Lte-aunclassified
“…Um dos fatores que interferem na alocação de recursos para os UE é a qualidade do link entre UE e eNodeB, definindo características das transmissões, como taxa de dados alcançável, formato de transmissão, dentre outros [10]. Encontrar alocações ideais de recursos é uma tarefa complexa, portanto, escalonadores de baixa complexidade são preferidos, uma vez que essa tarefa deve ser realizada a cada 1ms [9]. E este intervalo de tempo é definido como Intervalo de Tempo de Transmissão (TTI, do inglês Transmission Time Interval) [6].…”
Section: Redes Lte-aunclassified
See 1 more Smart Citation
“…Resource allocation scheduling algorithms for LTE UL have been discussed by many scientists [2,[4][5][6][7][8][9][10][11]. Due to the specific constraints of singularity, contiguity, and transmit power, the resource allocation process is more complicated in the uplink as compared to the downlink.…”
Section: Related Workmentioning
confidence: 99%
“…Besides these major resource allocation algorithms, there a number of other suggestions which try to balance the optimization criteria between high fairness (low throughput, low complexity) and high throughput (low fairness, complexity). The authors in [4], propose a new Mobility Aware scheduling algorithm that takes advantage of the simplicity of RR and B-CQI algorithms and aims to reduce their disadvantages taking into consideration the mobility of the users. The performance of the proposed algorithm is compared to RR and B-CQI in terms of fairness, throughput and block error rate (BLER).…”
Section: Related Workmentioning
confidence: 99%