Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling

Loc Bui, Atilla Eryilmaz, R. Srikant, Xinzhou Wu

Research output: Contribution to journalArticle

Abstract

We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time, and not to do both, we propose an architecture for fair resource allocation that consists of a distributed scheduling algorithm operating in conjunction with an asynchronous congestion control algorithm. We show that the proposed joint congestion control and scheduling algorithm supports at least one-third of the throughput supportable by any other algorithm, including centralized algorithms.

Original languageEnglish (US)
Pages (from-to)826-839
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number4
DOIs
StatePublished - Aug 12 2008

Keywords

  • Congestion control
  • Distributed scheduling
  • Fair resource allocation
  • Totally asynchronous algorithm
  • Wireless networks

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling'. Together they form a unique fingerprint.

  • Cite this