This paper studies the multicast capacity of full-duplex 1-2-1 networks. In this model, two nodes can communicate only if they point "beams" at each other; otherwise, no signal can be exchanged. The main result of this paper is that the approximate multicast capacity can be computed by solving a linear program in the activation times of links connecting pairs of nodes. This linear program has two appealing features: (i) it can be solved in polynomial-time in the number of nodes; (ii) it allows to efficiently find a network schedule optimal for the approximate capacity. Additionally, the relation between the approximate multicast capacity and the minimum approximate unicast capacity is studied. It is shown that the ratio between these two values is not universally equal to one, but it depends on the number of destinations in the network, as well as graph-theoretic properties of the network.
|Original language||English (US)|
|Title of host publication||2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - Jul 2019|
|Event||2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France|
Duration: Jul 7 2019 → Jul 12 2019
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||2019 IEEE International Symposium on Information Theory, ISIT 2019|
|Period||7/7/19 → 7/12/19|
Bibliographical noteFunding Information:
Y. H. Ezzeldin and C. Fragouli were supported in part by NSF awards 1514531, 1824568 and UC-NL grant LFR-18-548554. 1Constant gap refers to a quantity that is independent of the channel coefficients and operating SNR, and solely depends on the number of nodes.
Y. H. Ezzeldin and C. Fragouli were supported in part by NSF awards 1514531, 1824568 and UC-NL grant LFR-18-548554.