Related papers: Topological Interference Management with Confident…
Interference alignment (IA) is a joint-transmission technique that achieves the capacity of the interference channel for high signal-to-noise ratios (SNRs). Most prior work on IA is based on the impractical assumption that perfect and…
We consider a system comprising a library of $N$ files (e.g., movies) and a wireless network with $K_T$ transmitters, each equipped with a local cache of size of $M_T$ files, and $K_R$ receivers, each equipped with a local cache of size of…
This paper investigates the symmetric degrees of freedom (DoF) of MIMO cellular networks with G cells and K users per cell, having N antennas at each base station and M antennas at each user. In particular, we investigate achievability…
We introduce an opportunistic interference mitigation (OIM) protocol, where a user scheduling strategy is utilized in $K$-cell uplink networks with time-invariant channel coefficients and base stations (BSs) having $M$ antennas. Each BS…
Consider a MIMO interference channel whereby each transmitter and receiver are equipped with multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can maximize system throughput. The recent work…
A $K_T \times K_R$ cache-aided wireless interference network, in which both the transmitters and the receivers are equipped with cache memories is studied. Each user requests one file from a library of $N$ popular files. The goal is to…
Privacy-preserving distributed processing has recently attracted considerable attention. It aims to design solutions for conducting signal processing tasks over networks in a decentralized fashion without violating privacy. Many algorithms…
This paper develops a feedback-based method to preserve the topology privacy of consensus protocols in network systems. The key idea is to intentionally violate topology identifiability conditions, thereby preventing unique or accurate…
This paper considers the problem of single-server Private Computation (PC) in the presence of Side Information (SI). In this problem, there is a server that stores $K$ i.i.d. messages, and a user who has a subset of $M$ uncoded messages or…
Secure message dissemination is an important issue in vehicular networks, especially considering the vulnerability of vehicle to vehicle message dissemination to malicious attacks. Traditional security mechanisms, largely based on message…
In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…
The $2$ user MIMO interference channel with arbitrary antenna configurations is studied under arbitrary levels of partial CSIT for each of the channels, to find the degrees of freedom (DoF) achievable by either user while the other user…
There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise. Previously, a linear bound was believed to put an upper limit on the rate-transmittance performance. Remarkably, the…
It has been shown recently by Geng et al. that in a $K$ user Gaussian interference network, if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest…
Integrated sensing and communication (ISAC) systems provide significant enhancements in performance and resource efficiency compared to individual sensing and communication systems, primarily attributed to the collaborative use of wireless…
We characterize the degrees of freedom (DoF) of multi-way relay MIMO interference networks. In particular, we consider a wireless network consisting of 4 user nodes, each with M antennas, and one N-antenna relay node. In this network, each…
For a K-user interference channel, the degree of freedom (DoF) which can be achieved through interference alignment (IA) is constrained to signal space dimension governed by the number of Tx/Rx antennas. To overcome this problem, IA can be…
We study the degrees of freedom (DoF) of a $K$-user parallel MISO broadcast channel with arbitrary levels of partial CSIT over each subchannel. We derive a sum-DoF upperbound which depends on the average CSIT quality of each user. This…
Index coding employs coding across clients within the same broadcast domain. This typically assumes that all clients learn the coding matrix so that they can decode and retrieve their requested data. However, learning the coding matrix can…
We consider a cooperative X-channel with $\sf K$ transmitters (TXs) and $\sf K$ receivers (Rxs) where Txs and Rxs are gathered into groups of size $\sf r$ respectively. Txs belonging to the same group cooperate to jointly transmit a message…