Related papers: Throughput Scaling Laws for Wireless Networks with…
We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…
This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…
We consider the problem of covert communication over wireless adhoc networks in which (roughly) $n$ legitimate nodes (LNs) and $n^{\kappa}$ for $0<\kappa<1$ non-communicating warden nodes (WNs) are randomly distributed in a square of unit…
Statistically independent or positively correlated fading models are usually applied to compute the average performance of wireless communications. However, there exist scenarios with negative dependency and it is therefore of interest how…
We study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast…
We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We…
A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for…
The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as…
The real-time quantification of the effect of a wireless channel on the transmitting signal is crucial for the analysis and the intelligent design of wireless communication systems for various services. Recent mechanisms to model channel…
We study the performance of diffusion least-mean-square algorithms for distributed parameter estimation in multi-agent networks when nodes exchange information over wireless communication links. Wireless channel impairments, such as fading…
In this paper, we investigate resource allocation strategies for a point-to-point wireless communications system with hybrid energy sources consisting of an energy harvester and a conventional energy source. In particular, as an incentive…
We consider a noncoherent wireless network, where the transmitters and receivers are cognizant of the statistics of the fading coefficients, but are ignorant of their realizations. We demonstrate that if the nodes do not cooperate, if they…
We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where both the compression and transmission operations consume power.…
This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…
The rapid growth of data volume and the accompanying congestion problems over the wireless networks have been critical issues to content providers. A novel technique, termed as coded cache, is proposed to relieve the burden. Through…
In distributed wireless networks, nodes often do not know the topology (network size, connectivity and the channel gains) of the network. Thus, they have to compute their transmission and reception parameters in a distributed fashion. In…
We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…
We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…
In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…