Yi He Wan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yi He Wan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Bao Gen Xu
Joint Lab of Array Signal Processing TongFang Electronic Science and Technology Co. Ltd. Jiujiang, China
1 shared publicationHan Liu
College of Quality and Technical Supervision, Hebei University, Baoding, China
1 shared publication- Jun Zhou
Chongqing Business Vocational College, Chongqing, 401331, China
1 shared publication Qun Wan
Department of Electronic Engineering University of Electronic Science and Technology of China Chengdu, China
1 shared publication- Si Tang
Ericsson (China) Company Limited., Beijing, China
1 shared publication - Xue Ding
Mobile and Terminal Technology Research Department, China Telecom Research Institute, Beijing 102209, China
1 shared publication
Latest Publications
- Open Access
- 25 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 51634-51642
Distributed Target Tracking in Sensor Networks by Consistency Algorithm and Semantic Moving Computing of Internet of Things
The target tracking algorithm of mobile wireless sensor networks involves target motion trend prediction and subsequent node guidance. This study aims to solve the problems of global consistency of node information and significant errors in forecasting fast-moving targets’ trajectories through traditional distributed tracking methods in sensor networks. Initially, the average consistency algorithm is used to average the local measurements of each node to achieve global consistency. Then, semantic moving computing of the Internet of Things calculates and analyzes the node movement to support the subsequent movement guidance of nodes and target movement prediction. Finally, the simulation experiment is carried out to evaluate the commonly used target trajectory prediction model. The simulation results show that the node movement algorithm by average consistency can effectively improve the positioning accuracy of the network for moving targets. Besides, the positioning error decreases with the increase of the sensing radius R, the number of moving nodes nm, and the total number of nodes ns deployed in a particular range in a two-dimensional (2D) space. The positioning error after node movement in 2D space is about 20%-30%R lower than that in a static state. After node movement in a three-dimensional (3D) space, the positioning error is about 40%-50%R lower than in a dormant state. When the target moves at a speed greater than 7m/s, the consistency-based moving computing algorithm’s target loss rate and tracking errors are about 0~10% and 1.5%~2% lower than the target tracking algorithm via Kalman Filter. Therefore, the algorithm reported here can precisely track the high-speed moving target. The existing research on point target tracking has problems of insufficient accuracy and robustness. The algorithm proposed here has stronger robustness, reduced data error in multi-node, and more flexible node movements, providing a reference for the subsequent research on distributed point target tracking.
- 25 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 51634-51642
Open AccessDistributed Target Tracking in Sensor Networks by Consistency Algorithm and Semantic Moving Computing of Internet of Things
The target tracking algorithm of mobile wireless sensor networks involves target motion trend prediction and subsequent node guidance. This study aims to solve the problems of global consistency of node information and significant errors in forecasting fast-moving targets’ trajectories through traditional distributed tracking methods in sensor networks. Initially, the average consistency algorithm is used to average the local measurements of each node to achieve global consistency. Then, semantic moving computing of the Internet of Things calculates and analyzes the node movement to support the subsequent movement guidance of nodes and target movement prediction. Finally, the simulation experiment is carried out to evaluate the commonly used target trajectory prediction model. The simulation results show that the node movement algorithm by average consistency can effectively improve the positioning accuracy of the network for moving targets. Besides, the positioning error decreases with the increase of the sensing radius R, the number of moving nodes nm, and the total number of nodes ns deployed in a particular range in a two-dimensional (2D) space. The positioning error after node movement in 2D space is about 20%-30%R lower than that in a static state. After node movement in a three-dimensional (3D) space, the positioning error is about 40%-50%R lower than in a dormant state. When the target moves at a speed greater than 7m/s, the consistency-based moving computing algorithm’s target loss rate and tracking errors are about 0~10% and 1.5%~2% lower than the target tracking algorithm via Kalman Filter. Therefore, the algorithm reported here can precisely track the high-speed moving target. The existing research on point target tracking has problems of insufficient accuracy and robustness. The algorithm proposed here has stronger robustness, reduced data error in multi-node, and more flexible node movements, providing a reference for the subsequent research on distributed point target tracking.
- Open Access
- 16 November 2021
- Published by North Atlantic University Union (NAUN) in International Journal of Applied Mathematics and Informatics
- Vol. 15, 55-58
Sparsity Enhanced Beamforming in The Presence of Coherent Signals
In order to find the directions of coherent signals, a sparsity enhanced beam-forming method is proposed. Unlike the conventional minimum variance distortless response (MVDR) method, the minimum variance in the proposed method corresponds to the orthogonal relationship between the noise subspace and the sparse representation of the received signal vector, whereas the distortless response corresponds to the nonorthogonal relationship between the signal subspace and the sparse representation of the received signal vector. The proposed sparsity enhanced MVDR (SEMVDR) method is carried out by the iterative reweighted Lp-norm constraint minimization. for direction finding of coherent signals. Simulation results are shown that SEMVDR has better performance than the existing algorithms, such as MVDR and MUSIC, when coherent signals are present.
- 16 November 2021
- Published by North Atlantic University Union (NAUN) in International Journal of Applied Mathematics and Informatics
- Vol. 15, 55-58
Open AccessSparsity Enhanced Beamforming in The Presence of Coherent Signals
In order to find the directions of coherent signals, a sparsity enhanced beam-forming method is proposed. Unlike the conventional minimum variance distortless response (MVDR) method, the minimum variance in the proposed method corresponds to the orthogonal relationship between the noise subspace and the sparse representation of the received signal vector, whereas the distortless response corresponds to the nonorthogonal relationship between the signal subspace and the sparse representation of the received signal vector. The proposed sparsity enhanced MVDR (SEMVDR) method is carried out by the iterative reweighted Lp-norm constraint minimization. for direction finding of coherent signals. Simulation results are shown that SEMVDR has better performance than the existing algorithms, such as MVDR and MUSIC, when coherent signals are present.