Performance comparison of scheduling algorithms in network mobility environment

Authors:
Yaning Wang;Linghang Fan;Dan He;Rahim Tafazolli
Affiliations:
Centre for Communication System Research, University of Surrey, Guildford, UK;Centre for Communication System Research, University of Surrey, Guildford, UK;Centre for Communication System Research, University of Surrey, Guildford, UK;Centre for Communication System Research, University of Surrey, Guildford, UK
Venue:
Computer Communications
Year:
2008

Citing 10
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Adapting packet fair queueing algorithms to wireless networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Fair scheduling in wireless packet networks

IEEE/ACM Transactions on Networking (TON)
Efficient packet scheduling using channel adaptive fair queueing in distributed mobile computing systems

Mobile Networks and Applications
Token bank fair queuing: a new scheduling algorithm for wireless multimedia services: Research Articles

International Journal of Communication Systems - Special Issue: QoS Support and Service Differentiation in Wireless Networks
A framework for dynamic SLA-based QoS control for UMTS

IEEE Wireless Communications
Fair scheduling with QoS support in wireless ad hoc networks

IEEE Transactions on Wireless Communications
Fair scheduling in mobile ad hoc networks with channel errors

IEEE Transactions on Wireless Communications
Network mobility in beyond-3G systems

IEEE Communications Magazine
Priority queue schedulers with approximate sorting in output-buffered switches

IEEE Journal on Selected Areas in Communications

A Delay Optimal Scheduling Policy for Real Time Services in WCDMA Systems

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.24

Visualization

Abstract

Network mobility (NEMO) supports a network moving as a whole, and this may cause the bandwidth on its wireless link varying with time and locations. The quick and frequent bandwidth fluctuation makes the resource reservation and admission control lack of scalability but with heavy overhead. A feasible solution for this problem is using scheduling algorithms to optimise the resource distribution based on the varying available bandwidth. In this paper, the performance comparison of several well-known priority queue (PQ) and fair queue (FQ) scheduling algorithms are given and their advantages and disadvantages in the NEMO environment are analysed. Moreover, a novel scheduling algorithm, named adaptive rotating priority queue (ARPQ), is proposed to avoid the problems of the existing algorithms. ARPQ operates with a ''priority first, fairness second'' policy and guarantees the delay bounds for the flows with higher priorities and maintain the reasonable throughput for the flows with lower priorities. The simulation results show that ARPQ outperforms all the existing scheduling algorithms in mobile networks, whose capacities are time-varying and location-dependent.