| Hi-index | 0.00 |
In this work, we present, CaSMA, a packet scheduling mechanism for mobile ad hoc networks (MANETs) that takes into account both the congestion state and the end-to-end path duration. We show that CaSMA approximates an ideal scheduling mechanism in terms of maximizing the goodput and sharing the throughput (losses) fairly among the contending flows. Further, the simulation results show that both average delay for CBR flows and throughput for TCP can be improved substantially compared to FIFO.