Computer Science – Networking and Internet Architecture
Scientific paper
2007-09-06
Computer Science
Networking and Internet Architecture
Scientific paper
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.
No associations
LandOfFree
The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-466626