An overview of scheduling algorithms in mobile ad-hoc networks

Scheduling algorithms are essential in guaranteeing Quality of Service (QoS) provisioning. Through QoS guarantee, a network application could obtain services which fulfil its specific requirements such as less delay, reduction in loss rate and higher throughput. However, due to dynamic nature of mobile ad-hoc networks (MANETs) which results to frequently changing topology and link breaks, the design of scheduling algorithms becomes more difficult. This paper presents a survey of scheduling techniques specifically developed for ad-hoc wireless networks with regards to their strengths and shortcomings. This is followed by a summary of their simulation parameters.