liu yan chao

Dr. liu yan chao

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
27 November 2024 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
XZXuemin Zhang
Xuemin Zhang
DHDelin Hou
Delin Hou
ZXZenggang Xiong
Zenggang Xiong
LCliu yan chao
liu yan chao
SWShihui Wang
Shihui Wang
YLYuan Li
Yuan Li
With the rapid development of the Mobile Edge Computing (MEC) and the Internet of Things (IoT), intelligent interconnectivity and data exchange between devices have become feasible, bringing about the need for efficient energy management and complex network communication strategies. This paper proposes an Energy-Aware Low-Latency Routing Data Driven Model in Mobile Edge Computing (EALLR). This model introduces edge nodes that can perform computation and data processing close to the data source, thereby reducing latency and bandwidth consumption, optimizing data transmission paths, and ensuring that messages reach the target nodes quickly and efficiently. It overcomes the challenges posed by the social attributes of nodes, the diversity of network topology, and energy constraints. EALLR utilizes constraints on social strength between nodes, energy status, packet size, and message Time-To-Live (TTL) to optimize routing decisions. By optimizing the selection of routes with minimal energy consumption and adjusting the transmission strategy based on the size of the data packet, the algorithm enhances network energy efficiency and overall transmission efficiency. Simulation tests have proven that EALLR significantly reduces transmission delay while improving message delivery rates, especially in resource-limited and topologically complex network environments, demonstrating superior performance.

17 February 2024 in Journal of Signal Processing Systems
Verified
Journal Article
Closed access
PDF file
XZXueming Zhang
Xueming Zhang
HDHaitao Deng
Haitao Deng
ZXZenggang Xiong
Zenggang Xiong
LCliu yan chao
liu yan chao
YRYing Rao
Ying Rao
YLYoufeng Li
Youfeng Li

1 August 2024 in Electronics
Verified
Journal Article
Open access
PDF file
XZXuemin Zhang
Xuemin Zhang
YLYuan Li
Yuan Li
ZXZenggang Xiong
Zenggang Xiong
LCliu yan chao
liu yan chao
SWShihui Wang
Shihui Wang
DHDelin Hou
Delin Hou
In socially aware networking, nodes typically behave selfishly due to resource constraints and social correlations, resulting in low network performance. To incentivize selfish nodes to actively participate in message forwarding, this paper proposes a resource-based dynamic pricing and forced forwarding incentive algorithm (DFIA). Firstly, the algorithm introduces virtual currency as a transaction medium and then designs a pricing function based on factors such as the node’s resource status, participation contribution, location relevance, and social connectivity. It ensures that the forwarding service is transacted at a reasonable price through bargaining rules. Secondly, a forced forwarding strategy is implemented to compel selfish nodes, which are unwilling to participate in other nodes’ message forwarding, to forward a certain number of non-local messages. Meanwhile, in order to prevent nodes from discarding messages and to ensure successful forwarding to the destination, specific rules are used to allocate contribution values to nodes that successfully participate in message forwarding. Lastly, to avoid false quotation behavior, blockchain technology is employed. Transaction information is packaged into blocks and added to the blockchain after consensus validation by other nodes in the network, ensuring the transparency and immutability of transaction data. Simulation results indicate that compared with the existing incentive algorithms, this algorithm not only enhances message delivery probability but also effectively reduces average latency.

27 May 2024 in Journal of Signal Processing Systems
Verified
Journal Article
Closed access
PDF file
ZXZhang Xuemin
Zhang Xuemin
DHDeng Haitao
Deng Haitao
ZXZenggang Xiong
Zenggang Xiong
YRYing Rao
Ying Rao
LCliu yan chao
liu yan chao
HDHou Delin
Hou Delin

28 August 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
LCliu yan chao
liu yan chao
PZPengzhou Zhang
Pengzhou Zhang
LSLei Shi
Lei Shi
JGJunpeng Gong
Junpeng Gong
Information dissemination refers to how information spreads among users on social networks. With the widespread application of mobile communication and internet technologies, people increasingly rely on information on the internet, and the mode of information dissemination is constantly changing. Researchers have performed various studies from mathematical modeling and cascade prediction perspectives to explore the previous problem. However, lacking a comprehensive review of the latest information dissemination models hinders scientific development. As a result, it is essential to review the latest models or methods. In this paper, we review information dissemination models from the past three years and conduct a detailed analysis, such as explanatory and predictive models. Moreover, we provide public datasets, evaluation metrics, and interface tools for researchers focusing more on algorithm design and modeling. Finally, we discuss the model application and future research directions. This paper aims to understand better the research progress and development trends for beginners and guide future research endeavors. We believe this article will attract more researchers’ interest and attention to the information dissemination field on social networks.

27 April 2025 in Information Processing & Management
Verified
Journal Article
Closed access
LCliu yan chao
liu yan chao
QSQing Song
Qing Song
WSWenchao Song
Wenchao Song
PZPengzhou Zhang
Pengzhou Zhang
CZChi Zhang
Chi Zhang