Yong Yan 0002

dblp:70/374-2 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0001-6052-1957ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2026 A Two-Stage Joint Decision Framework for Low-Latency XR Service Delivery Under Cloud-Edge-End Collaboration
Shao-Yong Guo 0001, Yinlin Ren, Yong Yan 0002, Feng Qi 0004
WCNC4
2022 LTSM: Lightweight and Trusted Sharing Mechanism of IoT Data in Smart City
abstract
With the development of smart cities, the chimney construction method can no longer meet service needs. It is extremely urgent to build a unified urban brain, and the core issue is data sharing and fusion. Aiming at the problems of data island, data leakage, and high trust cost in the IoT of the smart city, a lightweight and trusted sharing mechanism (LTSM) is proposed. First, the blockchain is combined with federated learning to realize the data sharing, which not only protects the private data, but also ensures the sharing process trust. Then, a node selection algorithm based on credit value and a node evaluation algorithm based on smart contract are designed to improve the quality of federated learning. Finally, we propose an improved raft consensus to meet the delay and security requirements of the consortium blockchain in the smart city scenario. In the simulation, we evaluate the federated learning algorithm, the node selection algorithm, and the improved raft consensus, respectively. The experimental results show that the LTSM mechanism has a good application value. The federated learning model has a better accuracy, but its training time is also longer. The node selection algorithm is helpful to improve the accuracy of the federated learning model. The improved raft consensus improves the throughput.
Chang Liu 0132, Shao-Yong Guo 0001, Song Guo 0001, Yong Yan 0002, Xuesong Qiu 0001, Suxiang Zhang
IEEE Internet Things J.4
2022 Secure Data Sharing: Blockchain-Enabled Data Access Control Framework for IoT
abstract
As Internet-of-Things (IoT) service becomes richer, data sharing among different IoT systems gets popular. The traditional IoT system provides data storage and access service with the central cloud, which faces serious trust and security challenges. To provide a cross-system data sharing service, we adopt blockchain to build a multicenter data management (DM) framework and construct a trustable environment for data sharing. As regards to a security problem, attribute-based encryption (ABE) has been applied to the IoT system, but it still relies on the central server. Therefore, we design an ABE algorithm that could be used for multicenter scenario and shift DM to blockchain instead of a central server. Moreover, IoT devices always cannot afford complex encrypt computations as they have limited computing resource. To solve this, we design an obfuscating policy to shift encryption computations to the cloud instead of terminals. In this way, IoT devices could encrypt data with low computation cost. Security analysis and simulations prove that the algorithm we designed could reduce computation burdens of IoT terminals in data encryption and decryption phases effectively and safely.
Yong Yan 0002, Shao-Yong Guo 0001, Xuesong Qiu 0001, Feng Qi 0004
IEEE Internet Things J.2
2021 A Computation Offloading Mechanism Based on Sharable Cache in Smart Community
Yong Yan 0002, Yang Yang 0006, Zhipeng Gao 0001, Xuesong Qiu 0001
IM2
2020 SLA-driven Creditable and Negotiable Resource optimized Allocation Scheme in Cloud
abstract
The cloud computing market is dynamic, distributed, and lacks central authorization. In this environment, cloud resource providers are vulnerable to deception and cloud resources may be abused. How to implement efficient and feasible trusted negotiations with users to expand Benefits is an urgent issue. Based on SLA (Service Level Agreement), this paper proposes a trusted negotiation method to optimize cloud resource allocation from the perspective of cloud resource providers. In a nutshell, it firstly quantifies each indicator based on the total amount of cloud resources requested by the user and the corresponding price, the user's comprehensive credit, and the total amount of resources corresponding to each SLA level, then filters the users who meet the requirements. Next knapsack algorithm and the greedy algorithm based on dynamic programming are used to predict the allocation of cloud resources respectively. Finally, the allocated users are negotiated to reach a transaction. This article takes the resource allocation price, negotiated price, and negotiated success rate as the evaluation index. The simulation results show that compared with the greedy algorithm, the algorithm in this paper has higher resource allocation price, negotiated price and negotiated success rate under different numbers of users, and can effectively realize the optimal allocation of cloud resources.
Peng Yu 0001, Yong Yan 0002, Haotian Qiu, Ying Wang 0002, Fanqin Zhou, Lei Feng 0001, Wenjing Li 0001, Xuesong Qiu 0001
IWCMC2
2020 Priority-Based Residential Energy Management With Collaborative Edge and Cloud Computing
abstract
Residential energy management (REM) is an important way to encourage users to reduce or shift energy demand with dynamic pricing. It could significantly affect the supply-demand relationship between electricity service providers (ESPs) and users, reduce energy cost and consumption, and contribute to sustainable development. To improve latency and processing performance, a three-tier edge-cloud collaborative REM (ECCREM) architecture is presented. In consideration of matching the architecture, a two-stage energy management mechanism is proposed with system reliability and resource utilization requirements taken into account. At the first stage, the interaction between real-time pricing and energy demand is modeled by a Stackelberg and Lyapunov-based pricing and energy demand joint optimization (SLPEDO) algorithm. At the second stage, two procedures, i.e., energy scheduling between a cloud tier and an access tier, and energy scheduling between an access tier and an infrastructure tier, are implemented. A priority-based demand ratio sequentially scheduling strategy is proposed to address energy scheduling in these two procedures, respectively. Simulation results show that compared with the existing demand ratio-based scheduling and equally scheduling strategies, the proposed strategy can improve overall satisfaction of users by up to 20%. In addition, energy cost can be reduced and demand fluctuation relieved.
Linna Ruan, Yong Yan 0002, Shao-Yong Guo 0001, Fushuan Wen, Xuesong Qiu 0001
IEEE Trans. Ind. Informatics2
2019 A Blockchain-Based Decentralized Wi-Fi Sharing Mechanism
Yao Dai, Yong Yan 0002, Shao-Yong Guo 0001, Sujie Shao
IM3