In the 802.11b networks, the guarantee of an equal long-run channel access probability causes performance anomaly in a multi-rate wireless cell. Much interest has been involved in this issue and many effective mechani...In the 802.11b networks, the guarantee of an equal long-run channel access probability causes performance anomaly in a multi-rate wireless cell. Much interest has been involved in this issue and many effective mechanisms have been proposed. The usual MAC layer solutions include the initial contention window adaptation, the maximum transfer unit size adaptation and the packet bursting. In this paper, we propose a novel approach which introduces a new parameter called the transmission prob- ability pt to the legacy protocol. By adjusting pt according to the transmission rate, the proposed scheme can solve the performance anomaly problem cleanly. Throughput analysis and performance evaluation show that our scheme achieves significant im- provement in the aggregate throughput and the fairness.展开更多
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 requ...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.展开更多
基金Project supported by the National Mid- and Small-Scale EnterpriseTechnical Innovation Fund of China (No. 06C26225101730)the Sichuan Provincial Key Science and Technology Program, China (No. 05GG021-003-2)
文摘In the 802.11b networks, the guarantee of an equal long-run channel access probability causes performance anomaly in a multi-rate wireless cell. Much interest has been involved in this issue and many effective mechanisms have been proposed. The usual MAC layer solutions include the initial contention window adaptation, the maximum transfer unit size adaptation and the packet bursting. In this paper, we propose a novel approach which introduces a new parameter called the transmission prob- ability pt to the legacy protocol. By adjusting pt according to the transmission rate, the proposed scheme can solve the performance anomaly problem cleanly. Throughput analysis and performance evaluation show that our scheme achieves significant im- provement in the aggregate throughput and the fairness.
文摘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.
