PROJECT TITLE :

MaxWeight Versus BackPressure: Routing and Scheduling in Multichannel Relay Networks

ABSTRACT:

We study routing and scheduling algorithms for relay-assisted, multichannel downlink wireless networks [e.g., orthogonal frequency-division multiplexing (OFDM)-primarily based cellular systems with relays]. Over such networks, whereas it's well understood that the BackPressure algorithm is stabilizing (i.e., queue lengths do not become arbitrarily massive), its performance (e.g., delay, buffer usage) can be poor. During this paper, we have a tendency to study an alternative-the MaxWeight algorithm-variants of that are known to possess smart performance in an exceedingly single-hop setting. During a general relay setting, however, MaxWeight isn't even stabilizing (and so can have very poor performance). In this paper, we tend to study an iterative MaxWeight algorithm for routing and scheduling in downlink multichannel relay networks. We show that, surprisingly, the iterative MaxWeight algorithm can stabilize the system in many giant-scale instantiations of this setting (e.g., general arrivals with full-duplex relays, bounded arrivals with 0.5-duplex relays). Furthermore, using each many-channel massive-deviations analysis and simulations, we show that iterative MaxWeight outperforms the BackPressure algorithm from a queue-length/delay perspective.