Topological Interference Management with Confidential Messages

by   Jean de Dieu Mutangana, et al.

The topological interference management (TIM) problem refers to the study of the K-user partially connected interference networks with no channel state information at the transmitters (CSIT), except for the knowledge of network topology. In this paper, we study the TIM problem with confidential messages (TIM-CM), where message confidentiality must be satisfied in addition to reliability constraints. In particular, each transmitted message must be decodable at its intended receiver and remain confidential at the remaining (K-1) receivers. Our main contribution is to present a comprehensive set of results for the TIM-CM problem by studying the symmetric secure degrees of freedom (SDoF). To this end, we first characterize necessary and sufficient conditions for feasibility of positive symmetric SDoF for any arbitrary topology. We next present two achievable schemes for the TIM-CM problem: For the first scheme, we use the concept of secure partition and, for the second one, we use the concept of secure maximal independent sets. We also present outer bounds on symmetric SDoF for any arbitrary network topology. Using these bounds, we characterize the optimal symmetric SDoF of all K=2-user and K=3-user network topologies.



There are no comments yet.


page 1

page 2

page 3

page 4


Secure Communication over Interference Channel: To Jam or Not to Jam?

We consider a secure communication over a two-user Gaussian interference...

Topological Content Delivery with Feedback and Random Receiver Cache

We study the problem of content delivery in two-user interference channe...

Multilevel Topological Interference Management: A TIM-TIN Perspective

The robust principles of treating interference as noise (TIN) when it is...

On the Degrees-of-Freedom of Two-Unicast Wireless Networks with Delayed CSIT

We characterize the degrees-of-freedom (DoF) region of a class of two-un...

Scalable Security in Interference Channels With Arbitrary Number of Users

In this paper, we present an achievable security scheme for an interfere...

A Topological Approach to Secure Message Dissemination in Vehicular Networks

Secure message dissemination is an important issue in vehicular networks...

On the Hardness of the Strongly Dependent Decision Problem

We present necessary and sufficient conditions for solving the strongly ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.