A distributed fair scheduling scheme in wireless LAN

This paper proposes an algorithm named WLFVC, which is a fully distributed wireless packet scheduling algorithm based on LFVC (Leap Forward Virtual Clock), to provide streams with fairness, especially in the short time scale. This algorithm is able to allocate bandwidth to streams proportional to th...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 18; no. 5; pp. 615 - 625
Main Authors Wu, HaiTao, Lin, Yu, Cheng, ShiDuan
Format Journal Article
LanguageEnglish
Published Beijing Springer Nature B.V 01.09.2003
National Key Lab of Switching Technology and Telecommunication Networks Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China
Subjects
Algorithms
Degradation
Delay
Jitter
Local area networks
Performance degradation
Scheduling
Streams
Studies
Wireless communication
QoS
DCF
WLFVC
Online AccessGet full text

Cover

More Information
Summary:This paper proposes an algorithm named WLFVC, which is a fully distributed wireless packet scheduling algorithm based on LFVC (Leap Forward Virtual Clock), to provide streams with fairness, especially in the short time scale. This algorithm is able to allocate bandwidth to streams proportional to their weights. Thus, better delay and jitter performance can be achieved. Since collisions and wireless link error degrade the performance of MAC protocols in the WLAN environment, WLFVC also takes them into consideration. Finally, this algorithm works in a fully distributed way and it can coexist with other stations that only support DCF (Distributed Coordination Function).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02947121