Related papers: Every Bit Counts: Second-Order Analysis of Coopera…
We investigate a cognitive radio system with two secondary users who can cooperate with the primary user in relaying its packets to the primary receiver. In addition to its own queue, each secondary user has a queue to keep the primary…
This paper investigates a setup consisting of multiple transmitters serving multiple cache-enabled clients through a linear network, which covers both wired and wireless transmission situations. We investigate decentralized coded caching…
The higher-order statistics (HOS) of the channel capacity $\mu_n=\mathbb{E}[\log^n(1+\gamma_{end})]$, where $n\in\mathbb{N}$ denotes the order of the statistics, has received relatively little attention in the literature, due in part to the…
This paper studies interference channels with security constraints. The existence of an external eavesdropper in a two-user interference channel is assumed, where the network users would like to secure their messages from the external…
A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…
In a semi-realistic market simulator, independent reinforcement learning algorithms may facilitate market makers to maintain wide spreads even without communication. This unexpected outcome challenges the current antitrust law framework. We…
In mobile edge computing (MEC) systems, the wireless channel condition is a critical factor affecting both the communication power consumption and computation rate of the offloading tasks. This paper exploits the idea of cooperative…
This paper quantifies the benefits and limitations of cooperative communications by providing a statistical analysis of the downlink in network multiple-input multiple-output (MIMO) systems. We consider an idealized model where the…
This paper investigates the interplay between cooperation and achievable rates in multi-terminal networks. Cooperation refers to the process of nodes working together to relay data toward the destination. There is an inherent tradeoff…
This correspondence studies the downlink transmission in a multi-cell system, where multiple base stations (BSs) each with multiple antennas cooperatively design their respective transmit beamforming vectors to optimize the overall system…
In this paper, we consider the relaying of orthogonal space time block codes (OSTBCs) in a two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system with estimated channel state information (CSI). A simple four…
This paper studies cache-aided interference networks with arbitrary number of transmitters and receivers, whereby each transmitter has a cache memory of finite size. Each transmitter fills its cache memory from a content library of files in…
Compute-forward multiple access (CFMA) is a multiple access transmission scheme based on Compute-and-Forward (CF) which allows the receiver to first decode linear combinations of the transmitted signals and then solve for individual…
Federated learning (FL) offers a privacy-preserving collaborative approach for training models in wireless networks, with channel estimation emerging as a promising application. Despite extensive studies on FL-empowered channel estimation,…
Cache-aided MIMO communications aims to jointly exploit both coded caching~(CC) and spatial multiplexing gains to enhance communication efficiency. In this paper, we analyze both the achievable degrees of freedom~(DoF) under linear…
This paper considers maximizing the network-wide minimum supported rate in the downlink of a two-cell system, where each base station (BS) is endowed with multiple antennas. This is done for different levels of cell cooperation. At one…
The degrees of freedom (DoF) available for communication provides an analytically tractable way to characterize the information-theoretic capacity of interference channels. In this paper, the DoF of a K-user interference channel is studied…
In a multi-user scenario where users belong to different operators, any interference mitigation method needs unavoidably some degree of cooperation among service providers. In this paper we propose a cooperation strategy based on the…
In this paper, we consider a multi-access coded caching system with decentralized prefetching, where a server hosts $N$ files, each of size $F$ bits, and is connected to $K$ users through a shared link. There are $c$ caches distributed…
This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…