Wireless Network Simplification: The Performance of Routing

@article{Ezzeldin2020WirelessNS,
  title={Wireless Network Simplification: The Performance of Routing},
  author={Yahya H. Ezzeldin and Ayan Sengupta and Christina Fragouli},
  journal={IEEE Transactions on Information Theory},
  year={2020},
  volume={66},
  pages={5703-5711}
}
This paper explores the <italic>network simplification</italic> problem for Gaussian full-duplex relay networks with arbitrary topology. Particularly, given an <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>-relay Gaussian full-duplex network, the network simplification problem seeks to find fundamental guarantees on the capacity of the best subnetwork, among a particular class of subnetworks, as a fraction of the full-network capacity. The focus of this work is the… 
View on IEEE
doi.org
4 Citations
Background Citations
1

Figures from this paper

4 Citations

Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications

The development of a constant gap approximation for the unicast and multicast capacities of the proposed network model and network simplification results are proved for the 1-2-1 network model by exploiting the structure of the linear program that represents the approximate capacity.

An Exploration-driven Reinforcement Learning Model for Video Streaming Scheduling in 5G-Powered Drone

A video streaming scheduling model based on reinforcement learning that enables the model to fully explore the environment even when the reward is sparse, so as to obtain an effective scheduling strategy.

ENERGY EFFICIENT OPTIMIZED PATH SELECTION WITH MACHINE LEARNING IN WIRELESS SENSOR NETWORKS

An improved routing with less energy consumption is found to improve the network life span and BPBAT algorithm is proposed in this paper for further reliability with optimized path.

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

This approach uses the method of machine learning to extract the correlation between the buffer starvation probability distribution and the traffic load, thereby obtaining the explicit evaluation results of buffer starvation events and a series of resource allocation strategies that optimize long-term QoE.

References

SHOWING 1-10 OF 37 REFERENCES

Network Simplification in Half-Duplex: Building on Submodularity

The key steps in the proofs lie in the derivation of properties of submodular functions, which provide a combinatorial handle on the network simplification problem for Gaussian half-duplex diamond networks.

Efficient subnetwork selection in relay networks

Simulations using off-the-shelf non-linear optimization algorithms demonstrate excellent performance with respect to the true integer optimum for both diamond networks as well as multi-layered networks.

Wireless Network Simplification: The Gaussian \(N\) -Relay Diamond Network

An algorithm is proposed that computes a constant gap approximation to the capacity of the Gaussian N-relay diamond network in O(N log N) running time and discovers a high-capacity k-relays subnetwork in O (kN)Running time.

Network Simplification: The Gaussian diamond network with multiple antennas

It is shown that when n s = n d = 2 and when the individual MISO channels from the source to each relay and the SIMO channels from each relay to the destination have the same capacity, there exists a two relay sub-network that achieves approximately all the capacity of the network.

Fast near-optimal subnetwork selection in layered relay networks

  • R. KolteAyfer Özgür
  • Computer Science
    2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
These findings suggest that while submodularity of the cut function holds in more generality independent of the topology of the network, in the case of layered networks, algorithms exploiting the layered structure of thecut function can be much more efficient.

Wireless network simplification: Beyond diamond networks

It is proved that for arbitrary L;N and K = 1, there always exists a subnetwork that approximately achieves 2/(L-1)N+4 (resp. 2/LN+2) of the network capacity for even L, and also provides example networks where even the best subnetworks achieve exactly these fractions (up to additive gaps).

Wireless Network Information Flow: A Deterministic Approach

An exact characterization of the capacity of a network with nodes connected by deterministic channels is obtained, a natural generalization of the celebrated max-flow min-cut theorem for wired networks.

Capacity Approximations for Gaussian Relay Networks

This paper provides an improved lower bound on the rate achieved by the compress-and-forward-based strategies (noisy network coding in particular) in arbitrary Gaussian relay networks, whose gap to capacity depends on the network not only through the total number of nodes but also through the degrees of freedom of the min cut of the network.

Achieving the capacity of the N-relay Gaussian diamond network within logn bits

We consider the N-relay Gaussian diamond network where a source node communicates to a destination node via N parallel relays. We show that several strategies can achieve the capacity of this network…

Analog network coding in general SNR regime: Performance of network simplification

This work offers the first characterization of the performance of network simplification in general layered amplify-and-forward relay networks and suggests a new rate approximation scheme that allows for the simultaneous computation of additive and multiplicative gaps.