Low-complexity and QoS-awared scheduling algorithm for LTE
Based on the relaxation based linearization principle and the greedy algorithm,a scheduling algorithm named QPF was designed with low complexity and full QoS-awared.It is divided into two parts:time and frequency domain,which can allocate all resources at once according to two service types:GBR and...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.12.020/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539789282607104 |
|---|---|
| author | Fei-long ZHAO |
| author_facet | Fei-long ZHAO |
| author_sort | Fei-long ZHAO |
| collection | DOAJ |
| description | Based on the relaxation based linearization principle and the greedy algorithm,a scheduling algorithm named QPF was designed with low complexity and full QoS-awared.It is divided into two parts:time and frequency domain,which can allocate all resources at once according to two service types:GBR and Non-GBR service.By this way the computation complexity decreases from O(M<sup>N</sup>)to O(M lb N).The proposed algorithm has a balanced performance in si-mulation,which can get 10% improvement in some dimensions compared with the references with high load and provide a nice trade-off between the performance and complexity. |
| format | Article |
| id | doaj-art-18867929a5994cd8bae915c5940f7845 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-12-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-18867929a5994cd8bae915c5940f78452025-01-14T06:41:44ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-12-013417818459676685Low-complexity and QoS-awared scheduling algorithm for LTEFei-long ZHAOBased on the relaxation based linearization principle and the greedy algorithm,a scheduling algorithm named QPF was designed with low complexity and full QoS-awared.It is divided into two parts:time and frequency domain,which can allocate all resources at once according to two service types:GBR and Non-GBR service.By this way the computation complexity decreases from O(M<sup>N</sup>)to O(M lb N).The proposed algorithm has a balanced performance in si-mulation,which can get 10% improvement in some dimensions compared with the references with high load and provide a nice trade-off between the performance and complexity.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.12.020/LTEquality of servicescheduling algorithmsoptimi ion |
| spellingShingle | Fei-long ZHAO Low-complexity and QoS-awared scheduling algorithm for LTE Tongxin xuebao LTE quality of service scheduling algorithms optimi ion |
| title | Low-complexity and QoS-awared scheduling algorithm for LTE |
| title_full | Low-complexity and QoS-awared scheduling algorithm for LTE |
| title_fullStr | Low-complexity and QoS-awared scheduling algorithm for LTE |
| title_full_unstemmed | Low-complexity and QoS-awared scheduling algorithm for LTE |
| title_short | Low-complexity and QoS-awared scheduling algorithm for LTE |
| title_sort | low complexity and qos awared scheduling algorithm for lte |
| topic | LTE quality of service scheduling algorithms optimi ion |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436X.2013.12.020/ |
| work_keys_str_mv | AT feilongzhao lowcomplexityandqosawaredschedulingalgorithmforlte |