Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Evaluation of packet scheduling algorithms in mobile ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing and scheduling in multihop wireless networks with time-varying channels
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Comparative Analysis of Scheduling Algorithms in Ad Hoc Mobile Networking
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Hi-index | 0.00 |
Ad hoc networks are composed by independent mobile stations that,besides acting as traffic sources and sinks, cooperate on packet forwarding tasks, acting both as endpoints and routers. The purpose of this work is to analyze the impact of different packet scheduling policies on the system's stability and performance.We compare the Longest-In-System (LIS) and First-In-First-Out (FIFO) scheduling policies on both static and dynamic ad hoc network environments at different degrees of congestion. Experimental results for static scenariosshow that the LIS policy is able to normalize delay valuesand achieve improved system stability. We also show that, for mobile environments, scheduling policies have little overall impact, and we explain why this is also expected to occur for other scheduling policies.