When an Energy-Efficient Scheduling is Optimal for Half-Duplex Relay Networks?

Sarthak Jain, Martina Cardone, Soheil Mohaier

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper considers a diamond network with n interconnected relays, namely a network where a source communicates with a destination by hopping information through n communicating/interconnected relays. Specifically, the main focus of the paper is on characterizing sufficient conditions under which the n + 1 states (out of the 2n possible ones) in which at most one relay is transmitting suffice to characterize the approximate capacity, that is the Shannon capacity up to an additive gap that only depends on n. Furthermore, under these sufficient conditions, closed form expressions for the approximate capacity and scheduling (that is, the fraction of time each relay should receive and transmit) are provided. A similar result is presented for the dual case, where in each state at most one relay is in receive mode.

Original languageEnglish (US)
Title of host publication2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1350-1355
Number of pages6
ISBN (Electronic)9781538682098
DOIs
StatePublished - Jul 12 2021
Event2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia
Duration: Jul 12 2021Jul 20 2021

Publication series

Name2021 IEEE International Symposium on Information Theory (ISIT)

Conference

Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/TerritoryAustralia
CityVirtual, Melbourne
Period7/12/217/20/21

Bibliographical note

Funding Information:
This research was supported in part by NSF under Award #1907785.

Publisher Copyright:
© 2021 IEEE.

Fingerprint

Dive into the research topics of 'When an Energy-Efficient Scheduling is Optimal for Half-Duplex Relay Networks?'. Together they form a unique fingerprint.

Cite this