No abstract

No abstract

No abstract

No abstract

Abstract. This paper proposes and analyzes bandwidth reclaim scheme for IEEE 802.11 WLAN, which may suffer from severe bandwidth waste resulting from not only the variation of transmission rate and message length but also the overallocation to the real-time traffic in compensating for the delay due to the intervention of non-real-time messages. Built on top of the weighted round robin scheduling policy, we address that the polling order rearrangement according to the degree of overallocation can enhance reclaimability of unused network time and that the rearranegable slot has its message pending at the rearranging time. The simulation results show that the proposed scheme is able to reclaim up to 52.3 % of bandwidth waste when the number of streams is 2 and that it also provides stable throughput for utilization of 0.5 through 0.8.