Wireless Network Simplification: The Performance of Routing

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 1 N/2 +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 2 (L−1)N L +4 resp. 2 LN L +2 of the network capacity for odd L (resp. even L), and there exist networks where the best routes exactly

Buffer evaluation model and scheduling strategy for video streaming services in 5G-powered drone using machine learning

“…

In recent years, the popularity of 5G cellular networks has allowed a variety of mobile devices to communicate with each other and provide different services [1][2][3]. Among them, the development of 5G-powered UAV is particularly rapid, and real-time video backhaul is an important service that this equipment can provide.

…”