Rangang Zhu

Rangang Zhu


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
19 August 2022 in Electronics
Verified
Journal Article
Open access
PDF file
RCRunyu Chen
Runyu Chen
LWLunwen Wang
Lunwen Wang
CPChuang Peng
Chuang Peng
RZRangang Zhu
Rangang Zhu
Sharding is the widely used approach to the trilemma of simultaneously achieving decentralization, security, and scalability in traditional blockchain systems. However, existing schemes generally involve problems such as uneven shard arithmetic power and insecure cross-shard transaction processing. In this study, we used the Practical Byzantine Fault Tolerance (PBFT) as the intra-shard consensus and, here, we propose a new sharding consensus mechanism. Firstly, we combined a jump consistent hash algorithm with signature Anchorhash to minimize the mapping of the node assignment. Then, we improved the process of the cross-shard transaction and used the activity of nodes participating in intra-shard transactions as the criterion for the shard reconfiguration, which ensured the security of the blockchain system. Meanwhile, we analyzed the motivation mechanism from two perspectives. Finally, through theoretical analysis and related experiments, we not only verified that the algorithm can ensure the security of the entire system, but also further clarified the necessary conditions to ensure the effectiveness of the shards and the system on the original basis.

22 July 2022 in Entropy
Verified
Journal Article
Open access
PDF file
RCRunyu Chen
Runyu Chen
LWLunwen Wang
Lunwen Wang
RZRangang Zhu
Rangang Zhu
The Delegated Proof of Stake (DPoS) consensus mechanism uses the power of stakeholders to not only vote in a fair and democratic way to solve a consensus problem, but also reduce resource waste to a certain extent. However, the fixed number of member nodes and single voting type will affect the security of the whole system. In order to reduce the negative impact of the above problems, a new consensus algorithm based on vague set and node impact factors is proposed. We first use fuzzy values to calculate the ratings of all nodes and initially determine the number of agent nodes according to the preset threshold value. Then, we judge whether a secondary screening is needed. If needed, calculating the nodes’ impact factor based on their neighboring nodes, and combining their impact factors with adjacency votes to further distinguish the nodes with the same fuzzy value. In addition, we analyze the dynamic changes in the composition and scale of the agent node set and give its ideal size through testing. Finally, we compare the proposed algorithm with DPoS algorithm and existing fuzzy set-based algorithms in different scales and network structures. Results show that no matter in what kind of network structures, the effectiveness of the proposed algorithm is improved. Among which, the most noticeable improvement is seen in complex network structures.

14 November 2025 in Remote Sensing
Verified
Journal Article
Open access
PDF file
ZWZhouji Wang
Zhouji Wang
Daqian LyuDaqian Lyu
Daqian Lyu
PZPeiyuan Zhou
Peiyuan Zhou
YGYulong Ge
Yulong Ge
YHYAO HU
YAO HU
XYXiaoniu Yang
Xiaoniu Yang
Timing and time synchronization are critical capabilities of Global Navigation Satellite Systems (GNSSs), but their performance deteriorates significantly in challenging environments like urban canyons and tunnels. To address this issue, this paper proposes the Distributed Sensor Time Synchronization architecture (DSTS), a novel architecture integrating Bayesian filtering with deep reinforcement learning. DSTS utilizes Bayesian filtering to fuse Time-of-Flight (ToF) measurements with Channel Impulse Response features for real-time compensation of non-linear errors and accurate path state prediction. Concurrently, the Deep Deterministic Policy Gradient (DDPG) algorithm trains each node into an intelligent agent that dynamically learns optimal synchronization weights based on local information like neighbor clock stability and link quality. This allows the architecture to adaptively amplify reliable nodes while mitigating the negative effects of unstable peers and adverse channels, ensuring high accuracy and availability. Simulation experiments based on a real-world UWB dataset demonstrate the architecture’s exceptional performance. The Bayesian filtering module effectively mitigates non-linear errors, reducing the standard deviation of ToF measurements in NLOS scenarios by up to 51.6% (over 41.2% consistently) while achieving high path state prediction accuracy (>85% static, >95% simulated dynamic). In simulated dynamic and heterogeneous networks, the DDPG algorithm achieves a synchronization accuracy better than traditional average-consensus algorithms, ultimately reaching a frequency and phase precision of 4×10−10 and 5×10−10 s, respectively.

13 March 2025 in Sensors
Verified
Journal Article
Open access
PDF file
RZRangang Zhu
Rangang Zhu
CLCe Li
Ce Li
YWYanhua Wu
Yanhua Wu
RWRuochen Wu
Ruochen Wu
ZZZhengkun Zhang
Zhengkun Zhang
YLYuliang Lu
Yuliang Lu
Cognitive Radio (CR) is widely acknowledged as a pivotal technology for mitigating the scarcity of spectrum resources, with Transform Domain Communication Systems (TDCSs) regarded as one of the primary candidate technologies for CR. However, conventional Wideband Spectrum Sensing (WBSS) techniques utilized in TDCS exhibit limitations and are insufficient for adapting to the current complex electromagnetic environment. This paper tackles the time–frequency reconstruction challenge in WBSS by proposing a fast time–frequency reconstruction (FTFR) algorithm. The proposed algorithm acquires sub-Nyquist samples through the introduction of a Multi-Coset Sampling structure and reconstructs the autocorrelation of signals across various windows through a series of low-complexity operations. It captures the dynamic variations of signals by integrating spectra from adjacent time windows. In comparison to existing time–frequency reconstruction algorithms in WBSS, the proposed algorithm demonstrates reduced computational complexity. Simulation experiments indicate that the FTFR algorithm can effectively reconstruct the time–frequency characteristics of signals and significantly restore the primary temporal and frequency distributions, even in low Signal-to-Noise Ratio (SNR) environments.

22 October 2025 in Entropy
Verified
Journal Article
Open access
PDF file
RCRunyu Chen
Runyu Chen
RZRangang Zhu
Rangang Zhu
LWLunwen Wang
Lunwen Wang
The Practical Byzantine Fault Tolerance (PBFT) algorithm, while fundamental to consortium blockchains, suffers from performance degradation and vulnerability of leader nodes in large-scale scenarios. Existing improvements often prioritize performance while lacking systematic consideration of the structural characteristics of the nodes and network coverage. In this paper, a new network topology-aware Byzantine fault-tolerant algorithm NetTopoBFT is proposed for the supply chain and other application scenarios that require strict transaction finality but moderate throughput. Firstly, it innovatively combines the weighted signed network with the consortium chain, constructs a two-layer Bayesian smoothing node evaluation model, and evaluates the nodes through the two-dimensional evaluation of ‘behavioral reputation plus structural importance’. Then, to reduce the risk of being attacked, it uses Verifiable Random Function (VRF) to decide the leader. Furthermore, it uses a duplicate coverage-driven waitlisting mechanism to enhance the robustness and connectivity of the system. Theoretical analysis and experiment results show that NetTopoBFT significantly improves the quality of consensus nodes under the premise of guaranteeing decentralization, realizes the simultaneous optimization of communication overhead, security and network coverage. It provides a new idea for designing consensus mechanism of consortium blockchains.