4.4 Article

Channel condition self-clocked packet scheduling scheme for wireless networks

Publisher

SPRINGEROPEN
DOI: 10.1186/1687-1499-2013-131

Keywords

Channel condition self-clocked packet scheduling; Wireless scheduler; Fair queue

Funding

  1. National Science Council Taiwan [NSC 101-2221-E-008-015-MY3]

Ask authors/readers for more resources

Since mobile hosts suffer from burst and location-dependent channel errors in wireless networks, packet fair queueing algorithm in wireline networks cannot be applied directly to wireless networks. Generally, a fair scheduler in a wireless network retains the virtual time of flow when the flow encounters channel errors. This results to the flow having higher priority when it exits from errors, and the system can compensate the lost service for the flow. This causes the lagging flows to capture the shared channel and affects the queueing delay of flows perceiving a clean channel. In this paper, we present a channel condition self-clocked packet scheduling scheme. This algorithm can address the problem and achieve the following goals: (1) steady delay and jitter for flows perceiving an error-free environment, (2) delay and throughput guarantees in an error-free environment, (3) short-term fairness among flows perceiving an error-free environment, and (4) long-term fairness for error system. Our algorithm is based on start-time fair queueing, and the virtual time of flows is reset to contend for forwarding its packet the next time when errors happen for the flow.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available