Wireless Network Simplification: The Performance of Routing
Yahya H. Ezzeldin, Ayan Sengupta, Christina Fragouli

TL;DR
This paper analyzes the limitations of routing in wireless Gaussian networks, showing that routing can be significantly suboptimal compared to physical layer cooperation, with worst-case guarantees depending on network topology and layers.
Contribution
It provides the first characterization of routing performance relative to capacity-achieving cooperation in general wireless network topologies.
Findings
Routing guarantees are at least 1/(floor(N/2)+1) of capacity in worst case.
Existence of routes achieving at least 2/((L-1)N_L+4) or 2/(L N_L+2) of capacity in layered networks.
A new MIMO antenna selection simplification result of independent interest.
Abstract
Consider a wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path that connects them. In this paper, we show that routing can in the worst case result in an unbounded gap from the network capacity - or reversely, physical layer cooperation can offer unbounded gains over routing. More specifically, we show that for -relay Gaussian networks with an arbitrary topology, routing can in the worst case guarantee an approximate fraction of the capacity of the full network, independently of the SNR regime. We prove that this guarantee is fundamental, i.e., it is the highest worst-case guarantee that we can provide for routing in relay networks. Next, we consider how these…
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.
