Capacity Bounds for Two-Hop Interference Networks
Yi Cao, Biao Chen

TL;DR
This paper investigates the capacity bounds of a two-hop interference network with relay nodes, analyzing achievable rates under decode-and-forward and amplify-and-forward schemes through coding strategies and numerical evaluations.
Contribution
It introduces new achievable symmetric rate schemes for a two-hop interference network modeled as cascaded Gaussian interference channels, with detailed coding strategies and analysis.
Findings
Proposes achievable symmetric rates for different regimes.
Analyzes decode-and-forward and amplify-and-forward relaying schemes.
Provides numerical results demonstrating the performance of the proposed schemes.
Abstract
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two relay nodes serve as intermediaries between the transmitters and receivers. Each hop, one from the transmitters to the relays and the other from the relays to the receivers, is modeled as a Gaussian interference channel, thus the network is essentially a cascade of two interference channels. For this network, achievable symmetric rates for different parameter regimes under decode-and- forward relaying and amplify-and-forward relaying are proposed and the corresponding coding schemes are carefully studied. Numerical results are also provided.
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.
Taxonomy
TopicsCooperative Communication and Network Coding · Mobile Ad Hoc Networks · Wireless Communication Security Techniques
