XXXin Xu

Xin Xu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Xin Xu has a total of 35 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Semantic-Empowered Simultaneous Wireless Power Transfer and Anti-Jamming Communication in UAV Relay Networks

    by Xin Lin, Aijun Liu, Kegang Pan, Chen Han, Yifu Sun, Xinhai Tong, Xin Xu

    Benefiting from the flexible deployment capability and favorable propagation condition, the unmanned aerial vehicle (UAV) relay networks are crucial for rapid coverage extension and resilient connectivity in adversarial communication environments. However, the transmission effectiveness is constrained by scarce energy resource and severe hostile jamming attacks. Motivated by this need, this paper investigates the semantic communication (SemCom) empowered UAV relay networks that integrates SemCom with simultaneous wireless information and power transfer (SWIPT). For the first time, the semantic encoding/ decoding is embedded into the two-hop communication while the power-splitting (PS) jointly coordinates information transmission and energy harvesting. With the imperfect channel state information (CSI), we formulate the worst-case sum SemCom rate maximization problem subject to the constraints of semantic decoding feasibility, energy harvesting and transmit power. To address the intractable problem, we develop a robust three-step monotonic-optimization (MO) framework with low-complexity feasibility checking algorithm (LFCA). Firstly, a robust generalized discretization approach is used to convert the imperfect CSI. Then, the MO framework with LFCA is presented to obtain optimal solution of transmit beamformer, receive decoder and PS ratio with dimension reduction method. Simulations results show that proposed MO-LFCA scheme outperforms conventional bit-level SWIPT scheme and the other benchmark schemes versus different jamming power levels and antenna configurations, demonstrating that the integration of SemCom and SWIPT mechanism can enhance anti-jamming and efficiency performance in UAV relay networks.


  • Minimum-Variance-Based Blind CFO Estimator for OTFS Systems in V2X Communications

    by Liangdong Wei, Aijun Liu, Kegang Pan, Xiaohu Liang, Xinhai Tong, Xin Xu

    This letter proposes a new low-complexity blind carrier frequency offset (CFO) estimator for orthogonal time frequency space (OTFS) systems in vehicle-to-everything (V2X) communications. The estimator leverages the statistical properties of the element-wise modulus vector of OTFS symbols in the delay-Doppler (DD) domain. It is shown that, under ideal CFO compensation, the variance of this vector reaches its minimum while the expectation reaches its maximum. Based on this finding, the objective function for CFO estimation is formulated. Moreover, to reduce complexity and meet the real-time requirement of V2X communications, the expectation of the objective function is approximated as its mean via the law of large numbers. Simulation results demonstrate that, for sufficient signal lengths, the proposed estimator achieves lower complexity while achieving higher estimation accuracy under low signal-to-noise ratio (SNR) conditions compared with existing estimators.

  • Topology Dynamic of Mega-Constellation Networks

    by Xin Xu, Senbai Zhang, Aijun Liu

    Mega-constellation networks face great challenges in providing broadband reliable communication service. The main obstacle is the highly dynamic network topology. This article focuses on this issue and makes an effort to examine the topology dynamic of mega-constellation from a new perspective. Some metrics derived from complex network theory are presented to describe topology characteristics. Considering the impact of the topology dynamic on routing, the topology dynamic characteristics are then expressed by a newly defined topology correlation of the two adjacent snapshots. Three well-known mega-constellations are used as examples and compared by using these metrics. Simulation results show that fewer nodes need to update routes with the same snapshot length when there is a greater correlation between snapshots. In addition, an isochronic snapshot topology control and routing update scheme (ISTC) is proposed to mitigate the problem of the surging number of snapshots due to the complex dynamics of mega-constellations. The upper and lower bound of the snapshot length are presented. So that, local convergence of routes can be achieved and the number of routing updates are as small as possible within each snapshot. Moreover, a decreasing distance shortest distance (DDSD) access satellite selection algorithm is presented to work with the topology control scheme and reduce the number of satellite handovers. Simulation results show that these methods have advantages in coping with the dynamics of constellation networks.


  • GRLR: Routing With Graph Neural Network and Reinforcement Learning for Mega LEO Satellite Constellations

    by Senbai Zhang, Aijun Liu, Chen Han, Xin Xu, Xiaohu Liang, Kang An, Yunyang Zhang

    This paper investigates the routing problem in the mega low earth orbit (mLEO) satellite constellations considering factors including distribution of the users, topology of the networks and dynamics of the inter-satellite links (ISLs). In walker-delta constellations, each satellite establishes four stable ISLs with neighboring satellites to forward data packets without relying on ground facilities. In order to minimize the delay from the source satellite to the destination satellite, the routing problem is formulated as a Markov decision problem (MDP) and the GRLR routing algorithm is proposed which integrates reinforcement learning (RL) and graph neural network (GNN) effectively. The GRLR establishes the decision network based on Actor-Critic RL framework and builds feature extraction network based on GNN to realize distributed intelligent routing decisions in mLEO constellations. Finally, the simulation experiments are carried out to illustrate that the proposed strategy exhibits rapid convergence and outperforms the baseline strategies in terms of delay and adaptability to network dynamics.


  • Sum Data Minimization in LEO Satellite-UAV Integrated Multi-Tier Computing Networks: A Game-Theoretic Multiple Access Approach

    by Zhixiang Gao, Aijun Liu, Xin Xu, Xiaohu Liang, Chen Han, Xian Liu

    Massive devices have become a bottleneck restricting the improvement of computing networks. In this paper, we investigate massive multiple access (MA) schemes in low earth orbit satellite-unmanned aerial vehicle (UAV) integrated multi-tier computing networks to achieve higher connectivity. A game-theoretic MA approach is proposed for sum data minimization at UAVs. This approach is divided into two parts: data node (DN)-UAV assignment and UAV-satellite matching. In the first part, the DNs’ orthogonal MA process is formulated as a coalition formation game (CFG) with the derived optimal bandwidth allocation. The CFG with the proposed Max-Satisfaction order is proofed as an exact potential game, which can maximize the satisfaction between the collected data and UAVs’ real computing capacities. Besides, the overlapping CFG (OCFG) is utilized for higher satisfaction. In UAV-satellite matching, non-orthogonal MA-based sum rate maximization with imperfect successive interference cancellation is obtained by transmit power optimization firstly. The UAV-satellite matching process is formulated as a many-to-one matching game (MTOMG). A swap-based MTOMG algorithm is proposed for UAVs grouping. Finally, the simulation results show the proposed schemes have better performance than other schemes, and the proposed approach remains the lowest data at UAVs compared to other approaches.


  • Open Access

    Cuckoo Bloom Hybrid Filter: Algorithm and Hardware Architecture for High Performance Satellite Internet Protocol Route Lookup

    by Yi Zhang, Lufeng Qiao, Lin Hu, Xin Xu, Qinghua Chen

    The next-generation satellite Internet Protocol (IP) router is required to achieve tens of millions of route lookups per second, since satellite Internet services based on low Earth orbit (LEO) constellations have become a reality. Due to the limitation of hardware resources on satellites and the high reliability requirements for equipment, a new satellite IP route lookup architecture is proposed in this paper. The proposed architecture uses a Bloom and cuckoo filter-based structure called cuckoo Bloom hybrid filter (CBHF), which guarantees only one off-chip memory access per lookup, to accelerate the Prefix-Route Trie (PR-Trie) algorithm. The proposed architecture has been evaluated through both a behavioral simulation in C++ language and a hardware implementation in Verilog hardware description language (HDL). Our simulation and implementation results show that the proposed satellite IP route lookup architecture can achieve a single-port throughput beyond 13 Gbps on a field programmable gate array (FPGA) board with a single DDR3 memory chip when operating at 200 MHz. In addition, the resource utilization in the FPGA shows that the proposed architecture also supports triple modular redundancy (TMR) to enhance reliability.


  • Rate Splitting-Based Nonorthogonal Multiple Access Transmission in Satellite– Terrestrial Relay Networks

    by Zhixiang Gao, Aijun Liu, Xin Xu, Heng Wang, Xinhai Tong, Xiaohu Liang, Chen Han

    Satellite-terrestrial relay networks (STRNs) play an important role in future wireless networks. Rate splitting (RS) is recognized as a promising paradigm for non-orthogonal transmission. Non-orthogonal multiple access (NOMA) can provide high spectral efficiency compared to orthogonal multiple access (OMA). In this paper, we investigate RS-based NOMA in STRNs. In our model, RS is applied in satellite-relay links and NOMA is used in the relay-user links with both amplify-and-forward (AF) and decode-and-forward (DF) modes considered at the relays. Firstly, the precoding vectors are derived for the common signal and the private signal based on statistical channel state information. And the closed-form expressions of users' ergodic capacity are derived detailed at both AF and DF modes. Then, the user fairness is achieved by transmit power optimization (TPO). By some mathematical transformations, the TPO is simplified to maximize the minimum average rate of the common signal and derive the optimal NOMA factor. Then, the simplified TPO problem is transformed into a convex problem. Besides, the relay-user section and power optimization algorithm is proposed for users fairness. Finally, the numerical results verify the correctness of theoretical analysis of the ergodic capacity and show the superiority of our proposed approach compared with other schemes.


  • Open Access

    Robustness of satellite constellation networks

    by Xin Xu, Zhixiang Gao, Aijun Liu


  • Open Access

    An Efficient Compressive Sensing Event-Detection Scheme for Internet of Things System Based on Sparse-Graph Codes

    by Jun Cai, Xin Xu, Hongpeng Zhu, Jian Cheng

    This work studied the event-detection problem in an Internet of Things (IoT) system, where a group of sensor nodes are placed in the region of interest to capture sparse active event sources. Using compressive sensing (CS), the event-detection problem is modeled as recovering the high-dimensional integer-valued sparse signal from incomplete linear measurements. We show that the sensing process in IoT system produces an equivalent integer CS using sparse graph codes at the sink node, for which one can devise a simple deterministic construction of a sparse measurement matrix and an efficient integer-valued signal recovery algorithm. We validated the determined measurement matrix, uniquely determined the signal coefficients, and performed an asymptotic analysis to examine the performance of the proposed approach, namely event detection with integer sum peeling (ISP), with the density evolution method. Simulation results show that the proposed ISP approach achieves a significantly higher performance compared to existing literature at various simulation scenario and match that of the theoretical results.


  • Open Access

    Unsupervised and Supervised Feature Selection for Incomplete Data via L2,1-Norm and Reconstruction Error Minimization

    by Jun Cai, Linge Fan, Xin Xu, Xinrong Wu

    Feature selection has been widely used in machine learning and data mining since it can alleviate the burden of the so-called curse of dimensionality of high-dimensional data. However, in previous works, researchers have designed feature selection methods with the assumption that all the information from a data set can be observed. In this paper, we propose unsupervised and supervised feature selection methods for use with incomplete data, further introducing an L2,1 norm and a reconstruction error minimization method. Specifically, the proposed feature selection objective functions take advantage of an indicator matrix reflecting unobserved information in incomplete data sets, and we present pairwise constraints, minimizing the L2,1-norm-robust loss functionand performing error reconstruction simultaneously. Furthermore, we derive two alternative iterative algorithms to effectively optimize the proposed objective functions and the convergence of the proposed algorithms is proven theoretically. Extensive experimental studies were performed on both real and synthetic incomplete data sets to demonstrate the performance of the proposed methods.