Finite-Horizon Horizon Throughput Region for Wireless Multi-User Multi User Interference Channels
Abstract: This paper studies a wireless network consisting of multiple transmitter-receiver transmitter pairs where interference is treated as noise. Previously, the throughput region of such networks was characterized for either one time slot or an infinite time horizon. We aim to fill the gap by investigating the throughput region for transmissions over a finite time horizon. Unlike the infinite-horizon infinite horizon throughput region, which is simplyy the convex hull of the throughput region of one time slot, the finite-horizon horizon throughput region is generally non-convex. non convex. Instead of directly characterizing all achievable rate-tuples rate in the finite-horizon horizon throughput region, we propose a metric termed the rate margin, which not only determines whether any given rate-tuple tuple is within the throughput region (i.e., achievable or unachievable), but also tells the amount of scaling that can be done to the given achievable (unachievable) rate rate-tuple such that the resulting esulting rate rate-tuple is still within (brought back into) the throughput region. Furthermore, we derive an efficient algorithm to find the rate-achieving rate achieving policy for any given rate-tuple rate in the finite-horizon horizon throughput region.