Comparative Analysis of Scheduling Algorithms in Ad Hoc Mobile Networking

Mobile Ad Hoc Networks (MANET) consists of mobile nodes interconnected by multihop communication paths can experience higher packets loss rate and lower bandwidth compare with wired network because of node mobility and characteristic of wireless channel. Multicast could prove to be an efficient way of providing necessary services for many kinds of applications. In this paper, we consider the performances of different scheduling algorithms in MANET which have both multicast and unicast applications. Here we discuss four scheduling models; that are one-queue model, priority-queue model, dynamic priority-queue model and adaptive queue-model. In these algorithms, we compare the difference between multicast and unicast application performance. In addition we analyze the impact of quality of service (QoS) parameters on hop-by-hop and end-to-end performance. These show that the scheduling algorithms, which we analyzed, have much better hop-by-hop and end-to-end traffic performance than simple scheduling.