A software approach to Channel-state dependent scheduling for wireless LANs

Hiroto Aida, Yoshito Tobe, Masato Saito, Hideyuki Tokuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper proposes a new practical packet scheduling scheme for wireless LANs called SoCPS and also explores extensively the effectiveness of wireless packet scheduling under a variety of conditions over an actual wireless LAN. One well-known aspect in packet scheduling at the base station is consideration of channel state dependency. In conventional studies, the channel state is expressed in microscopic two states in the Markovian sense. To eliminate a large overhead associated with acquiring such a fine-grain channel state and to establish a software-based enhancement, we introduce the notion of Strength of Connection (SoC) which can be expressed as the long-term strength of the connectivity between the base station and an end host. We examine schemes for identifying the channel state and examine the applicability to packet scheduling. We also design a packet scheduling scheme based on SoC called SoCPS. Finally, we investigate the performance under various conditions of traffic and wireless channel states. We have designed and implemented SoCPS on FreeBSD computers. Our evaluation results obtained with up to eight wireless-LAN nodes have determined the applicability of SoCPS and limitation in wireless packet scheduling for wireless LANs. In particular, while FIFO is sufficient in many cases where TCP traffic is dominant, scheduling with SoC consideration is effective for real-time UDP traffic. Copyright ACM 2001.

Original languageEnglish
Title of host publicationProceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001
PublisherAssociation for Computing Machinery, Inc
Pages33-42
Number of pages10
ISBN (Electronic)1581133847, 9781581133844
DOIs
Publication statusPublished - 2001 Jul 21
Event4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001 - Rome, Italy
Duration: 2001 Jul 21 → …

Other

Other4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001
CountryItaly
CityRome
Period01/7/21 → …

Fingerprint

Local area networks
Scheduling
Base stations
Telecommunication traffic

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Media Technology
  • Software

Cite this

Aida, H., Tobe, Y., Saito, M., & Tokuda, H. (2001). A software approach to Channel-state dependent scheduling for wireless LANs. In Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001 (pp. 33-42). Association for Computing Machinery, Inc. https://doi.org/10.1145/605991.605996

A software approach to Channel-state dependent scheduling for wireless LANs. / Aida, Hiroto; Tobe, Yoshito; Saito, Masato; Tokuda, Hideyuki.

Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001. Association for Computing Machinery, Inc, 2001. p. 33-42.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aida, H, Tobe, Y, Saito, M & Tokuda, H 2001, A software approach to Channel-state dependent scheduling for wireless LANs. in Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001. Association for Computing Machinery, Inc, pp. 33-42, 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001, Rome, Italy, 01/7/21. https://doi.org/10.1145/605991.605996
Aida H, Tobe Y, Saito M, Tokuda H. A software approach to Channel-state dependent scheduling for wireless LANs. In Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001. Association for Computing Machinery, Inc. 2001. p. 33-42 https://doi.org/10.1145/605991.605996
Aida, Hiroto ; Tobe, Yoshito ; Saito, Masato ; Tokuda, Hideyuki. / A software approach to Channel-state dependent scheduling for wireless LANs. Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001. Association for Computing Machinery, Inc, 2001. pp. 33-42
@inproceedings{395302ff009c4a248d108a4c2e5ef64e,
title = "A software approach to Channel-state dependent scheduling for wireless LANs",
abstract = "This paper proposes a new practical packet scheduling scheme for wireless LANs called SoCPS and also explores extensively the effectiveness of wireless packet scheduling under a variety of conditions over an actual wireless LAN. One well-known aspect in packet scheduling at the base station is consideration of channel state dependency. In conventional studies, the channel state is expressed in microscopic two states in the Markovian sense. To eliminate a large overhead associated with acquiring such a fine-grain channel state and to establish a software-based enhancement, we introduce the notion of Strength of Connection (SoC) which can be expressed as the long-term strength of the connectivity between the base station and an end host. We examine schemes for identifying the channel state and examine the applicability to packet scheduling. We also design a packet scheduling scheme based on SoC called SoCPS. Finally, we investigate the performance under various conditions of traffic and wireless channel states. We have designed and implemented SoCPS on FreeBSD computers. Our evaluation results obtained with up to eight wireless-LAN nodes have determined the applicability of SoCPS and limitation in wireless packet scheduling for wireless LANs. In particular, while FIFO is sufficient in many cases where TCP traffic is dominant, scheduling with SoC consideration is effective for real-time UDP traffic. Copyright ACM 2001.",
author = "Hiroto Aida and Yoshito Tobe and Masato Saito and Hideyuki Tokuda",
year = "2001",
month = "7",
day = "21",
doi = "10.1145/605991.605996",
language = "English",
pages = "33--42",
booktitle = "Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - A software approach to Channel-state dependent scheduling for wireless LANs

AU - Aida, Hiroto

AU - Tobe, Yoshito

AU - Saito, Masato

AU - Tokuda, Hideyuki

PY - 2001/7/21

Y1 - 2001/7/21

N2 - This paper proposes a new practical packet scheduling scheme for wireless LANs called SoCPS and also explores extensively the effectiveness of wireless packet scheduling under a variety of conditions over an actual wireless LAN. One well-known aspect in packet scheduling at the base station is consideration of channel state dependency. In conventional studies, the channel state is expressed in microscopic two states in the Markovian sense. To eliminate a large overhead associated with acquiring such a fine-grain channel state and to establish a software-based enhancement, we introduce the notion of Strength of Connection (SoC) which can be expressed as the long-term strength of the connectivity between the base station and an end host. We examine schemes for identifying the channel state and examine the applicability to packet scheduling. We also design a packet scheduling scheme based on SoC called SoCPS. Finally, we investigate the performance under various conditions of traffic and wireless channel states. We have designed and implemented SoCPS on FreeBSD computers. Our evaluation results obtained with up to eight wireless-LAN nodes have determined the applicability of SoCPS and limitation in wireless packet scheduling for wireless LANs. In particular, while FIFO is sufficient in many cases where TCP traffic is dominant, scheduling with SoC consideration is effective for real-time UDP traffic. Copyright ACM 2001.

AB - This paper proposes a new practical packet scheduling scheme for wireless LANs called SoCPS and also explores extensively the effectiveness of wireless packet scheduling under a variety of conditions over an actual wireless LAN. One well-known aspect in packet scheduling at the base station is consideration of channel state dependency. In conventional studies, the channel state is expressed in microscopic two states in the Markovian sense. To eliminate a large overhead associated with acquiring such a fine-grain channel state and to establish a software-based enhancement, we introduce the notion of Strength of Connection (SoC) which can be expressed as the long-term strength of the connectivity between the base station and an end host. We examine schemes for identifying the channel state and examine the applicability to packet scheduling. We also design a packet scheduling scheme based on SoC called SoCPS. Finally, we investigate the performance under various conditions of traffic and wireless channel states. We have designed and implemented SoCPS on FreeBSD computers. Our evaluation results obtained with up to eight wireless-LAN nodes have determined the applicability of SoCPS and limitation in wireless packet scheduling for wireless LANs. In particular, while FIFO is sufficient in many cases where TCP traffic is dominant, scheduling with SoC consideration is effective for real-time UDP traffic. Copyright ACM 2001.

UR - http://www.scopus.com/inward/record.url?scp=34047148717&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34047148717&partnerID=8YFLogxK

U2 - 10.1145/605991.605996

DO - 10.1145/605991.605996

M3 - Conference contribution

AN - SCOPUS:34047148717

SP - 33

EP - 42

BT - Proceedings of the 4th ACM International Workshop on Wireless Mobile Multimedia, WOWMOM 2001

PB - Association for Computing Machinery, Inc

ER -