arXiv subjects

Naijin Liu

Publications and source records attributed to Naijin Liu.

At least 19 recordsLinked to original sources

arXiv2026

Distributionally Robust Physical-Layer Security for Satellite Communication via Aerial Reconfigurable Intelligent Surface

Satellite communications are envisioned as a key enabler for ubiquitous coverage in future 6G networks, yet the broadcast nature renders them vulnerable to eavesdropping, especially given the long-distance transmissions and associated high uncertainties. In this paper, we propose the physical layer security enhancement for multi-beam satellite communications with the assistance of an aerial reconfigurable intelligent surface (ARIS). Considering the high dynamics and uncertainties of channels, we characterize the channel distribution with moment-based ambiguity sets. Accordingly, a distributionally robust secrecy rate optimization is formulated through joint design of transmit and reflection beamforming. We then introduce a conditional value-at-risk-based reformulation to convert the probabilistic constraints into deterministic forms. An alternating optimization framework is subsequently employed to iteratively update the transmit and reflective beamforming vectors until convergence. Simulation results demonstrate that the proposed distributionally robust scheme significantly enhances secrecy performance, and maintains reliable performance across various channel error distributions.

cs.IT↗

arXiv2026

A Heavy-Load-Enhanced and Changeable-Periodicity-Perceived Workload Prediction Network

Cloud providers can greatly benefit from accurate workload prediction. However, the workload of cloud servers is highly variable, with occasional workload bursts, which makes workload prediction challenging. The time series forecasting methods relying on periodicity information, often assume fixed and known periodicity length, which does not align with the periodicity-changeable nature of cloud service workloads. Although many state-of-the-art time-series forecasting methods do not rely on periodicity information and achieve high overall accuracy, they are vulnerable to data imbalance between heavy workloads and regular workloads. As a result, their prediction accuracy on rare heavy workloads is limited. Unfortunately, heavyload-prediction accuracy is more important than overall one, as errors in heavyload prediction are more likely to cause Service Level Agreement violations than errors in normal-load prediction. Thus, we propose a changeable-periodicity-perceived workload prediction network (PePNet) to fuse periodic information adaptively for periodicity-changeable time series and improve rare heavy workload prediction accuracy. It has two distinctive characteristics: (i) A Periodicity-Perceived Mechanism to detect the periodicity length automatically and fuses periodic information adaptively, which is suitable for periodicity-changeable time series, and (ii) An Achilles' Heel Loss Function that is used to iteratively optimize the most under-fitting part in predicting sequence for each step, thus evidently improving the prediction accuracy of heavy load. Extensive experiments conducted on real-world datasets demonstrate that PePNet improves accuracy for overall workload by 11.8% averagely, compared with state-of-the-art methods. Especially, PePNet improves accuracy for heavy workload by 21.0% averagely.

cs.DC↗

arXiv2025

Secure Satellite Communications via Multiple Aerial RISs: Joint Optimization of Reflection, Association, and Deployment

Satellite communication is envisioned as a key enabler of future 6G networks, yet its wide coverage with high link attenuation poses significant challenges for physical layer security. In this paper, we investigate secure multi-beam, multi-group satellite communications assisted by aerial reconfigurable intelligent surfaces (ARISs). To maximize the sum of achievable multicast rates among the groups while constraining wiretap rates, we formulate a joint optimization problem involving transmission and reflection beamforming, ARIS-group association, and ARIS deployment. Due to the mixed-integral and non-convex nature of the formulated problem, we propose to decompose the problem and employ the block coordinate descent framework that iteratively solves the subproblems. Simulation results demonstrate that the proposed ARIS-assisted multi-beam satellite system provides a notable improvement in secure communication performance under various network scenarios, offering useful insights into the deployment and optimization of intelligent surfaces in future secure satellite networks.

cs.IT↗

arXiv2025

Multiple STAR-RISs-Empowered Multi-User Communications with Diversified QoS Provisioning

This paper proposes a quality-of-service (QoS)-aware multi-user communication framework facilitated by multiple simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs). The user groups are established based on their QoS requirements specified by the minimum data rate, which is provisioned by the optimized transmission and reflection configurations of the STAR-RISs. Particularly, we formulate an optimization problem to maximize the aggregate link rate across all users, under group-specified rate requirements by jointly considering the transmit beamforming and STAR-RIS configurations. Then, we employ the Lagrangian duality with quadratic transformation to tackle the non-convexity of the objective. We decompose the problem within a block coordinate descent framework, and the subproblems are solved through convex approximation and iterated to approach the optimal solution. Simulation results demonstrate the effectiveness of the proposed method in enhancing the system sum rate with guaranteed QoS performance for heterogeneous users, offering valuable insights for the deployment of STAR-RISs in future QoS-aware wireless networks.

eess.SY↗

arXiv2025

Energy-Efficient Integrated Communication and Computation via Non-Terrestrial Networks with Uncertainty Awareness

Non-terrestrial network (NTN)-based integrated communication and computation empowers various emerging applications with global coverage. Yet this vision is severely challenged by the energy issue given the limited energy supply of NTN nodes and the energy-consuming nature of communication and computation. In this paper, we investigate the energy-efficient integrated communication and computation for the ground node data through a NTN, incorporating an unmanned aerial vehicle (UAV) and a satellite. We jointly consider ground data offloading to the UAV, edge processing on the UAV, and the forwarding of results from UAV to satellite, where we particularly address the uncertainties of the UAV-satellite links due to the large distance and high dynamics therein. Accordingly, we propose to minimize the weighted energy consumption due to data offloading, UAV computation, UAV transmission, and UAV propulsion, in the presence of angular uncertainties under Gaussian distribution within the UAV-satellite channels. The formulated problem with probabilistic constraints due to uncertainties is converted into a deterministic form by exploiting the Bernstein-type inequality, which is then solved using a block coordinate descent framework with algorithm design. Simulation results are provided to demonstrate the performance superiority of our proposal in terms of energy sustainability, along with the robustness against uncertain non-terrestrial environments.

eess.SP↗

arXiv2022

Adaptive Task Offloading for Space Missions: A State-Graph-Based Approach

Advances in space exploration have led to an explosion of tasks. Conventionally, these tasks are offloaded to ground servers for enhanced computing capability, or to adjacent low-earth-orbit satellites for reduced transmission delay. However, the overall delay is determined by both computation and transmission costs. The existing offloading schemes, while being highly-optimized for either costs, can be abysmal for the overall performance. The computation-transmission cost dilemma is yet to be solved. In this paper, we propose an adaptive offloading scheme to reduce the overall delay. The core idea is to jointly model and optimize the transmission-computation process over the entire network. Specifically, to represent the computation state migrations, we generalize graph nodes with multiple states. In this way, the joint optimization problem is transformed into a shortest path problem over the state graph. We further provide an extended Dijkstra's algorithm for efficient path finding. Simulation results show that the proposed scheme outperforms the ground and one-hop offloading schemes by up to 37.56% and 39.35% respectively on SpaceCube v2.0.

eess.SP↗

arXiv2022

Computing-Aware Routing for LEO Satellite Networks: A Transmission and Computation Integration Approach

The advancements of remote sensing (RS) pose increasingly high demands on computation and transmission resources. Conventional ground-offloading techniques, which transmit large amounts of raw data to the ground, suffer from poor satellite-to-ground link quality. In addition, existing satellite-offloading techniques, which offload computational tasks to low earth orbit (LEO) satellites located within the visible range of RS satellites for processing, cannot leverage the full computing capability of the network because the computational resources of visible LEO satellites are limited. This situation is even worse in hotspot areas. In this paper, for efficient offloading via LEO satellite networks, we propose a novel computing-aware routing scheme. It fuses the transmission and computation processes and optimizes the overall delay of both. Specifically, we first model the LEO satellite network as a snapshot-free dynamic network, whose nodes and edges both have time-varying weights. By utilizing time-varying network parameters to characterize the network dynamics, the proposed method establishes a continuous-time model which scales well on large networks and improves the accuracy. Next, we propose a computing-aware routing scheme following the model. It processes tasks during the routing process instead of offloading raw data to ground stations, reducing the overall delay and avoiding network congestion consequently. Finally, we formulate the computing-aware routing problem in the dynamic network as a combination of multiple dynamic single source shortest path (DSSSP) problems and propose a genetic algorithm (GA) based method to approximate the results in a reasonable time. Simulation results show that the computing-aware routing scheme decreases the overall delay by up to 78.31% compared with offloading raw data to the ground to process.

cs.NI↗

arXiv2022

Network-Wide Task Offloading With LEO Satellites: A Computation and Transmission Fusion Approach

Computing tasks are ubiquitous in space missions. Conventionally, these tasks are offloaded to ground servers for computation, where the transmission of raw data on satellite-to-ground links severely constrains the performance. To overcome this limitation, recent works offload tasks to visible low-earth-orbit (LEO) satellites. However, this offloading scheme is difficult to achieve good performance in actual networks with uneven loads because visible satellites over hotspots tend to be overloaded. Therefore, it is urgent to extend the offloading targets to the entire network. To address the network-wide offloading problem, we propose a metagraph-based computation and transmission fusion offloading scheme for multi-tier networks. Specifically, virtual edges, between the original network and its duplicate, are generated to fuse computation and transmission in single-tier networks. Then, a metagraph is employed to integrate the fusion in multi-tier networks. After assigning appropriate edge weights to the metagraph, the network-wide offloading problem can be solved by searching the shortest path. In addition, we apply the proposed scheme to solve the spatial computation offloading problem in a real multi-tier network. The superiority of the proposed scheme over two benchmark schemes are proved theoretically and empirically. Simulation results show that the proposed scheme decreases the weighted average delay by up to 87.51% and 18.70% compared with the ground offloading scheme and the visible offloading scheme, respectively.

eess.SY↗

arXiv2022

Adversarial Jamming for a More Effective Constellation Attack

The common jamming mode in wireless communication is band barrage jamming, which is controllable and difficult to resist. Although this method is simple to implement, it is obviously not the best jamming waveform. Therefore, based on the idea of adversarial examples, we propose the adversarial jamming waveform, which can independently optimize and find the best jamming waveform. We attack QAM with adversarial jamming and find that the optimal jamming waveform is equivalent to the amplitude and phase between the nearest constellation points. Furthermore, by verifying the jamming performance on a hardware platform, it is shown that our method significantly improves the bit error rate compared to other methods.

cs.CR↗

arXiv2022

Low-Interception Waveform: To Prevent the Recognition of Spectrum Waveform Modulation via Adversarial Examples

Deep learning is applied to many complex tasks in the field of wireless communication, such as modulation recognition of spectrum waveforms, because of its convenience and efficiency. This leads to the problem of a malicious third party using a deep learning model to easily recognize the modulation format of the transmitted waveform. Some existing works address this problem directly using the concept of adversarial examples in the image domain without fully considering the characteristics of the waveform transmission in the physical world. Therefore, we propose a low-intercept waveform~(LIW) generation method that can reduce the probability of the modulation being recognized by a third party without affecting the reliable communication of the friendly party. Our LIW exhibits significant low-interception performance even in the physical hardware experiment, decreasing the accuracy of the state of the art model to approximately $15\%$ with small perturbations.

cs.LG↗

arXiv2021

Secure Blockchain Platform for Industrial IoT with Trusted Computing Hardware

As a disruptive technology that originates from cryptocurrency, blockchain provides a trusted platform to facilitate industrial IoT (IIoT) applications. However, implementing a blockchain platform in IIoT scenarios confronts various security challenges due to the rigorous deployment condition. To this end, we present a novel design of secure blockchain based on trusted computing hardware for IIoT applications. Specifically, we employ the trusted execution environment (TEE) module and a customized security chip to safeguard the blockchain against different attacking vectors. Furthermore, we implement the proposed secure IIoT blockchain on the ARM-based embedded device and build a small-scale IIoT network to evaluate its performance. Our experimental results show that the secure blockchain platform achieves a high throughput (150TPS) with low transaction confirmation delay (below 66ms), demonstrating its feasibility in practical IIoT scenarios. Finally, we outline the open challenges and future research directions.

cs.CR↗

arXiv2021

A Photonics-based superheterodyne RF reception approach

A novel photonics-based RF reception approach is proposed as a competitive solution to meet the current challenges of photonic-based approaches and to realize high performances at the same time. The proposed approach adopts the superheterodyne configuration by a combination manner of electronic techniques and photonic techniques, including the ultrawideband generation of optical LO, the two-stage photonic superheterodyne frequency conversion and the real-time IF compensation. An engineering prototype has been developed and its performance has been evaluated in the laboratory environment. The experiment results preliminarily verify the feasibility of the proposed approach and its engineering potential. The typical performances are as follows: 0.1 GHz~ 45GHz operation spectrum range (>40 GHz), 900 MHz instantaneous bandwidth, 101 dBHz2/3 SFDR and 130 dBHz LDR, image rejections of ~80 dB for 1st frequency conversion and >90 dB for 2nd frequency conversion.

physics.app-ph↗

arXiv2021

RadioNet: Transformer based Radio Map Prediction Model For Dense Urban Environments

Radio Map Prediction (RMP), aiming at estimating coverage of radio wave, has been widely recognized as an enabling technology for improving radio spectrum efficiency. However, fast and reliable radio map prediction can be very challenging due to the complicated interaction between radio waves and the environment. In this paper, a novel Transformer based deep learning model termed as RadioNet is proposed for radio map prediction in urban scenarios. In addition, a novel Grid Embedding technique is proposed to substitute the original Position Embedding in Transformer to better anchor the relative position of the radiation source, destination and environment. The effectiveness of proposed method is verified on an urban radio wave propagation dataset. Compared with the SOTA model on RMP task, RadioNet reduces the validation loss by 27.3\%, improves the prediction reliability from 90.9\% to 98.9\%. The prediction speed is increased by 4 orders of magnitude, when compared with ray-tracing based method. We believe that the proposed method will be beneficial to high-efficiency wireless communication, real-time radio visualization, and even high-speed image rendering.

eess.SP↗

arXiv2021

Mean Field MARL Based Bandwidth Negotiation Method for Massive Devices Spectrum Sharing

In this paper, a novel bandwidth negotiation mechanism is proposed for massive devices wireless spectrum sharing, in which individual device locally negotiates bandwidth usage with neighbor devices and globally optimal spectrum utilization is achieved through distributed decision-making. Since only sparse feedback is needed, the proposed mechanism can greatly reduce the signaling overhead. In order to solve the distributed optimization problem when massive devices coexist, mean field multi-agent reinforcement learning (MF-MARL) based bandwidth decision algorithm is proposed, which allow device make globally optimal decision leveraging only neighborhood observation. In simulation, distributed bandwidth negotiation between 1000 devices is demonstrated and the spectrum utilization rate is above 95%. The proposed method is beneficial to reduce spectrum conflicts, increase spectrum utilization for massive devices spectrum sharing.

eess.SP↗

arXiv2021

Noise Attention based Spectrum Anomaly Detection Method for Unauthorized Bands

Spectrum anomaly detection is of great importance in wireless communication to secure safety and improve spectrum efficiency. However, spectrum anomaly detection faces many difficulties, especially in unauthorized frequency bands. For example, the composition of unauthorized frequency bands is very complex and the abnormal usage patterns are unknown in prior. In this paper, a noise attention method is proposed for unsupervised spectrum anomaly detection in unauthorized bands. First of all, we theoretically prove that the anomalies in unauthorized bands will raise the noise floor of spectrogram after VAE reconstruction. Then, we introduce a novel anomaly metric named as noise attention score to more effectively capture spectrum anomaly. The effectiveness of the proposed method is experimentally verified in 2.4 GHz ISM band. Leveraging the noise attention score, the AUC metric of anomaly detection is increased by 0.193. The proposed method is beneficial to reliably detecting abnormal spectrum while keeping low false alarm rate.

eess.SP↗

arXiv2021

Adversarial YOLO: Defense Human Detection Patch Attacks via Detecting Adversarial Patches

The security of object detection systems has attracted increasing attention, especially when facing adversarial patch attacks. Since patch attacks change the pixels in a restricted area on objects, they are easy to implement in the physical world, especially for attacking human detection systems. The existing defenses against patch attacks are mostly applied for image classification problems and have difficulty resisting human detection attacks. Towards this critical issue, we propose an efficient and effective plug-in defense component on the YOLO detection system, which we name Ad-YOLO. The main idea is to add a patch class on the YOLO architecture, which has a negligible inference increment. Thus, Ad-YOLO is expected to directly detect both the objects of interest and adversarial patches. To the best of our knowledge, our approach is the first defense strategy against human detection attacks. We investigate Ad-YOLO's performance on the YOLOv2 baseline. To improve the ability of Ad-YOLO to detect variety patches, we first use an adversarial training process to develop a patch dataset based on the Inria dataset, which we name Inria-Patch. Then, we train Ad-YOLO by a combination of Pascal VOC, Inria, and Inria-Patch datasets. With a slight drop of $0.70\%$ mAP on VOC 2007 test set, Ad-YOLO achieves $80.31\%$ AP of persons, which highly outperforms $33.93\%$ AP for YOLOv2 when facing white-box patch attacks. Furthermore, compared with YOLOv2, the results facing a physical-world attack are also included to demonstrate Ad-YOLO's excellent generalization ability.

cs.CV↗

arXiv2020

Blind Adversarial Training: Balance Accuracy and Robustness

Adversarial training (AT) aims to improve the robustness of deep learning models by mixing clean data and adversarial examples (AEs). Most existing AT approaches can be grouped into restricted and unrestricted approaches. Restricted AT requires a prescribed uniform budget to constrain the magnitude of the AE perturbations during training, with the obtained results showing high sensitivity to the budget. On the other hand, unrestricted AT uses unconstrained AEs, resulting in the use of AEs located beyond the decision boundary; these overestimated AEs significantly lower the accuracy on clean data. These limitations mean that the existing AT approaches have difficulty in obtaining a comprehensively robust model with high accuracy and robustness when confronting attacks with varying strengths. Considering this problem, this paper proposes a novel AT approach named blind adversarial training (BAT) to better balance the accuracy and robustness. The main idea of this approach is to use a cutoff-scale strategy to adaptively estimate a nonuniform budget to modify the AEs used in the training, ensuring that the strengths of the AEs are dynamically located in a reasonable range and ultimately improving the overall robustness of the AT model. The experimental results obtained using BAT for training classification models on several benchmarks demonstrate the competitive performance of this method.

cs.LG↗

arXiv2020

Blind Adversarial Pruning: Balance Accuracy, Efficiency and Robustness

With the growth of interest in the attack and defense of deep neural networks, researchers are focusing more on the robustness of applying them to devices with limited memory. Thus, unlike adversarial training, which only considers the balance between accuracy and robustness, we come to a more meaningful and critical issue, i.e., the balance among accuracy, efficiency and robustness (AER). Recently, some related works focused on this issue, but with different observations, and the relations among AER remain unclear. This paper first investigates the robustness of pruned models with different compression ratios under the gradual pruning process and concludes that the robustness of the pruned model drastically varies with different pruning processes, especially in response to attacks with large strength. Second, we test the performance of mixing the clean data and adversarial examples (generated with a prescribed uniform budget) into the gradual pruning process, called adversarial pruning, and find the following: the pruned model's robustness exhibits high sensitivity to the budget. Furthermore, to better balance the AER, we propose an approach called blind adversarial pruning (BAP), which introduces the idea of blind adversarial training into the gradual pruning process. The main idea is to use a cutoff-scale strategy to adaptively estimate a nonuniform budget to modify the AEs used during pruning, thus ensuring that the strengths of AEs are dynamically located within a reasonable range at each pruning step and ultimately improving the overall AER of the pruned model. The experimental results obtained using BAP for pruning classification models based on several benchmarks demonstrate the competitive performance of this method: the robustness of the model pruned by BAP is more stable among varying pruning processes, and BAP exhibits better overall AER than adversarial pruning.

cs.LG↗