Credit-based fair scheduling in ad hoc wireless networks

Hsi-Lu Chao*, Wanjiun Liao

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

12 Scopus citations

Abstract

This paper studies fair scheduling in ad hoc wireless networks. We propose a credit-based mechanism to ensure fairness for best effort flows. Each flow is associated with a credit value, and is scheduled based on the concept of "the less excess in usage value, the higher the transmission priority". The network is logically partitioned into clusters, each with a scheduler, and an unique code. The schedulers first assign time slots to mobiles in the affiliated clusters. The mobile scheduled to send at the next time slot then in turn assign the time slot to a flow. Each scheduler operates independently, and together, they allow flows in the network to share bandwidth in a fair way. We have also performed simulations to validate the proposed mechanism. The results show that the proposed mechanism provides fair share of bandwidth to all flows, and also improves overall system throughput.

Original languageEnglish
Pages (from-to)1442-1446
Number of pages5
JournalIEEE Vehicular Technology Conference
Volume56
Issue number3
DOIs
StatePublished - 1 Jan 2002
Event56th Vehicular Technology Conference - Vancouver, BC, Canada
Duration: 24 Sep 200228 Sep 2002

Keywords

  • Ad hoc networks
  • Credit-based
  • Fair scheduling

Fingerprint Dive into the research topics of 'Credit-based fair scheduling in ad hoc wireless networks'. Together they form a unique fingerprint.

Cite this