Weighted Round Robin Scheduling Algorithms in Mobile AD HOC Network

Abstract

A Mobile Ad-hoc Network (MANET) is a self-directed group of mobile handlers that communicate over relatively bandwidth constrained wireless channels. Many types of data could be transferred in MANET such as data, voice, and video streaming which is required sufficient packet routing and scheduling mechanisms. These scheduling algorithms have the responsibility to guarantee the different quality of service classes such as Unsolicited Grant Service (UGS), Real-Time Polling Service (RTPS), Non-Real-Time Polling Service (NRTPS), and Best Effort (BE). The demand for performance evaluation for different scheduling algorithms is imposed to this project, in which four famous MANET scheduling algorithms are selected and investigated. These algorithms are Round Robin (RR), Strict Priority (SP), Weighted Fair (WF), and Weighted Round Robin (WRR). The MANET scenario which is consisting of 50 random mobile nodes is built using network simulator QualNet 2.0.1. The results show the performance metrics of the network such as the throughput and the end-end delay as well as queuing metrics such as peak queue size, average queue length, the average time in queue, and total packets dropped. Regrading throughput, the SP algorithm has higher throughput than WF, RR, and WRR by 4.5%, 2.4%, and 1.42%, but WRR has outperformed others regarding the end-to-end delay. Moreover, WRR represents the best scheduling algorithm regarding both peak queue size since its higher than RP, WF, and WRR by 10.13%, 9.6%, and 5.32%, in order, and average output queue length.in contrast, WRR worst more time in queuing but it is the best in preventing the packets from dropping.