Wei Xiong

Dr. Wei Xiong


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
10 December 2018 in Remote Sensing
Verified
Journal Article
Open access
PDF file
YZYing Zhang
Ying Zhang
WXWei Xiong
Wei Xiong
Xichao DongXichao Dong
Xichao Dong
Cheng HuCheng Hu
Cheng Hu
YSYang Sun
Yang Sun
Geosynchronous synthetic aperture radar (GEO SAR) has great potentials in ship surveillance due to its high time resolution and wide swath coverage. However, the remote slant range will result in a very low signal-to-noise ratio (SNR) of echoes that need to be enhanced by long-time coherent integration. The generalized Radon-Fourier transform (GRFT) can realize the coherent integration of moving target under long integration time by jointly parameter searching along range and velocity directions. Unfortunately, in GEO SAR, the very large slant range and long synthetic aperture will cause the curved synthetic aperture trajectory and non-negligible signal round-trip delay, leading to the failure of the traditional slant range and GRFT signal model for moving targets. This paper proposes an improved GRFT-based approach to realize the detection and imaging of moving ship targets in GEO SAR. Firstly, the accurate slant range for moving ship targets is constructed and the GRFT signal is redefined considering the curved trajectory and signal round-trip delay in GEO SAR. Then, GRFT responses to different motion parameters are analyzed. The procedures of moving ship targets detection and imaging in GEO SAR are presented through the detection with coarse-searched motion parameters in GRFT and the following imaging with fine-searched motion parameters based on minimum entropy. Finally, computer simulations verify the proposed GRFT-based method.

27 February 2024 in Aerospace
Verified
Journal Article
Open access
PDF file
CHChi Han
Chi Han
WXWei Xiong
Wei Xiong
RYRonghuan Yu
Ronghuan Yu
Mega-constellation network traffic forecasting provides key information for routing and resource allocation, which is of great significance to the performance of satellite networks. However, due to the self-similarity and long-range dependence (LRD) of mega-constellation network traffic, traditional linear/non-linear forecasting models cannot achieve sufficient forecasting accuracy. In order to resolve this problem, a mega-constellation network traffic forecasting model based on EMD (empirical mode decomposition)-ARIMA (autoregressive integrated moving average) and IGWO (improved grey wolf optimizer) optimized BPNN (back-propagation neural network) is proposed in this paper, which makes comprehensive utilization of linear model ARIMA, non-linear model BPNN and optimization algorithm IGWO. With the enhancement of the global optimization capability of a BPNN, the proposed hybrid model can fully realize the potential of mining linear and non-linear laws of mega-constellation network traffic, hence improving the forecasting accuracy. This paper utilizes an ON/OFF model to generate historical self-similar traffic to forecast. RMSE (root mean square error), MAE (mean absolute error), R-square and MAPE (mean absolute percentage error) are adopted as evaluation indexes for the forecasting effect. Comprehensive experimental results show that the proposed method outperforms traditional constellation network traffic forecasting schemes, with several improvements in forecasting accuracy and efficiency.

10 March 2023 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
MXMinghui Xiong
Minghui Xiong
WXWei Xiong
Wei Xiong
ZLZheng Liu
Zheng Liu
Satellite range scheduling, a multi-constrained combinatorial optimization problem, is crucial to guaranteeing the normal operation and application of onboard satellites. Traditional methods are dedicated to finding one optimal schedule, having ignored the problem may process multiple high-quality schedules. To provide a set of alternative schedules while maintaining the solution quality, we propose a co-evolutionary algorithm with elite archive strategy (COEAS) in this article. In COEAS, two populations are evolved to solve the original and relaxed problem in terms of schedule quality and diversity, respectively. During the evolution, the populations maintain a weak cooperation and only share the information in offspring combination phase. Further, an elite archive strategy is derived to identify and preserve potential stagnated and optimal individuals. In this strategy, the promising individuals would further participate in parent mating and offspring replacement for the dual purpose of maintaining potential optima recovery and fine-tuning the population. The experimental results show that the proposed algorithm is better than comparison algorithms in terms of efficacy (obtaining higher quality schedule), diversity (locating more optimal schedules) and flexibility (providing better alternatives).

12 December 2023 in Sensors
Verified
Journal Article
Open access
PDF file
CHChi Han
Chi Han
WXWei Xiong
Wei Xiong
RYRonghuan Yu
Ronghuan Yu
With the expansion of user scale in LEO satellite networks, unbalanced regional load and bursty network traffic lead to the problem of load disequilibrium. A distributed hops-based back-pressure (DHBP) routing is proposed. DHBP theoretically derives a fast solution for the minimum end-to-end propagation hops between satellite nodes in inclined-orbit LEO satellite networks; hence, link weights are determined based on remaining hops between the next hop and destination satellites. In order to control the number of available retransmission paths, the permitted propagation region is restricted to a rectangular region consisting of source-destination nodes to reduce the propagation cost. Finally, DHBP is designed distributedly, to realize a dynamic selection of the shortest link with low congestion and balanced traffic distribution without obtaining the whole network topology. Network simulation results demonstrate that DHBP has higher throughput and lower delay under high load conditions compared with state-of-the-art routing protocols.

18 January 2018 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YSYang Sun
Yang Sun
YLYun Li
Yun Li
WXWei Xiong
Wei Xiong
ZYZhonghua Yao
Zhonghua Yao
KMKrishna Moniz
Krishna Moniz
Ahmed ZahirAhmed Zahir
Ahmed Zahir
Using Pareto optimization in Multi-Objective Reinforcement Learning (MORL) leads to better learning results for network defense games. This is particularly useful for network security agents, who must often balance several goals when choosing what action to take in defense of a network. If the defender knows his preferred reward distribution, the advantages of Pareto optimization can be retained by using a scalarization algorithm prior to the implementation of the MORL. In this paper, we simulate a network defense scenario by creating a multi-objective zero-sum game and using Pareto optimization and MORL to determine optimal solutions and compare those solutions to different scalarization approaches. We build a Pareto Defense Strategy Selection Simulator (PDSSS) system for assisting network administrators on decision-making, specifically, on defense strategy selection, and the experiment results show that the Satisficing Trade-Off Method (STOM) scalarization approach performs better than linear scalarization or GUESS method. The results of this paper can aid network security agents attempting to find an optimal defense policy for network security games.

6 November 2017 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YSYang Sun
Yang Sun
WXWei Xiong
Wei Xiong
ZYZhonghua Yao
Zhonghua Yao
KMKrishna Moniz
Krishna Moniz
Ahmed ZahirAhmed Zahir
Ahmed Zahir
Improving network security is a difficult problem that requires balancing several goals, such as defense cost and need for network efficiency, in order to achieve proper results. In this paper, we devise method of modeling network attack in a zero-sum multi-objective game and attempt to find the best defense against such an attack. We combined Pareto optimization and Q-learning methods to determine the most harmful attacks and consequently to find the best defense against those attacks. The results should help network administrators in search of a hands-on method of improving network security.