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

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.

• Type: Journal
• Year: 2008
• Where: TON
• Authors: Loc Bui, Atilla Eryilmaz, R. Srikant, Xinzhou Wu
• Keywords: Algorithms, Congestion Control, Multi-hop Wireless Network, TON 2008