Abstract
We consider the Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. The capacity of such networks, although not known exactly, can be approximated to within a constant gap that is independent of SNR of the channels. The approximation takes the form of a linear program where the optimization is on the schedule of the relaying states. It was conjectured in [3] that there always exist optimal schedules that have at most n+1 active states, instead of the possible 2n relaying states. Making novel use of submodularity properties of cut expressions appearing in the linear program, we prove the conjecture for n = 3 and show that there exist optimal schedules with at most 6, 9 and 17 active states for n = 4, 5 and 6 relay networks, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
