Abstract
The dynamic packet scheduling is a key component of LTE network to enhance the system throughput, as well as to satisfy the end users with the quality of service. However, the burst in user data traffic leads to user queue overflow at eNodeB due to resource starvation. Therefore, in this paper, queue monitoring and resource scheduling algorithms are proposed for LTE downlink transmission to reduce overflow of the user queue at eNodeB, and also to reduce the transmission time of the packet. On the other hand, this also enhances the system throughput and maintains fairness among the users. The dynamic packet scheduling mechanism first checks the queue level of user at eNodeB, channel condition of the user, resource allocation history and QoS of the packets, and then computes the priority metric of user by using these parameters. Then, using three proposed resources allocation mechanisms, the resource blocks are allocated to the users based on priority metric of user as well as queue status of user at eNodeB. The experimental results illustrate that the proposed algorithms enhance the system throughput compared to other existing schedulers. Further, it also improves packet delivery fraction and reduces the transmission time of the packets.
| Original language | English |
|---|---|
| Pages (from-to) | 1-18 |
| Number of pages | 18 |
| Journal | Wireless Networks |
| DOIs | |
| Publication status | Accepted/In press - 14-03-2018 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
}
Adaptive downlink packet scheduling in LTE networks based on queue monitoring. / Adesh, N. D.; Renuka, A.
In: Wireless Networks, 14.03.2018, p. 1-18.Research output: Contribution to journal › Article
TY - JOUR
T1 - Adaptive downlink packet scheduling in LTE networks based on queue monitoring
AU - Adesh, N. D.
AU - Renuka, A.
PY - 2018/3/14
Y1 - 2018/3/14
N2 - The dynamic packet scheduling is a key component of LTE network to enhance the system throughput, as well as to satisfy the end users with the quality of service. However, the burst in user data traffic leads to user queue overflow at eNodeB due to resource starvation. Therefore, in this paper, queue monitoring and resource scheduling algorithms are proposed for LTE downlink transmission to reduce overflow of the user queue at eNodeB, and also to reduce the transmission time of the packet. On the other hand, this also enhances the system throughput and maintains fairness among the users. The dynamic packet scheduling mechanism first checks the queue level of user at eNodeB, channel condition of the user, resource allocation history and QoS of the packets, and then computes the priority metric of user by using these parameters. Then, using three proposed resources allocation mechanisms, the resource blocks are allocated to the users based on priority metric of user as well as queue status of user at eNodeB. The experimental results illustrate that the proposed algorithms enhance the system throughput compared to other existing schedulers. Further, it also improves packet delivery fraction and reduces the transmission time of the packets.
AB - The dynamic packet scheduling is a key component of LTE network to enhance the system throughput, as well as to satisfy the end users with the quality of service. However, the burst in user data traffic leads to user queue overflow at eNodeB due to resource starvation. Therefore, in this paper, queue monitoring and resource scheduling algorithms are proposed for LTE downlink transmission to reduce overflow of the user queue at eNodeB, and also to reduce the transmission time of the packet. On the other hand, this also enhances the system throughput and maintains fairness among the users. The dynamic packet scheduling mechanism first checks the queue level of user at eNodeB, channel condition of the user, resource allocation history and QoS of the packets, and then computes the priority metric of user by using these parameters. Then, using three proposed resources allocation mechanisms, the resource blocks are allocated to the users based on priority metric of user as well as queue status of user at eNodeB. The experimental results illustrate that the proposed algorithms enhance the system throughput compared to other existing schedulers. Further, it also improves packet delivery fraction and reduces the transmission time of the packets.
UR - http://www.scopus.com/inward/record.url?scp=85043708511&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85043708511&partnerID=8YFLogxK
U2 - 10.1007/s11276-018-1708-1
DO - 10.1007/s11276-018-1708-1
M3 - Article
SP - 1
EP - 18
JO - Wireless Networks
T2 - Wireless Networks
JF - Wireless Networks
SN - 1022-0038
ER -