Scheduling different types of packets such as real-time and non-real time data packets in wireless links isnecessary to reduce energy consumption of the wireless device. Most of the existing packet schedulingmechanism uses opportunistic transmission scheduling, in which communication is postponed upto anacceptable time deadline until the best expected channel conditions to transmit are found. This algorithmincurs a large processing overhead and more energy consumption. In this paper we propose a DynamicMultilevel Queue Scheduling algorithm. In the proposed scheme, the ready queue is partitioned into threelevels of priority queues. Real-time packets are placed into the highest priority queue and non-real timedata packets are placed into two other queues. We evaluate the performance of the proposed DynamicMultilevel Queue Scheduling scheme through simulations for real-time and non-real time data. Simulationresults illustrate that the Multilevel Priority packet scheduling scheme overcomes the conventional methodsinterms of average data waiting time and end-to-end delay.
展开▼
