A Greedy Omnidirectional Relay Scheme
Liang-Liang Xie

TL;DR
This paper introduces a greedy omnidirectional relay scheme for the all-source all-cast problem, deriving achievable rate regions for various channel models and modes, advancing relay communication strategies.
Contribution
It develops a new greedy relay scheme and characterizes the achievable rate region for all-source all-cast scenarios across different channel models and operational modes.
Findings
Achievable rate region for the all-source all-cast problem derived.
Scheme applicable to discrete memoryless and AWGN channels.
Effective in both full-duplex and half-duplex modes.
Abstract
A greedy omnidirectional relay scheme is developed, and the corresponding achievable rate region is obtained for the all-source all-cast problem. The discussions are first based on the general discrete memoryless channel model, and then applied to the additive white Gaussian noise (AWGN) models, with both full-duplex and half-duplex modes.
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 · Full-Duplex Wireless Communications · Antenna Design and Analysis
