Wireless Network Simplification: The Performance of Routing

DOI10.1109/TIT.2020.3010990MaRDI QIDQ5124535zbMATH OpenOpenAlexFDO

Authors Yahya H. Ezzeldin, Ayan Sengupta, Christina Fragouli

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.01007

zbMATH Keywords

arbitrary topologyGaussian full-duplex relay networksnetwork simplification problem

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30)

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 $N$-relay Gaussian networks with an arbitrary topology, routing can in the worst case guarantee an approximate fraction $frac1leftlfloorN/2ightfloor+1$ 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 guarantees are refined for Gaussian layered relay networks with $L$ layers and $N_L$ relays per layer. We prove that for arbitrary $L$ and $N_L$, there always exists a route in the network that approximately achieves at least $frac2(L-1)N_L+4$ $left(mboxresp.frac2L{N}_L+2ight)$ of the network capacity for odd $L$ (resp. even $L$), and there exist networks where the best routes exactly achieve these fractions. These results are formulated within the network simplification framework, that asks what fraction of the capacity we can achieve by using a subnetwork (in our case, a single path). A fundamental step in our proof is a simplification result for MIMO antenna selection that may also be of independent interest. To the best of our knowledge, this is the first result that characterizes, for general wireless network topologies, what is the performance of routing with respect to physical layer cooperation techniques that approximately achieve the network capacity.

Recommendations

• Distributed Computing – IWDC 2005
• A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks
• Performance analysis of multi-hop wireless packet networks
• Optimization in wireless networks
• A dynamic programming approach: improving the performance of wireless networks
• scientific article; zbMATH DE number 2088403

This page was built for publication: Wireless Network Simplification: The Performance of Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124535)