Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Minghua Yuan

dblp:310/6271 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · conflict

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

Computer networks · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Edge and fog computing · 67% Network optimization and economics · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › mobile edge computing
computation offloading
0.912025
Online Collaborative Resource Allocation and Task Offloading for Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2025
Edge and fog computing
mobile edge computing
0.912025
Online Collaborative Resource Allocation and Task Offloading for Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2025
Network optimization and economics
resource allocation
0.912025
Online Collaborative Resource Allocation and Task Offloading for Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2025
Distributed systems › edge computing
cloud-edge collaboration
0.312025
Online Collaborative Resource Allocation and Task Offloading for Multi-Access Edge Computing · IEEE Trans. Mob. Comput. 2025

Methods — techniques the papers use, named apart from their topics

tammer decomposition · 1.7lyapunov optimization · 1.7dependent rounding · 1.7convex optimization · 1.7bilateral matching · 1.7
YearPublicationVenuePosition
2025 Online Collaborative Resource Allocation and Task Offloading for Multi-Access Edge Computing
abstract
Multi-access edge computing (MEC) is emerging as a promising paradigm to provide flexible computing services close to user devices (UDs). However, meeting the computation-hungry and delay-sensitive demands of UDs faces several challenges, including the resource constraints of MEC servers, inherent dynamic and complex features in the MEC system, and difficulty in dealing with the time-coupled and decision-coupled optimization. In this work, we first present an edge-cloud collaborative MEC architecture, where the MEC servers and cloud collaboratively provide offloading services for UDs. Moreover, we formulate an energy-efficient and delay-aware optimization problem (EEDAOP) to minimize the energy consumption of UDs under the constraints of task deadlines and long-term queuing delays. Since the problem is proved to be non-convex mixed integer nonlinear programming (MINLP), we propose an online joint communication resource allocation and task offloading approach (OJCTA). Specifically, we transform EEDAOP into a real-time optimization problem by employing the Lyapunov optimization framework. Then, to solve the real-time optimization problem, we propose a communication resource allocation and task offloading optimization method by employing the Tammer decomposition mechanism, convex optimization method, bilateral matching mechanism, and dependent rounding method. Simulation results demonstrate that the proposed OJCTA can achieve superior system performance compared to the benchmark approaches.
Geng Sun 0001, Minghua Yuan, Zemin Sun, Jiacheng Wang 0001, Hongyang Du 0001, Dusit Niyato, Zhu Han 0001, Dong In Kim 0001
IEEE Trans. Mob. Comput.2
2024 A Robust ECC-Based Authentication and Key Agreement Protocol for 6G-Based Smart Home Environments
abstract
With the rapid evolution of wireless communication technology, smart homes have significantly improved the quality of peoples daily lives by taking advantage of the low latency and high transmission rates of 6G communication technology. Users can now conveniently manage the consumer electronics remotely. However, in the pratical smart home scenarios, the users and consumer electronics communicate with each other through an open public channels where charted and uncharted security risks and privacy vulnerabilities exist. To protect users confidential data from malicious interception and modification, diverse authentication protocols have been proposed so far. However, existing protocols often suffer from efficiency issues or vulnerabilities to known attacks. To address these challenges, this paper proposes a novel three-factor ECC-based anonymous authentication protocol. The protocols security properties can be rigorously proven using the formal analysis under the ROR model. Subsequently, the resistance to numerous types of attacks, including man-in-the-middle and replay attacks, can be demonstrated through informal analysis and the AVISPA verification process. Finally, the protocol is compared with the state-of-the-arts and the results show that the protocol strikes a good balance between security and efficiency and is well suited for smart home environments.
Minghua Yuan, Haowen Tan, Wenying Zheng, Pandi Vijayakumar, Fayez Alqahtani 0001, Amr Tolba
IEEE Internet Things J.1
2022 Self-adaptive resources allocation-based differential evolution for constrained evolutionary optimization
Kangjia Qiao, Jing J. Liang, Kunjie Yu, Minghua Yuan, Bo-Yang Qu 0001, Caitong Yue
Knowl. Based Syst.4