Lunwen Wang

Lunwen Wang


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
26 August 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
JZJingcheng Zhu
Jingcheng Zhu
LWLunwen Wang
Lunwen Wang
Identifying influential nodes in complex networks is of great significance for clearly understanding network structure and maintaining network stability. Researchers have proposed many classical methods to evaluate the propagation impact of nodes, but there is still some room for improvement in the identification accuracy. Degree centrality is widely used because of its simplicity and convenience, but it has certain limitations. We divide the nodes into neighbor layers according to the distance between the surrounding nodes and the measured node. Considering that the node’s neighbor layer information directly affects the identification result, we propose a new node influence identification method by combining degree centrality information about itself and neighbor layer nodes. This method first superimposes the degree centrality of the node itself with neighbor layer nodes to quantify the effect of neighbor nodes, and then takes the nearest neighborhood several times to characterize node influence. In order to evaluate the efficiency of the proposed method, the susceptible–infected–recovered (SIR) model was used to simulate the propagation process of nodes on multiple real networks. These networks are unweighted and undirected networks, and the adjacency matrix of these networks is symmetric. Comparing the calculation results of each method with the results obtained by SIR model, the experimental results show that the proposed method is more effective in determining the node influence than seven other identification methods.

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.

2 June 2022 in Electronics
Verified
Journal Article
Open access
PDF file
CPChuang Peng
Chuang Peng
WHWeilin Hu
Weilin Hu
LWLunwen Wang
Lunwen Wang
With the miniaturization of communication devices, the number of distributed electromagnetic devices is increasing. In order to achieve effective management of the electromagnetic spectrum, prediction and anomaly detection of the spectrum has become increasingly critical. This paper proposes an algorithmic framework for detecting spectrum anomalies using deep learning techniques. More specifically, the framework includes spectrum prediction and anomaly detection. We use the sliding window method to divide the time series, construct multi-timescale historical data, and train the model with normal data to have high accuracy spectrum prediction capability. We analyze and determine the discriminant function to distinguish the spectral anomalies by calculating the differences between the predicted and real data. The experimental results show that the proposed method outperforms existing baseline algorithms based on real-world spectrum measurement data and simulated anomaly data.

15 August 2022 in Electronics
Verified
Journal Article
Open access
PDF file
WHWeilin Hu
Weilin Hu
LWLunwen Wang
Lunwen Wang
CPChuang Peng
Chuang Peng
Electromagnetic environment situation anomaly detection is a prerequisite for electromagnetic threat level assessment, and its research is of great practical value. However, because of the complexity of the electromagnetic environment, electromagnetic environment situation anomaly detection is not efficient. Therefore, we propose a dual-branch prediction network-based electromagnetic environment situation anomaly detection method to predict the future and achieve anomaly detection by fusing different development characteristics of electromagnetic environment situations learned by other branches. We extract the electromagnetic environment situation state and trend features using the manual feature extraction module and mine the electromagnetic environment situation in-depth data distribution features using ConvLSTM, improve the dynamic time regularization model according to the physical characteristics of electromagnetic space, and then provide the anomaly detection method. We experimentally demonstrate the effectiveness of the proposed method in electromagnetic environment situation prediction and anomaly detection accuracy.

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.