yu song

Ms. yu song

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
8 June 2023 in Electronics
Verified
Journal Article
Open access
PDF file
YSyu song
yu song
AXAo Xiong
Ao Xiong
XQXuesong Qiu
Xuesong Qiu
Shaoyong GuoShaoyong Guo
Shaoyong Guo
DWDong Wang
Dong Wang
YKYue Kuang
Yue Kuang
Carbon trading is an effective way to achieve carbon neutrality. It is a market mechanism aimed at reducing global greenhouse gas emissions and carbon dioxide emissions. Blockchain technology can be applied to the carbon-trading scenario using characteristics that guarantee the security, decentralization, data immutability, and data traceability of the carbon-trading process. It would be difficult to implement carbon trading on blockchains for all enterprises and individuals, as the current performance of blockchains does not meet the requirements. There has been extensive research conducted on blockchain performance optimization, and the off-chain payment channel is one of the more mature solutions. This approach involves the transfer of transactions to off-chain transactions, thus avoiding high transaction fees. Existing research has addressed the problem of routing security and efficiency, with less emphasis on factors such as routing transaction costs, node reputation, and routing path considerations. This paper researches the optimization of payment routing in Payment Channel Networks (PCNs) and proposes the Multi-Factor Routing Payment Scheme (MFPS), which integrates factors such as the node reputation, transaction fee cost, and distance to select the route for payment transactions. In order to improve the success ratio of routing transactions, the transaction-splitting algorithm is proposed. To ensure the security and privacy of the transaction process, the Asymmetric Time-Lock Contract (ATLC) protocol is proposed. The results of extensive experimental simulations show that the MFPS proposed in this paper outperforms the ShortestPath, Cheapest, and SplitDistance algorithms. It achieves an approximately 13.8%∼49% improvement in the transaction success ratio and reduces the average transaction processing cost. The security and privacy measures can defend against wormhole and double-flower attacks and exhibit better performance in terms of computational verification and message overhead.

9 December 2025 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
YSyu song
yu song
YRYinlin Ren
Yinlin Ren
XQXuesong Qiu
Xuesong Qiu
AXAo Xiong
Ao Xiong
Shaoyong GuoShaoyong Guo
Shaoyong Guo
Artificial Intelligence Generated Content (AIGC) plays a key role in shaping the emerging metaverse ecosystem through its ability to efficiently and automatically generate large scale, personalized content. While high-quality AIGC generation under a cloud-edge-end three-layer architecture has attracted significant research attention, existing approaches often overlook trust challenges throughout the AIGC service lifecycle namely, in model provision, Service Provider (SP) selection, and product transaction. To address these issues, we introduce blockchain technology and propose a cloud-edge collaborative, blockchain oriented AIGC service architecture (CEAIGC). This architecture ensures secure and trustworthy interactions among AIGC model providers, SPs, and users. Specifically, we design embedded watermark coding rules for AIGC models and use blockchain to verify consistency between cloud and edge models, providing a reliable foundation for SPs. To further support trustwor thy SP selection, we formulate a multi-objective optimization problem that considers user utility, SP reputation, and energy consumption. We then propose a diffusion-model-enhanced Deep Reinforcement Learning (DRL) algorithm (DMA3C) to optimize SP selection and adaptively match metaverse user needs, enabling reliable, low-latency AIGC inference at the edge. To overcome blockchain performance bottlenecks, we employ a smart contract engine to establish state channels between transaction users. This enables efficient, secure, and atomic off-chain transfers of AIGC product ownership and service fees. Extensive experiments demonstrate that CEAIGC improves system throughput by 2.38×, and the proposed DMA3C algorithm achieves performance gains of 11.4% to 28.6% compared to other DRL-based approaches.

25 April 2023 in Electronics
Verified
Journal Article
Open access
PDF file
ZWZuhao Wang
Zuhao Wang
YYYanhua Yu
Yanhua Yu
DLDi Liu
Di Liu
WLWenjing Li
Wenjing Li
AXAo Xiong
Ao Xiong
YSyu song
yu song
The emergence of computing power networks has improved the flexibility of resource scheduling. Considering the current trading scenario of computing power and network resources, most resources are no longer subject to change after being allocated to users until the end of the lease. However, this practice often leads to idle resources during resource usage. To optimize resource allocation, a trading mechanism is needed to encourage users to sell their idle resources. The Myerson auction mechanism precisely aims to maximize the seller’s benefits. Therefore, we propose a resource allocation scheme based on the Myerson auction. In the scenario of the same user bidding distribution, we first combine the Myerson auction with Hyperledger Fabric by introducing a reserved price, which creates conditions for the application of blockchain in auction scenarios. Regarding different user bidding distributions, we propose a Myerson auction network model based on clustering algorithms, which makes the auction adaptable to more complex scenarios. The experimental findings show that the revenue generated by the auction model in both scenarios is significantly higher than that of the traditional sealed bid second-price auction, and can approach the expected revenue in the real Myerson auction scenario.

13 November 2024
Verified
Book Chapter
Closed access
PDF file
YSyu song
yu song
AXAo Xiong
Ao Xiong
DWDong Wang
Dong Wang
DLDa Li
Da Li
XLXiaokang Liu
Xiaokang Liu
QGQinglei Guo
Qinglei Guo

1 March 2025 in Chinese Journal of Electronics
Verified
Journal Article
Closed access
AXAo Xiong
Ao Xiong
WZWang Zhang
Wang Zhang
YSyu song
yu song
DWDong Wang
Dong Wang
DLDa Li
Da Li
DBDesheng Bai
Desheng Bai
Blockchain technology has broad application prospects in many fields due to its unique characteristics such as decentralization, traceability, and tamper-proofing, and has become a research hotspot in recent years. As a key component of blockchain technology, the consensus algorithm is one of the important factors affecting blockchain performance. Many consensus algorithms currently used in consortium chains are based on timing assumptions and lack horizontal scalability. That is to say, these algorithms cannot reach an agreement in an asynchronous network where the receiving time of network packets is uncertain, and their efficiency decreases as the number of nodes increases, which hinders the large-scale application of the consortium chain. In order to solve the above problems, this paper proposes the dynamic sharding Dumbo (DS-Dumbo) algorithm, an asynchronous consensus algorithm that integrates dynamic sharding strategies, based on the currently excellent Dumbo Byzantine fault tolerance (DumboBFT) asynchronous consensus algorithm. The main work of this paper revolves around how to fragment and optimize the consensus process. This paper designs a node asynchronous sharding model based on multi-dimensional weights, so that the re-sharding work of each blockchain node can be executed concurrently with the asynchronous consensus algorithm, reducing the conflict between blockchain sharding and asynchronous consensus algorithms. We also designed an intelligent transaction placement strategy, which calculates the relevance score of each transaction for all shards to determine which shard the transaction is processed in order to reduce the number of complex cross-shard transactions. We optimized the execution process of the DumboBFT algorithm, converted its internal synchronous working mode to an asynchronous working mode, and reduced the consumption of consensus work to a certain extent. The experimental evaluation shows that the DS-Dumbo algorithm has higher throughput and lower delay than the DumboBFT algorithm, can increase the throughput with the increase of nodes, and has the ability of horizontal expansion.

1 January 2026 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YSyu song
yu song
YRYinlin Ren
Yinlin Ren
Shaoyong GuoShaoyong Guo
Shaoyong Guo
AXAo Xiong
Ao Xiong
XQXuesong Qiu
Xuesong Qiu
Celimuge WuCelimuge Wu
Celimuge Wu