| A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks |
| |
| 作者姓名： | 黄巍 陈远 |
| |
| 作者单位： | China Electronics Technology Group Corp. No.10th Research Institute，China Electronics Technology Group Corp.，No.10th Research Institute，Chengdu 610036，China，Chengdu 610036，China |
| |
| 摘 要： | Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.
|
| 关 键 词： | 通信规则 信息编制 无线电网络 公正性 |
| 文章编号： | 1007-1172（2007）05-0655-05 |
| 修稿时间： | 2005-09-26 |
A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks |
| |
| HUANG Wei,CHEN Yuan.A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks[J].Journal of Shanghai Jiaotong university,2007,12(5):655-659,664. |
| |
| Authors: | HUANG Wei CHEN Yuan |
| |
| Institution: | China Electronics Technology Group Corp., No.10th Research Institute, Chengdu 610036, China |
| |
| Abstract: | Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks. |
| |
| Keywords: | packet scheduling wireless networks delay fairness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
