The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks

TL;DR

This paper introduces a new distributed algorithm for stream control in MIMO networks, addressing the induced bounded-degree subgraph problem, with proven efficiency and simulation validation.

Contribution

It presents a novel distributed algorithm for stream control in MIMO networks, linking it to the induced bounded-degree subgraph problem and providing theoretical and simulation analysis.

Findings

Algorithm completes in logarithmic time with high probability.

Algorithm guarantees linear time completion.

Simulation results show effectiveness of stream control and impact of interference management.

Abstract

In this report, we consider maximal solutions to the induced bounded-degree subgraph problem and relate it to issues concerning stream control in multiple-input multiple-output (MIMO) networks. We present a new distributed algorithm that completes in logarithmic time with high probability and is guaranteed to complete in linear time. We conclude the report with simulation results that address the effectiveness of stream control and the relative impact of receiver overloading and flexible interference suppression.