Feng Wang

Feng Wang


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
10 July 2023
Verified
Conference Paper
Open access
FWFeng Wang
Feng Wang
YLYang Lu
Yang Lu
QZQiang Zhang
Qiang Zhang
YLYang Liu
Yang Liu
LLLinlin Liu
Linlin Liu
ZZZhiruo Zhang
Zhiruo Zhang
The smart contract code facilitates, verifies, and enforces the negotiation or performance of an agreement or transaction. As a decentralized, difficult-to-be-tampered, and distributed computing platform, blockchain can ensure that a smart contract is strictly executed and not modified midway. Smart contracts endow the blockchain platform with programmability, which greatly expands the blockchain’s application fields. However, there are many common problems in the efficiency and flexibility of smart contract execution. In this paper, the characteristics and architectural model of the smart contract were introduced, and its development platform, and application scenarios were analyzed. In the end, we discussed the smart contract’s research direction and challenges.

1 January 2012
Verified
Book Chapter
Closed access
PDF file
LGLu Gang
Lu Gang
LYLiang Yitao
Liang Yitao
FWFeng Wang
Feng Wang
YZYin Zhenzhen
Yin Zhenzhen

25 August 2024 in IET Blockchain
Verified
Journal Article
Open access
YLYang Liu
Yang Liu
JCJingwen Chen
Jingwen Chen
MZMiaomiao Zhang
Miaomiao Zhang
SSShidong Shi
Shidong Shi
FWFeng Wang
Feng Wang
As the core technology of blockchain, consensus mechanisms play a crucial role in ensuring the consistency and reliability of blockchain systems. In a decentralized and open system environment like blockchain, traditional consensus algorithms are often unsuitable due to their inability to tolerate arbitrary faults such as malicious node behaviour. Consequently, Byzantine fault tolerance consensus algorithms have become a focal point in blockchain systems. However, as Byzantine fault tolerance consensus algorithms have evolved, they still face significant challenges, particularly in addressing issues related to network latency and throughput. This paper proposes a parallel pipeline‐based DAG schema for consensus in blockchain, Serein. Firstly, the Serein algorithm achieves functional partitioning of nodes, enhancing their scalability. Secondly, it employs a pipeline structure, allowing each block to proceed without waiting for the previous block's result, thereby reducing block generation latency. Lastly, the Serein algorithm leverages the advantages of the DAG block structure to achieve concurrent block ordering and submission, improving system throughput. Experimental results demonstrate that the proposed Serein algorithm maintains robust performance under conditions of high transaction volume with multiple nodes, effectively enhancing consensus efficiency while ensuring Byzantine fault‐tolerant security.

4 October 2013 in Lecture Notes in Electrical Engineering
Verified
Book Chapter
Closed access
PDF file
FWFeng Wang
Feng Wang
ZXZhaohui Xu
Zhaohui Xu
TZTong Zhen
Tong Zhen
XZXiaoming Zhang
Xiaoming Zhang
MZMeng Zhang
Meng Zhang

1 January 2023 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
ZZZhiruo Zhang
Zhiruo Zhang
FWFeng Wang
Feng Wang
YLYang Liu
Yang Liu
YLYang Lu
Yang Lu
XLXinlei Liu
Xinlei Liu
The consensus protocol is one of the core technologies in blockchain, which plays a crucial role in ensuring the block generation rate, consistency, and safety of the blockchain system. Blockchain systems mainly adopt the Byzantine Fault Tolerance (BFT) protocol, which often suffers from slow consensus speed and high communication consumption to prevent Byzantine nodes from disrupting the consensus. In this paper, this paper proposes a new dual-mode consensus protocol based on node identity authentication. It divides the consensus process into two subprotocols: Check_BFT and Fast_BFT. In Check_BFT, the replicas authenticate the primary’s identity by monitoring its behaviors. First, assume that the system is in a pessimistic environment, Check_BFT protocol detects whether the current environment is safe and whether the primary is an honest node; Enter the fast consensus stage after confirming the environmental safety, and implement Fast_BFT protocol. It is assumed that there are nodes in total. If more than nodes identify that the primary is honest, it will enter the Fast_BFT process. In Fast_BFT, the primary is allowed to handle transactions alone, and the replicas can only receive the messages sent by the primary. The experimental results show that the CF-BFT protocol significantly reduces the communication overhead and improves the throughput and scalability of the consensus protocol. Compared with the SAZyzz protocol, the throughput is increased by 3 times in the best case and 60% in the worst case.

25 November 2023
Verified
Book Chapter
Closed access
PDF file
ZZZhiruo Zhang
Zhiruo Zhang
FWFeng Wang
Feng Wang
YLYang Liu
Yang Liu
YLYang Lu
Yang Lu
XLXinlei Liu
Xinlei Liu