This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output fading channels, with without channel state information at transmitter and/or receiver. The principal finding is that outage capacity, despite being an asymptotic quantity, sharp proxy finite-blocklength fundamental limits of slow-fading channels. Specifically, dispersion shown to be zero regardless whether realizations are available both...

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate tradeoff between reliability, throughput, and latency transmission of information over multiple-antenna Rayleigh block-fading channels. Specifically, obtain finite-blocklength, finite-SNR upper lower bounds on maximum coding rate achievable such channels for a given constraint packet error probability. Numerical evidence suggests that our delimit tightly already short...

Multiple access technology played an important role in wireless communication the last decades: it increases capacity of channel and allows different users to system simultaneously. However, conventional multiple technology, as originally designed for current human-centric networks, is not scalable future machine-centric networks. Massive (studied literature under such names "massive- device access," "unsourced massive random "massive connectivity," machine-type communication," "many-access...

We characterize the capacity of Rayleigh block-fading multiple-input multiple-output (MIMO) channels in noncoherent setting where transmitter and receiver have no a priori knowledge realizations fading channel. prove that unitary space-time modulation (USTM) is not capacity-achieving high signal-to-noise ratio (SNR) regime when total number antennas exceeds coherence time channel (expressed multiples symbol duration), situation relevant for MIMO systems with large antenna arrays (large-MIMO...

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at given blocklength. New achievability converse bounds are derived, which uniformly tighter than existing bounds, lead tightest on second-order coding for discrete memoryless Gaussian channels. The exact is established semi-deterministic channels, characterizes optimal tradeoff between in finite-blocklength regime. Underlying our two new privacy amplification...

We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on channel gains, it is shown that dispersion zero regardless of whether realizations are available at transmitter and/or receiver. The result follows from computationally analytically tractable converse achievability bounds. Through numerical evaluation, we verify that, in some scenarios, indeed entails fast...

In this paper, we investigate the mean field games with $K$ classes of agents who are weakly coupled via empirical measure. The underlying dynamics representative is assumed to be a controlled nonlinear Markov process associated rather general integro-differential generators Lévy-Khintchine type (with variable coefficients). We show that measure-valued kinetic equations describing dynamic law large numbers limit for system number N solvable and their solutions represent 1/N-Nash equilibria...

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and constraints at given blocklength. New achievability converse bounds are derived, which shown be tighter than existing bounds. The also lead tightest second-order coding for discrete memoryless Gaussian channels.

This paper investigates the maximal channel coding rate achievable at a given blocklength n and error probability ϵ, when codewords are subjected to long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in large-n expansion of is characterized both for additive white Gaussian noise (AWGN) channels quasi-static fading with perfect state information available transmitter receiver. It shown that cases, proportional (n <sup...

We study the maximal achievable rate R*(n, ∈) for a given block-length n and block error probability o over Rayleigh block-fading channels in noncoherent setting finite regime. Our results show that probability, is not monotonic channel's coherence time, but there exists maximizing time optimally trades between diversity cost of estimating channel.

We find the capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel in noncoherent setting. It is well known that for block-length <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> and rank covariance matrix equal to xmlns:xlink="http://www.w3.org/1999/xlink">Q</i> , single-output (SISO) case given by 1- / . Here, can be interpreted as penalty incurred uncertainty. Our main result reveals...

This paper considers the massive random access problem in multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on minimum energy-per-bit required for each active user to transmit <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$J$ </tex-math></inline-formula> bits with blocklength notation="LaTeX">$n$ , power...

The fifth generation (5G) new radio (NR) of mobile communications is designed to support two major class services with vastly heterogeneous requirements: ultra-reliable low-latency communication (URLLC) and enhanced broadband (eMBB). To enable the coexistence URLLC eMBB in same spectrum a cost-effective manner while guaranteeing latency reliability performance URLLC, 5G NR has developed an innovative preemption superposition framework which allows dynamic multiplexing interleaved manner. In...

This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which channel between transmitter and legitimate receiver is deterministic, while that eavesdropper discrete memoryless channel. For given decoding error probability information leakage (measured by total variation distance), optimal second-order derived. Unlike capacity, characterizes tradeoff reliability at finite blocklength.

We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for setup where a priori channel state information is not available. The bound relies dual formula assumption that users can cooperate perfectly. derived assuming noncooperative scenario, each user employs unitary space-time modulation (independently from other users). Numerical results show gap between small already at moderate SNR values. This suggests gains obtainable...

Heterogeneous Networks (HetNets) has attracted considerable attention since they can improve the system capacity and user throughput in Long Term Evolution (LTE)-Advanced system. However, due to different coverage sizes for macro eNodeB (eNB) pico eNB, handover performance of UE will be impacted especially when equipment (UE) moves medium or high speed HetNets. Three metrics are agreed 3GPP RAN WG2 evaluate performance: radio link failure (RLF) rate, (HOF) short time stay (short ToS). In...

The emerging Internet of Things (IoT) has several salient characteristics that differentiate it from existing wireless networking architectures. These include the deployment very large numbers (possibly) low-complexity terminals; need for low-latency, short-packet communications (e.g., to support automation); light or no infrastructure; and primary applications data gathering, inference control. have motivated development new fundamentals can provide insights into limits communication in...

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds maximum channel coding rate multiple-antenna block-memoryless Rayleigh-fading channels. The in this paper allow one to numerically assess for which packet size, number antennas, and degree selectivity, diversity-exploiting schemes are close optimal, when instead available spatial degrees freedom should be used provide multiplexing. This blocklength view provides insights design...

In this paper, a reliable and energy-efficient routing (RER) protocol is proposed for underwater acoustic sensor networks to enhance the communication reliability. route discovery phase of method, node with minimum packet transmission delay current selected as its next hop node. After set up, other nodes in network will also send packets sink through already established route, which greatly reduces amount time energies spent build new packets. As result, real-time data arrive at destination...

It is well known that the mutual information between two random variables can be expressed as difference of relative entropies depend on an auxiliary distribution, a relation sometimes referred to golden formula. This paper concerned with finite-blocklength extension this relation. consists elements: 1) finiteblocklength channel-coding converse bound by Polyanskiy and Verdú, which involves ratio Neyman-Pearson β functions (beta-beta bound); 2) novel beta-beta achievability bound, again...

In this paper, a cooperative transmission scheme is proposed for underwater acoustic sensor networks to enhance the communication reliability. Based on distinct characteristics of channel, such as high loss, propagation delay, and ambient noises, paper presents relay scheme, including networking protocol at physical layer reliability through intermediate node. The selected from set neighbor nodes based distance channel conditions. transmissions ACK-I ACK-II in consecutive phases...

This paper proposes a resource allocation policy which enhances physical layer security in vehicular communication networks. Due to the high mobility networks, feedback channel state information (CSI) can easily get outdated, especially when it takes non-negligible time obtain resource-allocation solution. Under assumption that only outdated CSI is available, we formulate problem as joint power and subcarrier order optimize uses' secrecy rate based on maximum-minimum (max-min) fairness...

This paper investigates the maximal channel coding rate achievable at a given blocklength n and error probability ε, when codewords are subject to long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in large-n expansion of is characterized both for AWGN channels quasi-static fading with perfect state information transmitter receiver. It shown that cases proportional √(log n)/n.