A Cross-Layer Implementation of Differentiated Queueing Service (DQS) for Wireless Mesh Networks

Provisioning of more granular quality of services (QoS) for different applications in wireless mesh networks (WMNs) is a challenge issue for scheduling algorithms. Most traditional scheduling algorithms try to provide per-flow or per-class QoS almost without consideration of the end-to-end situation for applications such as path lengths. Actually, for the same type of applications, difficulties for a node to provide end-to-end QoS largely depend on path lengths. Differentiated queueing service (DQS) is a new scheduling algorithm providing more granular QoS in wired networks by taking into account the above issue. In this paper, DQS is improved such that it can be used in WMNs. Meanwhile we also discuss a cross layer implementation of DQS. The earliest deadline first (EDF) scheme is used in comparison with our proposed algorithm since EDF is similar to DQS to some extent. The simulation studies show that the performance of DQS is better than EDF in terms of average goodput and end-to-end delay.