Xin Xu

Prof. Dr. Xin Xu


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 September 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
SZSenbai Zhang
Senbai Zhang
ALAijun Liu
Aijun Liu
CHChen Han
Chen Han
XXXin Xu
Xin Xu
XLXiaohu Liang
Xiaohu Liang
YZYunyang Zhang
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.

28 July 2023 in Computer Communications
Verified
Journal Article
Open access
XXXin Xu
Xin Xu
ZGZhixiang Gao
Zhixiang Gao
ALAijun Liu
Aijun Liu

15 November 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
ZGZhixiang Gao
Zhixiang Gao
ALAijun Liu
Aijun Liu
XXXin Xu
Xin Xu
XLXiaohu Liang
Xiaohu Liang
CHChen Han
Chen Han
XLXian Liu
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.

11 May 2021 in International Journal of Satellite Communications and Networking
Verified
Journal Article
Closed access
PDF file
XXXin Xu
Xin Xu
CDChaoying Dong
Chaoying Dong
ALAijun Liu
Aijun Liu

31 March 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XXXin Xu
Xin Xu
SZSenbai Zhang
Senbai Zhang
ALAijun Liu
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.

11 September 2023 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
ZGZhixiang Gao
Zhixiang Gao
ALAijun Liu
Aijun Liu
XXXin Xu
Xin Xu
HWHeng Wang
Heng Wang
XTXinhai Tong
Xinhai Tong
CHChen Han
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.