Wireless Network Simplification : Beyond Diamond Networks
Yahya H. Ezzeldin, Ayan Sengupta, Christina Fragouli

TL;DR
This paper investigates how to select smaller subnetworks within layered Gaussian relay networks to retain a significant fraction of the overall capacity, providing theoretical guarantees and specific examples.
Contribution
It establishes capacity approximation ratios for subnetworks with fewer relays, extending understanding beyond diamond networks and deriving new results on MIMO antenna selection.
Findings
Existence of subnetworks achieving specific capacity fractions for various network configurations
Capacity bounds for subnetworks with K relays per layer
Examples demonstrating exact capacity fractions achieved by subnetworks
Abstract
We consider an arbitrary layered Gaussian relay network with layers of relays each, from which we select subnetworks with relays per layer. We prove that: (i) For arbitrary and , there always exists a subnetwork that approximately achieves of the network capacity for odd (resp. even ), (ii) For , there always exists a subnetwork that approximately achieves of the network capacity. We also provide example networks where even the best subnetworks achieve exactly these fractions (up to additive gaps). Along the way, we derive some results on MIMO antenna selection and capacity decomposition that may also be of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
