Degrees of Freedom and Secrecy in Wireless Relay Networks
Arsenia Chorti, Ragnar Freij, and David Karpuk

TL;DR
This paper models secure wireless relay networks using algebraic geometry, specifically Grassmannians, to determine fundamental data transmission limits and analyze the structure of secure communication subspaces.
Contribution
It introduces a novel geometric framework for analyzing secrecy and capacity in multi-user relay networks, providing dimension calculations and defining equations for key subvarieties.
Findings
Calculated dimensions of subvarieties related to secure communication
Identified fundamental data limits in symmetric antenna configurations
Provided algebraic descriptions of the secure subspace structures
Abstract
We translate the problem of designing a secure communications protocol for several users communicating through a relay in a wireless network into understanding certain subvarieties of products of Grassmannians. We calculate the dimension of these subvarieties and provide various results concerning their defning equations. When the relay and all of the users have the same number of antennas, this approach places fundamental limits on the amount of data that can be passed through such a network.
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
TopicsWireless Communication Security Techniques · Graph theory and applications · Limits and Structures in Graph Theory
