runzhi li

Mr. runzhi li

College of Electronic Science, National University of Defense Technology

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
19 June 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
YLYuanyuan Liang
Yuanyuan Liang
GWGongjian Wen
Gongjian Wen
DLDengsanlang Luo
Dengsanlang Luo
RLrunzhi li
runzhi li
BLBoyun Li
Boyun Li
In the evaluation of the Ziv-Zakai bound (ZZB) for target parameter estimation in distributed multiple-input multiple-output (MIMO) radar systems, existing models often rely on idealized assumptions, such as completely orthogonal waveforms and temporally white interference, which may not reflect real-world conditions. This paper addresses these limitations by developing the ZZB for more realistic scenarios. We derive the ZZBs for joint target position and velocity estimation under both stochastic and deterministic signal models. The derived bounds distinguish the minimum error probabilities with an exact formula for the stochastic model and a saddle point approximation for the deterministic model. Simulation studies confirm that these ZZBs serve as robust lower bounds for the mean square error (MSE) of maximum a posteriori estimates across diverse signal-to-noise ratios (SNRs). To reduce computational demands, we introduce a Gaussian approximation method based on the moment-matching principle to estimate the minimum error probabilities for both models, significantly reducing complexity while preserving accuracy. Additionally, under ideal conditions, we simplify the ZZBs for both models into a weighted sum of the a priori covariance and the expectation of the conditional Cramér-Rao bound (CRB), where the weights depend on the overall SNR. This formulation offers insights into threshold phenomena and yields substantial computational benefits. Our results indicate that this matrix-based approach can achieve time savings of more than one order of magnitude compared to the integral-based ZZB calculation methods.

3 July 2020 in Sensors
Verified
Journal Article
Open access
PDF file
RLrunzhi li
runzhi li
JWJian Wang
Jian Wang
JCJiongyi Chen
Jiongyi Chen
With the increasing adoption of the Internet-of-Things (IoT), the wireless sensors network (WSN), as an underlying application of IoT, has attracted increasing attention. Topology, the working structure used to observe WSN, is the most instinctive form in troubleshooting and has great significance to WSN management and safety. To this end, it is imperative to recover WSN topology for the purpose of network management and non-cooperative network detection. Traditional network topology recovery mainly relies on the monitoring modules installed in nodes, or an extra network attached. However, these two approaches have several limitations, such as high energy consumption for monitoring nodes, time synchronization problems, reuse failure, limitation to specific targeted networks and high cost. In this paper, we present a new approach to recover the topology of WSN that adopts location-based routing protocols, based on movable platforms. Our observation is that the network topology is consistent with the node routing, as the nodes choose the next hop according to the geological position of neighbor nodes. Hence, we calculate the cost parameters of choosing routing nodes for the targeted network according to the partial connection of the nodes. Based on those cost parameters, we can determine the topology of the whole network. More specifically, by collecting the geological position and data packets of the nodes from movable platforms, we are able to infer the topology of the WSN according to the recovered partial connection of nodes. Our approach can be easily adopted to many scenarios, especially for non-cooperative large-scale networks. The evaluation of 30 simulations shows that the accuracy of recovery is above 90%.