Yue Han

Yue Han

Auto-generated profile, based on publicly available information

Yue Han

The School of Information and Communication, National University of Defense Technology,Wuhan,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
23 August 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YHYue Han
Yue Han
DNDusit Niyato
Dusit Niyato
CLCyril Leung
Cyril Leung
DKDong In Kim
Dong In Kim
Kun ZhuKun Zhu
Kun Zhu
CMChunyan Miao
Chunyan Miao
Metaverse, also known as the Internet of 3-D worlds, has recently attracted much attention from both academia and industry. Each virtual subworld, operated by a virtual service provider (VSP), provides a type of virtual service. Digital twins (DTs), namely, digital replicas of physical objects, are key enablers. Generally, a DT belongs to the party that develops it and establishes the communication link between the two worlds. However, in an interoperable metaverse, data-like DTs can be “shared” within the platform. Therefore, one set of DTs can be leveraged by multiple VSPs. As the quality of the shared DTs may not always be satisfying, in this article, we propose an agile solution, i.e., a dynamic hierarchical framework, in which a group of Internet of Things devices in the lower level are incentivized to collectively sense physical objects’ status information and VSPs in the upper level determine synchronization intensities to maximize their payoffs. We adopt an evolutionary game approach to model the devices VSP selections and a simultaneous differential game to model the optimal synchronization intensity control problem. We further extend it as a Stackelberg differential game by considering some VSPs to be first movers. We provide open-loop solutions based on the control theory for both formulations. We theoretically and experimentally show the existence, uniqueness, and stability of the equilibrium to the lower level game and further provide a sensitivity analysis for various system parameters. Experiments show that the proposed dynamic hierarchical game outperforms the baseline.

14 January 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YHYue Han
Yue Han
DNDusit Niyato
Dusit Niyato
CLCyril Leung
Cyril Leung
CMChunyan Miao
Chunyan Miao
DKDong In Kim
Dong In Kim
Recently, coded distributed computing (CDC), with advantages in intensive computation and reduced latency, has attracted a lot of research interest for edge computing, in particular, IoT applications, including IoT data preprocessing and data analytics. Nevertheless, it can be challenging for edge infrastructure providers (EIPs) with limited edge resources to support IoT applications performed in a CDC approach in edge networks, given the additional computational resources required by CDC. In this article, we propose “coded edge federation” (CEF), in which different EIPs collaboratively provide edge resources for CDC tasks. To study the Nash equilibrium, when no EIP has an incentive to unilaterally alter its decision on edge resource allocation, we model the CEF based on the evolutionary game theory. Since the replicator dynamics of the classical evolutionary game are unable to model economic-aware EIPs, which memorize past decisions and utilities, we propose “fractional replicator dynamics” with a power-law fading memory via Caputo fractional derivatives. The proposed dynamics allow us to study a broad spectrum of EIP dynamic behaviors, such as EIP sensitivity and aggressiveness in strategy adaptation, which classical replicator dynamics cannot capture. Theoretical analysis and extensive numerical results justify the existence, uniqueness, and stability of the equilibrium in the fractional evolutionary game. The influence of the content and the length of the memory on the rate of convergence are also investigated.

21 July 2023
Verified
Conference Paper
Closed access
YHYue Han
Yue Han
MYMingyu Yao
Mingyu Yao
YYYang Yang
Yang Yang
YSYouwei Shi
Youwei Shi
MCMin Cao
Min Cao
QWQingnan Wang
Qingnan Wang
On the basis of Time-Trigger Protocol (TTP), Time Triggered Ethernet (TTE) inherits the characteristics of the popularity, maturity and flexibility of traditional Ethernet technology, so as to support the comprehensive transmission of various services with different properties, high reliability and high performance in the same network. For the precise global clock synchronization to ensure the service quality of high priority services, TTE has gradually been widely used in aerospace, rail transit, automotive vehicle driving and other fields. Traffic scheduling is a key issue of TTE technology to meet the deterministic network performance. In this paper, network calculus theory is applied to the performance analysis of schedule partition and schedule porosity method with different ratios of Time-Triggered (TT) and Rate-Constraint (RC) traffics. We focus on the latency of RC frames under the condition that the TT traffic transmission requirements are firstly met. The simulation results justify the analysis validation. It is shown that neither of two methods is not always work well for ever, which it depends on the amount of TT traffics in the total traffics.