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 language | English (US) |
---|---|
Pages (from-to) | 826-839 |
Number of pages | 14 |
Journal | IEEE/ACM Transactions on Networking |
Volume | 16 |
Issue number | 4 |
DOIs | |
State | Published - 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