Yixin Chen

Yixin Chen

Auto-generated profile, based on publicly available information

Yixin Chen

Guangxi Key Laboratory of Multimedia Communications and Network Technology, School of Computer, Electronics and Information, Guangxi University, Nanning, Guangxi, China

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
11 March 2024 in Future Generation Computer Systems
Verified
Journal Article
Closed access
JZJiali Zheng
Jiali Zheng
YCYixin Chen
Yixin Chen
QLQijia Lai
Qijia Lai

25 October 2022 in IEEE Sensors Journal
Verified
Journal Article
Closed access
MFMinyu Feng
Minyu Feng
JZJiali Zheng
Jiali Zheng
SHSiyi He
Siyi He
JXJincheng Xie
Jincheng Xie
YCYixin Chen
Yixin Chen
In this paper, a credit identity ring optimization Blockchain algorithm (CRBFT) based on Practical Byzantine Fault Tolerance (PBFT) is proposed to address the security problem for the network of Internet of things (IoT). The contributions of this work are as following: firstly, combined with the Edge Computing architecture, CRBFT introduces the improved credit grading protocol and improved ring signature scheme into the Blockchain network, rewards or punishes the nodes through their behavior, changes the way of selecting the primary node and ensures that the identity of the primary node will not be disclosed, so as to prevents the primary node from adaptively attack by Byzantine nodes, improves the reliability of the nodes participating in the consensus and enhances the security of the system; secondly, in order to reduce the communication traffic among nodes, CRBFT optimize the consensus protocol, not only reduces the time complexity of the traffic in the consensus stage from O (n 2 ) to O (n), but also improves the consensus efficiency of the system while ensuring the system security; finally, aims to measure the performance of CRBFT, this paper is simulated and tested in three aspects: throughput (transactions per second), consistency delay, and communication overhead. Performance evaluation shows that CRBFT achieves lower communication overhead than PBFT. When the number of nodes is the same, CRBFT can obtain higher TPS and lower consistency delay. The results show that compared with PBFT, CRBFT can provide very competitive results.