Mobility

Design and Analysis of an Adaptive Selfish Scheduling Algorithm Using AODV Protocol in Manet

Free registration required

Executive Summary

Due to dynamic nature of Mobile Ad-hoc NETwork (MANETs) which results in link breaks and repeatedly changing topology the aim of scheduling algorithm becomes more complex. In this paper, the authors present an adaptive selfish aware queue scheduler for a M/M/1 and M/M/n queuing mechanism to schedule the packets for selfish nodes in mobile ad-hoc networks using AODV as the routing protocol. The performance of this scheduler has been studied using ns-2 simulator and performance can be analyzed by using metrics such as packet delivery ratio, end to end delay, throughput, control overhead and total overhead. This scheduler provides overall improvement under different packet sizes.

  • Format: PDF
  • Size: 61.76 KB