Finite Blocklength Research Articles

On Optimization of RIS-Assisted Secure UAV-NOMA Communications with Finite Blocklength

On Optimization of RIS-Assisted Secure UAV-NOMA Communications with Finite Blocklength

Trajectory design of UAV-aided energy-harvesting relay networks in the terahertz band

Unmanned aerial vehicle (UAV)-aided relaying benefits from easy deployment, strong communication channels, and mobility compared with traditional ground relaying, thereby enhancing the wireless connectivity of future industrial Internet of Things networks. In this paper, a UAV-assisted relay network capable of harvesting energy from a source is designed by exploiting the radio frequency band and transmitting information between the transmitter and corresponding receiver utilizing the terahertz (THz) band. Subsequently, the channel capacity is analytically derived using the finite blocklength theorem for THz communication. In addition, we formulate an optimization problem to determine the optimal location of the UAV to maintain the minimum channel capacity between the transmitter and receiver pair. To determine the optimal location, we employ the augmented Lagrange multiplier approach. Regarding the optimal location, we propose an algorithm for two UAV trajectories, namely forward and backward trajectories, that employs modified minimal jerk trajectories. The numerical results indicate that the backward trajectory provides better system performance in terms of channel capacity. Moreover, the simulation findings show that in urban, dense urban, and high-rise areas, the backward trajectory improves upon the forward trajectory by approximately 41.07%, 59.02%, and 76.47%, respectively, while using a blocklength of 400 bytes.

Decoupling by Local Random Unitaries without Simultaneous Smoothing, and Applications to Multi-user Quantum Information Tasks

We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users via local actions. Employing both old (Dupuis et al. in Commun Math Phys 328:251–284, 2014) and new methods (Dupuis in IEEE Trans Inf Theory 69:7784–7792, 2023), we obtain bounds on the expected deviation from ideal decoupling either in the one-shot setting in terms of smooth min-entropies, or the finite block length setting in terms of Rényi entropies. These bounds are essentially optimal without the need to address the simultaneous smoothing conjecture, which remains unresolved. This leads to one-shot, finite block length, and asymptotic achievability results for several tasks in quantum Shannon theory, including local randomness extraction of multiple parties, multi-party assisted entanglement concentration, multi-party quantum state merging, and quantum coding for the quantum multiple access channel. Because of the one-shot nature of our protocols, we obtain achievability results without the need for time-sharing, which at the same time leads to easy proofs of the asymptotic coding theorems. We show that our one-shot decoupling bounds furthermore yield achievable rates (so far only conjectured) for all four tasks in compound settings, which are additionally optimal for entanglement of assistance and state merging.

Massive MIMO Multicasting With Finite Blocklength

Massive MIMO Multicasting With Finite Blocklength

Minimum BLER NOMA Design With Finite Blocklength

Minimum BLER NOMA Design With Finite Blocklength

Covert Communications for Text Semantic With Finite Blocklength

Covert Communications for Text Semantic With Finite Blocklength

Finite Block Length NOMA MU Pairing UAV-Enable System: Performance Analysis and Optimization

Finite Block Length NOMA MU Pairing UAV-Enable System: Performance Analysis and Optimization

Performance Analysis of Finite Blocklength Transmissions Over Wiretap Fading Channels: An Average Information Leakage Perspective

Performance Analysis of Finite Blocklength Transmissions Over Wiretap Fading Channels: An Average Information Leakage Perspective

Covert Communications With a Full-Duplex Receiver in the Finite Blocklength Regime: Analysis and Optimization

Covert Communications With a Full-Duplex Receiver in the Finite Blocklength Regime: Analysis and Optimization

Ultra-Reliable and Low-Latency Wireless Hierarchical Federated Learning: Performance Analysis.

Wireless hierarchical federated learning (WHFL) is an implementation of wireless federated Learning (WFL) on a cloud-edge-client hierarchical architecture that accelerates model training and achieves more favorable trade-offs between communication and computation. However, due to the broadcast nature of wireless communication, the WHFL is susceptible to eavesdropping during the training process. Apart from this, recently ultra-reliable and low-latency communication (URLLC) has received much attention since it serves as a critical communication service in current 5G and upcoming 6G, and this motivates us to study the URLLC-WHFL in the presence of physical layer security (PLS) issue. In this paper, we propose a secure finite block-length (FBL) approach for the multi-antenna URLLC-WHFL, and characterize the relationship between privacy, utility, and PLS of the proposed scheme. Simulation results show that when the eavesdropper's CSI is perfectly known by the edge server, our proposed FBL approach not only almost achieves perfect secrecy but also does not affect learning performance, and further shows the robustness of our schemes against imperfect CSI of the eavesdropper's channel. This paper provides a new method for the URLLC-WHFL in the presence of PLS.

Security-aware energy-efficient design for mobile edge computing network operating with finite blocklength codes

Energy efficiency and physical-layer security are crucial considerations in the advancement of mobile edge computing systems. This paper addresses the trade-off between secure-reliability and energy consumption in finite blocklength (FBL) communications. Specifically, we examine a three-node scenario involving a user, a legitimate edge computing server, and an eavesdropper, where the user offloads sensitive data to the edge server while facing potential eavesdropping threats. We propose an optimization framework aimed at minimizing energy consumption while ensuring secure-reliability by decomposing the problem into manageable subproblems. By demonstrating the convexity of the objective function concerning the variables, we establish the existence of an optimal parameter selection for the problem. This implies that practical optimization of parameters can significantly enhance system performance. Our numerical results demonstrate that the application of FBL regime and retransmission mechanism can effectively reduce the energy consumption of the system while ensuring secure-reliability. For the quantitative analyses, the retransmission mechanism is 33.1% better than no retransmission, and the FBL regime is 13.1% better than infinite blocklength (IBL) coding.

Joint Optimization of User Scheduling, Rate Allocation, and Beamforming for RSMA Finite Blocklength Transmission

Joint Optimization of User Scheduling, Rate Allocation, and Beamforming for RSMA Finite Blocklength Transmission

Energy-Efficient Optimization in User-Centric Cell-Free Massive MIMO Systems for URLLC With Finite Blocklength Communications

Energy-Efficient Optimization in User-Centric Cell-Free Massive MIMO Systems for URLLC With Finite Blocklength Communications

Dynamic Framing and Power Allocation for Real-Time Wireless Networks with Variable-Length Coding: A Tandem Queue Approach

Ensuring high reliability and low latency poses challenges for numerous applications that require rigid performance guarantees, such as industrial automation and autonomous vehicles. Our research primarily concentrates on addressing the real-time requirements of ultra-reliable low-latency communication (URLLC). Specifically, we tackle the challenge of hard delay constraints in real-time transmission systems, overcoming this obstacle through a finite blocklength coding scheme. In the physical layer, we encode randomly arriving packets using a variable-length coding scheme and transmit the encoded symbols by truncated channel inversion over parallel channels. In the network layer, we model the encoding and transmission processes as tandem queues. These queues backlog the data bits waiting to be encoded and the encoded symbols to be transmitted, respectively. This way, we represent the system as a two-dimensional Markov chain. By focusing on instances when the symbol queue is empty, we simplify the Markov chain into a one-dimensional Markov chain, with the packet queue being the system state. This approach allows us to analytically express power consumption and formulate a power minimization problem under hard delay constraints. Finally, we propose a heuristic algorithm to solve the problem and provide an extensive evaluation of the trade-offs between the hard delay constraint and power consumption.

Evaluating energy harvesting UAV-NOMA network with random user pairing in the finite blocklength regime

This study proposes an integrated system that combines energy harvesting (EH) enabled unmanned aerial vehicles (UAVs) with non-orthogonal multiple access (NOMA) to enhance communication system performance within a cellular network. Addressing the limitations of existing analyses that often assume an infinite blocklength scenario, we explore EH-enabled UAV-NOMA systems within a cellular framework under a finite blocklength (FBL) scenario. The study investigates the complex interactions and advantages resulting from the integration of EH, NOMA, and UAV technologies, aiming to assess whether EH can sustain communication within this framework. The network model considers base stations (BSs), UAVs, and terrestrial devices distributed with independent Poisson point processes (PPPs) over a large area. In this network, BSs employ NOMA to serve cell center devices directly, while cell edge devices, which are nor in direct contact with BS, are served via simultaneous wireless information and power transfer (SWIPT) enabled UAVs. The study derives metrics including joint harvesting and decoding probability for a randomly selected UAV, coverage probability (CP) for cell devices, and end-to-end block error rate (BLER) probabilities for typical device pairs. The findings demonstrate that the proposed scheme effectively supplies all the necessary transmit power for communication purposes through EH, achieving reasonable reliability. Additionally, the study highlights the importance of considering a combination of blocklengths from different phases to achieve optimal performance, rather than solely relying on an increment in blocklength. Finally, the effects of parameter variations on network performance are examined.

Energy-Harvesting-Enabled UAV Relay-Assisted NOMA Network Under Finite Blocklength

Energy-Harvesting-Enabled UAV Relay-Assisted NOMA Network Under Finite Blocklength

Freshness-in-air: An AoI-inspired UAV-assisted wireless sensor networks

The Age-of-Information (AoI) metric has emerged as a performance measurement metric for evaluating time-sensitive wireless communications systems. Maintaining the freshness and reliability of data is critical in time-critical wireless networks, where outdated information can have significant consequences. Moreover, short packet transmissions are used in wireless sensor networks (WSNs) to maintain energy efficiency and low latency. This paper proposes a theoretical model that utilizes the AoI metric and finite block length information theory to estimate information freshness in an unmanned aerial vehicle (UAV)-assisted WSN. This network includes multiple sensing nodes and relies on short-packet communication for transmission. In this paper, closed-form expressions for average AoI (AAoI) and the block error rate are derived. Furthermore, the optimal altitude and block length that ensures the freshness of received information at the destination is determined. The results of the analysis provide valuable insights into the performance characteristics of UAV-assisted WSNs and have important implications for the design and optimization of such systems.

Rate-Splitting Multiple Access With Finite Blocklength and High Mobility for URLLC Transmissions

Rate-Splitting Multiple Access With Finite Blocklength and High Mobility for URLLC Transmissions

Rate Outage and Meta-Distribution for Uplink Networks in Finite Block-Length Regime

Rate Outage and Meta-Distribution for Uplink Networks in Finite Block-Length Regime

Gaussian Broadcast Channels With Heterogeneous Finite Blocklength Constraints: Inner and Outer Bounds

Gaussian Broadcast Channels With Heterogeneous Finite Blocklength Constraints: Inner and Outer Bounds