Related papers: Reliable Throughput of Generalized Collision Chann…
Protocol sequences are binary and periodic sequences used for deterministic multiple access in a collision channel without feedback. In this paper, we focus on user-irrepressible (UI) protocol sequences that can guarantee a positive…
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…
We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…
In these series of multi-part papers, a systematic study of fundamental limits of communications in interference networks is established. Here, interference network is referred to as a general single-hop communication scenario with…
We consider transmission of packets over queue-length sensitive unreliable links, where packets are randomly corrupted through a noisy channel whose transition probabilities are modulated by the queue-length. The goal is to characterize the…
We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…
This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…
Relay-based cooperative communication has become a research focus in recent years because it can achieve diversity gain in wireless networks. In existing works, network coding and two-path relay are adopted to deal with the increase of…
We study the interference channel with a signal cognitive relay. A signal cognitive relay knows the transmit signals (but not the messages) of the sources non-causally, and tries to help them communicating with their respective…
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…
This work considers secure transmission protocol for flexible load-balance control in two-hop relay wireless networks without the information of both eavesdropper channels and locations. The available secure transmission protocols via relay…
This paper analyzes the multiplexing gains (MG) for simultaneous transmission of delay-sensitive and delay-tolerant data over interference networks. In the considered model, only delay-tolerant data can profit from coordinated multipoint…
Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions…
Achieving secure communications in networks has been one of the most important problems in information technology. Dolev, Dwork, Waarts, and Yung have studied secure message transmission in one-way or two-way channels. They only consider…
In ALOHA-type packetized network, the transmission times of packets follow a stochastic process. In this paper, we advocate a deterministic approach for channel multiple-access. Each user is statically assigned a periodic protocol signal,…
We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by…
For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…
An increasing bandwidth demand has mandated a shift to the time and wavelength division multiplexing (TWDM) techniques in optical access networks (OAN). Typical TWDM scheduling schemes consider scheduling of the optical line terminal…
This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…
Covert communication offers a method to transmit messages in such a way that it is not possible to detect that the communication is happening at all. In this work, we report an experimental demonstration of covert communication that is…