Related papers: A Layered Caching Architecture for the Interferenc…
The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the…
Caching multimedia contents at the network edge is a key solution to decongest the amount of traffic in the backhaul link. In this paper, we extend and analyze the coded caching technique [1] in an unexplored scenario, i.e. at the edge of…
Consider an interference channel consisting of $K_T$ transmitters and $K_R$ receivers with AWGN noise and complex channel gains, and with $N$ files in the system. The one-shot $\mathsf{DoF}$ for this channel is the maximum number of…
Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. Analysis of such D2D caching networks based on a physical interference…
In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert…
A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…
The strong interference suffered by users can be a severe problem in cache-enabled networks (CENs) due to the content-centric user association mechanism. To tackle this issue, multi-antenna technology may be employed for interference…
We consider a state-dependent parallel Gaussian channel with independent states and a common cognitive helper, in which two transmitters wish to send independent information to their corresponding receivers over two parallel subchannels.…
Multi-tier architecture improves the spatial reuse of radio spectrum in cellular networks, but it introduces complicated heterogeneity in the spatial distribution of transmitters, which brings new challenges in interference analysis. In…
This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…
The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…
Caching and multicasting at base stations are two promising approaches to support massive content delivery over wireless networks. However, existing analysis and designs do not fully explore and exploit the potential advantages of the two…
This paper considers the secretive coded caching problem with shared caches in which no user must have access to the files that it did not demand. In a shared cache network, the users are served by a smaller number of helper caches and each…
Collisions with hidden terminals is a major cause of performance degradation in 802.11 and likewise wireless networks. Carrier sense multiple access with collision avoidance (CSMA/CA) is utilized to avoid collisions at the cost of spatial…
This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers…
Nowadays computer networks use different kind of memory whose speeds and capacities vary widely. There exist methods of a so-called caching which are intended to use the different kinds of memory in such a way that the frequently used data…
Caching popular contents at the edge of the network can positively impact the performance and future sustainability of wireless networks in several ways, e.g., end-to-end access delay reduction and peak rate increase. In this paper, we aim…
Coded caching has been shown to result in significant throughput gains, but its gains were proved only by assuming a placement phase with no transmission cost. A free placement phase is, however, an unrealistic assumption that could stand…
This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…
This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…