This paper investigates two distinct types of block errors - undetected errors (confusions) and erasures - in additive white Gaussian noise (AWGN) channels with error-bounded block decoders operating in the finite blocklength (FBL) regime. While block error rate (BLER) is a common metric, it does not distinguish between confusions and erasures, which can have significantly different impacts in cross-layer protocol design, despite upper-layer protocols universally assuming physical (PHY) errors manifest as packet erasures rather than undetected corruptions - an assumption lacking rigorous PHY-layer validation. We present a systematic analysis of confusions and erasures under BLER-constrained maximum likelihood (ML) decoding. Through sphere-packing analysis, we provide analytical bounds for both block confusion and erasure probabilities, and derive the sensitivities of these bounds to blocklength and signal-to-noise ratio (SNR). To the best of our knowledge, this is the first study on this topic in the FBL regime. Our findings provide theoretical validation for the block erasure channel abstraction commonly assumed in medium access control (MAC) and network layer protocols, confirming that, for practical FBL codes, block confusions are negligible compared to block erasures, especially at large blocklengths and high SNR.

The technological landscape is rapidly evolving toward large-scale systems. Networks supporting massive connectivity through numerous Internet of Things (IoT) devices are at the forefront of this advancement. In this paper, we examine Wireless Power Transfer (WPT)-enabled networks, where a server requires to collect data from these IoT devices to compute a task with massive Ultra-Reliable and Low-Latency Communication (mURLLC) services. We focus on information freshness, using Age-of-Information (AoI) as the key performance metric. Specifically, we aim to minimize the maximum AoI among IoT devices by optimizing the scheduling policy. Our analytical findings demonstrate the convexity of the problem, enabling efficient solutions. We introduce the concept of AoI-oriented cluster capacity and analyze the relationship between the number of supported devices and network AoI performance. Numerical simulations validate our proposed approach's effectiveness in enhancing AoI performance, highlighting its potential for guiding the design of future IoT systems requiring mURLLC services.

The extreme requirements for high reliability and low latency in the upcoming Sixth Generation (6G) wireless networks are challenging the design of multi-hop wireless transport networks. Inspired by the advent of the virtualization concept in the wireless networks design andopennessparadigm as fostered by the Open-Radio Access Network (O-RAN) Alliance, we target a revolutionary resource allocation scheme to improve the overall transmission efficiency. In this paper, we investigate the problem of automatic repeat request (ARQ) in multi-hop decode-and-forward (DF) relaying in the finite blocklength (FBL) regime, and propose a dynamic scheme of multi-hop hybrid ARQ (HARQ), which maximizes the end-to-end (E2E) communication reliability in the wireless transport network.We also propose an integer dynamic programming (DP) algorithm to efficiently solve the optimal Dynamic Multi-Hop HARQ (DMH-HARQ) strategy. Constrained within a certain time frame to accomplish E2E transmission, our proposed approach is proven to outperform the conventional listening-based cooperative ARQ, as well as any static HARQ strategy, regarding the E2E reliability. It is applicable without dependence on special delay constraint, and is particularly competitive for long-distance transport network with many hops.

This paper proposes a dynamic epidemic model for successive opinion diffusion in social networks, extending the SHIMR model. It incorporates dynamic decision-making influenced by social distances and captures accumulative opinion diffusion caused by interrelated rumors. The model reflects the impact of rumor spread on social network structures. Simulations validate its effectiveness in explaining phenomena like the echo chamber effect and provide insights into opinion diffusion dynamics, with implications for understanding social polarization and network evolution.

Physical layer deception (PLD) is a novel security mechanism that combines physical layer security (PLS) with deception technologies to actively defend against eavesdroppers. In this paper, we establish a novel semantic model for PLD that evaluates its performance in terms of semantic distortion. By analyzing semantic distortion at varying levels of knowledge on the receiver's part regarding the key, we derive the receiver's optimal decryption strategy, and consequently, the transmitter's optimal deception strategy. The proposed semantic model provides a more generic understanding of the PLD approach independent from coding or multiplexing schemes, and allows for efficient real-time adaptation to fading channels.

Unauthorized sensing activities pose an increasing threat to individual privacy, yet effective countermeasures remain underdeveloped. This paper presents a novel methodology to characterize and counter such unauthorized surveillance. We model pedestrian trajectories as a random process and leverage the Cramér-Rao bound (CRB) to evaluate sensing performance, interpreting it as sampling error within this random process. Through simulation, we verify our method’s accuracy in monitoring unauthorized sensing activities in urban environments and validate the effectiveness of our proposed mitigation strategies.

Physical layer security (PLS) is a promising technology to secure wireless communications by exploiting the physical properties of the wireless channel. However, the passive nature of PLS creates a significant imbalance between the effort required by eavesdroppers and legitimate users to secure data. To address this imbalance, in this article, we propose a novel framework of physical layer deception (PLD), which combines PLS with deception technologies to actively counteract wiretapping attempts. Combining a two-stage encoder with randomized ciphering and non-orthogonal multiplexing, the PLD approach enables the wireless communication system to proactively counter eavesdroppers with deceptive messages. Relying solely on the superiority of the legitimate channel over the eavesdropping channel, the PLD framework can effectively protect the confidentiality of the transmitted messages, even against eavesdroppers who possess knowledge equivalent to that of the legitimate receiver. We prove the validity of the PLD framework with in-depth analyses and demonstrate its superiority over conventional PLS approaches with comprehensive numerical benchmarks.

Federated learning (FL) offers a privacy-preserving collaborative approach for training models in wireless networks, with channel estimation emerging as a promising application. Despite extensive studies on FL-empowered channel estimation, the security concerns associated with FL require meticulous attention. In a scenario where small base stations (SBSs) serve as local models trained on cached data, and a macro base station (MBS) functions as the global model setting, an attacker can exploit the vulnerability of FL, launching attacks with various adversarial attacks or deployment tactics. In this paper, we analyze such vulnerabilities, corresponding solutions were brought forth, and validated through simulation.

Unmanned aerial vehicles (UAVs) are well-suited to localize jammers, particularly when jammers are at non-terrestrial locations, where conventional detection methods face challenges. In this work we propose a novel localization method, sample pruning gradient descend (SPGD), which offers robust performance against multiple power-modulated jammers with low computational complexity.

Unmanned aerial vehicle (UAV) is becoming increasingly important in modern civilian and military applications. However, its novel use cases is bottlenecked by conventional satellite and terrestrial localization technologies, and calling for complementary solutions. Multi-UAV mutual positioning can be a potential answer, but its accuracy and security are challenged by inaccurate and/or malicious measurements. This paper proposes a novel, robust, and secure approach to address these issues.

Enabled by the emerging industrial agent (IA) technology, swarm intelligence (SI) is envisaged to play an important role in future industrial Internet of Things (IIoT) that is shaped by Sixth Generation (6G) mobile communications and digital twin (DT). However, its fragility against data injection attack may halt it from practical deployment. In this paper we propose an efficient trust approach to address this security concern for SI.

This paper presents a robust and secure framework for achieving accurate and reliable mutual localization in multiple unmanned aerial vehicle (UAV) systems. Challenges of accurate localization and security threats are addressed and corresponding solutions are brought forth and accessed in our paper with numerical simulations. The proposed solution incorporates two key components: the Mobility Adaptive Gradient Descent (MAGD) and Time-evolving Anomaly Detectio (TAD). The MAGD adapts the gradient descent algorithm to handle the configuration changes in the mutual localization system, ensuring accurate localization in dynamic scenarios. The TAD cooperates with reputation propagation (RP) scheme to detect and mitigate potential attacks by identifying UAVs with malicious data, enhancing the security and resilience of the mutual localization.

Multi-access edge computing (MEC) emerges as an essential part of the upcoming Fifth Generation (5G) and future beyond-5G mobile communication systems. It adds computational power towards the edge of cellular networks, much closer to energy-constrained user devices, and therewith allows the users to offload tasks to the edge computing nodes for low-latency applications with very-limited battery consumption. However, due to the high dynamics of user demand and server load, task congestion may occur at the edge nodes resulting in long queuing delay. Such delays can significantly degrade the quality of experience (QoE) of some latency-sensitive applications, raise the risk of service outage, and cannot be efficiently resolved by conventional queue management solutions. In this article, we study a latency-outage critical scenario, where users intend to limit the risk of latency outage. We propose an impatience-based queuing strategy for such users to intelligently choose between MEC offloading and local computation, allowing them to rationally renege from the task queue. The proposed approach is demonstrated by numerical simulations to be efficient for generic service model, when a perfect queue status information is available. For the practical case where the users obtain only imperfect queue status information, we design an optimal online learning strategy to enable its application in Poisson service scenarios.

The next revolution of industry will turn the industries as well as the entire society into a human-centric shape. The human presence in industrial environment and the human participation in industrial processes will be magnified more than ever before. To cope with the emerging challenges raised by this revolution, 6G ambitions to bridge the three domains of digital information, physical assets and humans into one merged cyber-physical-human world. This proposes not only an unprecedented demand for digital twin solutions, but also new technical requirements. Especially, aiming at a human-centric industrial DT system, novel multi-sensory human-machine interfaces will play a key role in this paradigm shift.

As a complement to conventional AI solutions, emergent intelligence (EI) exhibits competitiveness in 6G IIoT scenario for its various outstanding features including robustness, protection to privacy, and scalability. However, despite the low computational complexity, EI is challenged by its high demand of data traffic in massive deployment. We propose to leverage massive twinning, which 6G is envisaged to support, to reduce the data traffic in EI and therewith enhance its performance.

The increasing demand for road freight has raised tremendous attention to vehicle platooning, which reduces air resistance and improves fuel economy. To achieve a small and safe spacing between vehicles while ensuring platoon stability, wireless communication assistance is indispensable. However, the imperfection of communication brings degradation of platooning performance (i.e., spacing error) and more possibilities for adversarial attacks. This article proposes a prediction-assisted platooning mechanism from the perspective of performance optimization, wherein each vehicle establishes its local platoon model based on the information received from the communication network, thereby reducing information latency. Then, to secure the system against malicious vehicles, we carry out analysis and design of a detection algorithm for a typical attack type, i.e., the data-injection attack. The detection is based on three indicators: 1) absolute spacing error; 2) spacing prediction error; and 3) acceleration prediction error. The advantages of the novel platooning mechanism and detection algorithm are ultimately demonstrated on a road-traffic simulation platform that considers the imperfection of realistic vehicle perceptions and Cellular-Vehicle-to-Everything (C-V2X) communication.

In this work, we study an energy harvesting (EH)-enabled low-latency communication network where a full-duplex server continuously performs wireless power transfer (WPT) to a half-duplex sensor. The sensor is designed to operate periodically in each updating round, during which the sensor firstly harvests energy via the WPT process, then collects measurement data and wirelessly transmits an update to the server based on the harvested energy. We assume that no energy can be reserved at the end of each round, due to the deployed capacitor-structured energy container. Leveraging the recent characterization on the error probability in the finite blocklength (FBL) regime, we derive the average Age-of-Information (AoI) in the considered network and construct a problem minimizing the average AoI via optimizing the duration of the updating round. The convexity of the optimization problem is shown, following which an efficient optimal solution is provided. At last, via Monte Carlo simulations, the convexity of the problem can also be visualised, and the average AoI performance of the network is evaluated.

It is becoming increasingly clear that an important task for wireless networks is to minimize the age of information (AoI), i.e., the timeliness of information delivery. While mainstream approaches generally rely on the real-time observation of user AoI and channel state, there has been little attention to solve the problem in a complete (or partial) absence of such knowledge. In this article, we present a novel study to address the optimal blind radio resource scheduling problem in orthogonal frequency division multiplexing access (OFDMA) systems towards minimizing long-term average AoI, which is proven to be the composition of time-domain-fair clustered round-robin and frequency-domain-fair intra-cluster sub-carrier assignment. Heuristic solutions that are near-optimal as shown by simulation results are also proposed to effectively improve the performance upon presence of various degrees of extra knowledge, e.g., channel state and AoI.

The combination of recent emerging technologies such as network function virtualization (NFV) and network programmability (SDN) gave birth to the novel Network Slicing paradigm. 5G networks consist of multi-tenant infrastructures capable of offering leased network “slices” to new customers (e.g., vertical industries) enabling a new telecom business model: Slice-as-a-Service (SlaaS). However, as the service demand gets increasingly dense, slice requests congestion may occur leading to undesired waiting periods. This may turn into impatient tenant behaviors that increase potential loss of the business attractiveness to customers. In this paper, we aim to: 1) study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests; 2) derive its statistical behavior model; 3) find out the rational strategy of impatient tenants waiting in queue-based slice admission control systems; 4) prove mathematically and empirically the benefits of allowing infrastructure providers to share its information with the upcoming tenants; and 5) provide a utility model for network slices admission optimization. Our results analyze the capability of the proposed SlaaS system to be approximately Markovian and evaluate its performance as compared to a baseline solution.

The combination of recent emerging technologies such as network function virtualization (NFV) and network programmability (SDN) gave birth to the Network Slicing revolution. 5G networks consist of multi-tenant infrastructures capable of offering leased network “slices” to new customers (e.g., vertical industries) enabling a new telecom business model: Slice-as-a-Service (SlaaS). In this paper, we aim i) to study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests, ii) to derive its statistical behavior model, and iii) to provide a utility-based admission control optimization. Our results analyze the capability of the proposed SlaaS system to be approximately Markovian and evaluate its performance as compared to legacy solutions.

Impulsive noises widely existing in various channels can significantly degrade the performance and reliability of communication systems. The Bernoulli- Gaussian (BG) model is practical to characterize noises in this category. To estimate the BG model parameters from noise measurements, a precise impulse detection is essential. In this paper, we propose a novel blind impulse detector, which is proven to be fast and accurate for BG noise in underspread communication channels.

As the next generation of wireless system targets at providing a wider range of services with divergent QoS requirements, new applications will be enabled by the fifth generation (5G) network. Among the emerging applications, vehicle-to-everything (V2X) communication is an important use case targeted by 5G to enable an improved traffic safety and traffic efficiency. Since the V2X communication requires a low end-to-end (E2E) latency and an ultra-high reliability, the legacy cellular networks can not meet the service requirement. In this work, we inspect on the system performance of applying the LTE-Uu and PC5 interfaces to enable the V2X communication. With the LTE-Uu interface, one V2X data packet is transmitted through the cellular network infrastructure, while the PC5 interface facilitates the direct V2X communication without involving the network infrastructure in user-plane. In addition, due to the high reliability requirement, the application of a single V2X transmission technology can not meet the targets in some scenarios. Therefore, we also propose a multi-radio access technologies (multi-RATs) scheme where the data packet travels through both the LTE-Uu and PC5 interfaces to obtain a diversity gain. Last but not least, in order to derive the system performance, a system level simulator is implemented in this work. The numerical results provide us insights on how the different technologies will perform in different scenarios and also validate the proposed multi-RATs scheme.

Massive Machine-Type Communication (mMTC) is expected to be strongly supported by future 5G wireless networks. Its deployment, however, is seriously challenged by the high risk of random access (RA) collision. A popular concept is to reduce RA collisions by clustering mMTC devices into groups, and to connect group members with device-to-device (D2D) links. However, analytical models of this method and discussions about the reliability of D2D links are still absent. In this paper, existing grouping-based solutions are reviewed, an analytical model of grouped RA collision is proposed. Based on the analytical model, the impact of D2D reliability on the collision rate is also investigated. Afterwards, an efficient grouped RA procedure is designed to extend the state-of-the-art with an efficient local group update mechanism against D2D link exceptions.

The core innovation in future 5G cellular networks-network slicing, aims at providing a flexible and efficient framework of network organization and resource management. The revolutionary network architecture based on slices, makes most of the current network cost models obsolete, as they estimate the expenditures in a static manner. In this paper, a novel methodology is proposed, in which a value chain in sliced networks is presented. Based on the proposed value chain, the profits generated by different slices are analyzed, and the task of network resource management is modeled as a multi-objective optimization problem. Setting strong assumptions, this optimization problem is analyzed starting from a simple ideal scenario. By removing the assumptions step-by-step, realistic but complex use cases are approached. Through this progressive analysis, technical challenges in slice implementation and network optimization are investigated under different scenarios. For each challenge, some potentially available solutions are suggested, and likely applications are also discussed.

Narrowband noise (NBN) and periodic impulsive noise (PIN) are two of the most disturbing interferers in low-voltage (LV) power line communication (PLC). They exist commonly in different scenarios and degrade the performance of PLC systems significantly. Accurate estimation of the NBN and the PIN are important for the power line channel characterization and can help improve the quality of service (QoS). In contrast to other noise classes, both NBN and PIN may exhibit strong cyclic behaviors. In this work, the cyclic properties of both of them are investigated. Based on the results, an universal algorithm is developed to detect and cancel narrowband and periodic impulsive components from PLC signals. The proposed method is executed purely on the physical layer and does not require specialized hardware. Its performance is verified through simulations and real measurements.