Xindi Wang

Dr. Xindi Wang


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
19 July 2019 in IEEE Access
Verified
Journal Article
Open access
XWXindi Wang
Xindi Wang
QZQingfeng Zhou
Qingfeng Zhou
CQChunxiao Qu
Chunxiao Qu
GCGao Chen
Gao Chen
JXJunjuan Xia
Junjuan Xia
This paper proposes a scheme for updating the location of the sink node to balance the network topology when a wireless sensor network (WSN) is scaled up. We divide the proposed location update scheme into two steps, namely, searching the optimal location and designing the pathfinding algorithm. For the former, to find the optimal location of the sink node simply and efficiently, we only consider the information of the expanded longer paths and some key nodes instead of the global information of the entire network, which is easy to implement with a low-computational load. Then, considering the general unattended application scenario, we propose an improved reinforcement learning (RL) algorithm for the sink node to calculate a feasible efficient path, and then the sink node follows the path to reach the optimal location. Finally, through simulations, we demonstrate the optimal position of the sink node in expanded scenarios and successfully let the sink node learn the effective pathfinding method to reach the target position. A large number of simulation results verify the efficiency and effectiveness of our proposed scheme from the perspective of the efficiency of the pathfinding algorithm.

9 April 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
XWXindi Wang
Xindi Wang
QZQingfeng Zhou
Qingfeng Zhou
YGYuantao Gu
Yuantao Gu
JTJun Tong
Jun Tong
Among various data aggregation approaches proposed for wireless sensor networks (WSNs), the one based on compressive sensing (CS) has the merit of low traffic cost. The key step to design a CS-based data aggregation protocol is to construct a measurement matrix ${\Phi }$ based on the network structure and to assign each node a unique column vector of ${\Phi }$ . Assuming an expanded scenario, where some new nodes join in the network, the data aggregation scheme has to entirely re-generate a new matrix ${\Phi ^{\prime }}$ with a larger size to meet the node number and CS property simultaneously. Apparently, it is energy-consuming to reallocate the weight vectors from the new measurement matrix to all the nodes. Thus, we propose an approach which aims to keep the weight vectors of existing sensors unchanged but assign only optimized measurement vectors to the newly added nodes. In order to solve the relevant non-convex optimization problem, two efficient methods with good data aggregation performance are proposed. Numeric experiments validate the effectiveness of our proposed methods.

1 May 2019 in IEEE Access
Verified
Journal Article
Open access
XWXindi Wang
Xindi Wang
QZQingfeng Zhou
Qingfeng Zhou
JTJun Tong
Jun Tong
Data aggregation is one of the most important functions provided by wireless sensor networks (WSNs). Among a variety of data aggregation schemes, the coding-based approaches (such as Compressive Sensing (CS) and other similar programs) can significantly reduce traffic quantity by encoding the raw sensed data using weight vectors. The critical feature to design a coding-based data aggregation protocol is to construct a weight/measurement matrix for the application scenario. After that, the sink node assigns the column of the matrix, which is treated as the weight vector during the encoding process, to each sensor node respectively. However, for a dynamic scenario where the number of sensor nodes changes frequently, the existing approaches have to reconfigure the network by re-generating the measurement matrix and allocating the new weight vectors for all the existing nodes, which causes a considerable energy consumption and affects regular monitoring tasks. To solve this problem, we propose a Vandermonde matrix-based scalable data aggregation protocol (VSDA) which preserves the advantages of coding-based schemes and addresses the issues mentioned above. In VSDA, as new nodes join into the scaled-up network, the original weight vectors owned by the original nodes do not need to regenerate the weight vectors entirely but add some new entries by itself at all. It outperforms the existing schemes by saving the energy in network scaling-up. Besides, we propose a concise hardware framework to quantify the data encoding process of VSDA, which provides a performance analysis process that is closer to practical application. Numeric tests validate the performance of VSDA compared with existing schemes in several aspects, such as the number of transmissions, energy consumption, and storage space, showing the outperformance of VSDA scheme.

8 December 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XLXinyu Liu
Xinyu Liu
QZQingfeng Zhou
Qingfeng Zhou
Chi-Tsun ChengChi-Tsun Cheng
Chi-Tsun Cheng
JWJianjian Wu
Jianjian Wu
XWXindi Wang
Xindi Wang
Lisheng FanLisheng Fan
Lisheng Fan
In general, a two-dimensional (2D) moving trajectory can be reconstructed using data collected from a 6-axis IMU (inertial measurement unit), which consists of a 3-axis gyroscope and a 3-axis accelerometer. Since the power consumption of a gyroscope is significantly larger than that of an accelerometer, to be energy-efficient, it is more preferable to use two gyro-free IMUs as alternatives. The existing gyro-free trajectory reconstruction approach is an angular velocity (i.e. ω) -based method. The design of an ω-free gyro-free approach remains as a research gap, which motivates this research work. In this paper, an ω-free accelerometer pair (OFAP) method is proposed, which can yield a lower accumulated error, has a lower power consumption, is more scalable, and can deliver the same trajectory reconstruction performance as the existing approach.

26 August 2019 in IEEE Access
Verified
Journal Article
Open access
CLChanzi Liu
Chanzi Liu
QZQingfeng Zhou
Qingfeng Zhou
XWXindi Wang
Xindi Wang
KCKaiping Chen
Kaiping Chen
We propose a novel signal multiplexing and detection method for multiple-input multiple-output (MIMO) communication systems, especially when the number of transmitting and receiving antennas is limited. Inspired by the idea of Compressive Sensing (CS) which can recover a given signal vector from a vector of measurements with less dimensions, our proposed CS-based multiplexing scheme can deliver a modulated data vector with length l via a MIMO system with fewer transmitting/receiving antennas than l, offering higher multiplexing gain. On the receiving side, our proposed detection scheme has two steps, which resort the BCS algorithm and a Deep-Learning algorithm to recover the original modulated data vector. Analytical and simulation results show that the proposed multiplexing and detection method can achieve larger multiplexing gain while reserving good bit error rate (BER), offering a novel research paradigm to improve the utility rate of multiple antennas.