相关论文: On the Capacity of the Slotted Strongly Asynchrono…

We analyze the asymptotic average and effective throughputs of a multiuser diversity scheme for a secondary multiuser network consisting of multiple secondary users (transmitters) and one secondary receiver. Considering a transmit power…

We consider framed slotted Aloha where $m$ base stations cooperate to decode messages from $n$ users. Users and base stations are placed uniformly at random over an area. At each frame, each user sends multiple replicas of its packet…

This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…

This paper considers the asymptotic behavior of two-source block-fading single-antenna Gaussian interference channels in the high-SNR regime by means of the diversity-multiplexing tradeoff. We consider a general setting where the users and…

This paper considers the massive random access problem in MIMO quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum energy-per-bit required for each active user to transmit $J$ bits…

We investigate the trade-off between controllability, channel access, and age-related performance in a wireless network of control systems. Controllers share a random-access channel to transmit control inputs to actuators over slotted…

We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving…

This paper studies a bursty interference channel, where the presence/absence of interference is modeled by a block-i.i.d.\ Bernoulli process that stays constant for a duration of $T$ symbols (referred to as coherence block) and then changes…

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…

Time-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and forwarded to the controller. Bounding the aggregate…

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as {\em many-user…

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

A sender wishes to broadcast a message of length $n$ over an alphabet to $r$ users, where each user $i$, $1 \leq i \leq r$ should be able to receive one of $m_i$ possible messages. The broadcast channel has noise for each of the users…

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast…

The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infrequently at random times at the transmitter. Furthermore, it…

This paper considers the slotted ALOHA protocol in a communication channel shared by N users. It is assumed that the channel has the multiple-packet reception (MPR) capability that allows the correct reception of up to M ($1 \leq M < N$)…

We study the maximal achievable rate R*(n, \epsilon) for a given block-length n and block error probability \epsilon over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that…