Shadow queue based fair scheduling in multi-hop wireless networks

  • Jian Xu*
  • , Ming Guo
  • , Ming Xu
  • , Xin Lin
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

we study the problem of flow based scheduling in multi-hop wireless networks. And propose a Max Flows First-Shadow queue based Congestion Control (MFF-SCC) algorithm for combined scheduling and congestion control that aims to solve max-min fairness problem. We give out detailed analysis of the algorithm and also conduct simulations to verify its performance. The results of simulations indicate that the proposed approach can improve fairness of scheduling.

Original languageEnglish
Title of host publication2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010
DOIs
StatePublished - 2010
Event2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010 - Chengdu, China
Duration: 23 Sep 201025 Sep 2010

Publication series

Name2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010

Conference

Conference2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010
Country/TerritoryChina
CityChengdu
Period23/09/1025/09/10

Keywords

  • Multi-hop
  • Scheduling
  • Shadow Queue

Fingerprint

Dive into the research topics of 'Shadow queue based fair scheduling in multi-hop wireless networks'. Together they form a unique fingerprint.

Cite this