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

  • Authors:
  • Loc Bui;Atilla Eryilmaz;R. Srikant;Xinzhou Wu

  • Affiliations:
  • Department of Electrical and Computer Engineering, Coordinated Science Lab, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering, Ohio State University, Columbus, OH;Department of Electrical and Computer Engineering, Coordinated Science Lab, University of Illinois at Urbana-Champaign, Urbana, IL;Qualcomm Flarion Technologies, Bridgewater, NJ

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.