Siyu Lin

Prof. Dr. Siyu Lin


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
9 December 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
WFWeiyang Feng
Weiyang Feng
SLSiyu Lin
Siyu Lin
NZNing Zhang
Ning Zhang
GWGongpu Wang
Gongpu Wang
BABo Ai
Bo Ai
LCLin Cai
Lin Cai
Emerging intelligent transportation services are latency-sensitive with heavy demand for computing resources, which can be supported by a multi-tier computing system composed of vehicular edge computing (VEC) servers along the roads and micro servers on vehicles. In this work, we investigate the dual Uu/PC5 interface offloading and resource allocation strategy in Cellular Vehicle-to-Everything (C-V2X) enabled multi-tier VEC system. The successful transmission probability is characterized to obtain the normalized transmission rate of PC5 interface. We aim to minimize the system latency of task processing while satisfying the resource requirements of Uu and PC5 interfaces. Due to the non-convex and variables coupling, we decompose the original problem into two subproblems, i.e., resource allocation and offloading strategy subproblems. Specifically, we derive the closed-form expressions of packet transmit frequency of PC5 interface, transmission power of Uu interface, and CPU computation frequency in the resource allocation subproblem. Moreover, for the offloading strategy subproblem, the offloading ratio matrix is obtained by proposing the PC5 interface based greedy offloading (PC5-GO) algorithm, which concludes offloading decision and ratio. Simulation results are provided that the proposed PC5-GO algorithm can significantly improve the system performance compared with other baseline schemes by 13.7% at least.

20 January 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
SLShichao Li
Shichao Li
SLSiyu Lin
Siyu Lin
LCLin Cai
Lin Cai
WLWenjie Li
Wenjie Li
GZGang Zhu
Gang Zhu
Vehicular edge computing (VEC) is considered as a novel paradigm to enhance the safety of automated vehicles and intelligent transportation systems (ITS). The computation offloading strategies are the key point of VEC, and the effect of time-varying channels cannot be ignored during the task transmission period. This paper investigates the utility maximization problem with task delay requirement constraints, in which the influence of time-varying channel on the task offloading strategies during the task offloading period is considered. The time-varying fading channel leads to the time-varying spectrum efficiency (SE), so the previous offloading strategies are questionable when the additional uncertain allocated bandwidth is taken into account. To deal with it, we first propose a linearization based Branch and Bound (LBB) algorithm to solve the fixed SE problem without considering the time-varying channel characteristics. Considering the complexity of the LBB algorithm, a closest rounding integer (CRI) algorithm is proposed to solve the fixed SE problem. Then, based on the resource allocation strategies of the fixed SE problem, we propose the LBB based computation offloading (LBBCO) algorithm and the CRI based computation offloading (CRICO) algorithm to solve the original problem for both the static tasks and dynamic tasks. The proposed LBBCO/CRICO algorithms are also applicable to multi-vehicle and multi-task scenarios. Furthermore, we analyze the effect of small-scale fading on the proposed offloading strategies. The simulation results show that the average utilities of LBBCO and CRICO algorithms have a small gap by 3.93% and 6.13% only to the upper bound, respectively. Meanwhile, the proposed LBBCO and CRICO algorithms can outperform the previous state-of-the-art solution by 4.52% and 2.38%, respectively.

15 February 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
WFWeiyang Feng
Weiyang Feng
NZNing Zhang
Ning Zhang
SLShichao Li
Shichao Li
SLSiyu Lin
Siyu Lin
RNRuirui Ning
Ruirui Ning
YGYuan Gao
Yuan Gao
Cooperative Vehicle-Infrastructure System (CVIS) can provide innovative services for traffic management and enable trips to be safer, more coordinated, and smarter. In the CVIS, the vehicles upload crowd sensing data to the Vehicular Edge Computing (VEC) server for quick data fusion and informed decision-making. However, with the ever-increasing number of vehicles, the VEC server cannot undertake massive computation-intensive tasks due to the limited edge computing capabilities. In this paper, we propose a reverse offloading framework that can fully utilize the vehicular computation resource to relieve the burden of the VEC server and further reduce the system latency. Under the proposed offloading framework, the binary reverse offloading (BRO) and partial reverse offloading (PRO) strategies are designed for two types of tasks, i.e., non-partitioned tasks and partitioned tasks. We formulate the system latency minimization problem by optimizing reverse offloading decisions, and the communication and computation resources allocation. Due to the non-convex and existing variables coupling, the original problem is transformed into the equivalent weighted-sum optimization problem. Based on the alternative optimization, we decouple the weighted-sum optimization problems into the two subproblems, and the closed-form expressions of transmission power and computation frequency of vehicles and RSU are derived. Low complexity greedy based efficient searching (GES) algorithm and joint alternative optimization based bi-section searching (JAOBSS) algorithm are proposed for BRO and PRO strategies, respectively. The algorithm complexity and performance bounds are analyzed. Simulation results show that the proposed GES algorithm can achieve optimal performance with low complexity. Besides, the proposed GES and JAOBSS algorithms can significantly improve the performance compared with other baseline schemes by 6.14% and 13.46% at least.

18 September 2020 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
HWHongwei Wang
Hongwei Wang
QZQianqian Zhao
Qianqian Zhao
SLSiyu Lin
Siyu Lin
DCDongliang Cui
Dongliang Cui
CLChengcheng Luo
Chengcheng Luo
TTTao Tang
Tao Tang
Virtually coupled train sets (VCTS) have been proposed to increase the transportation capacity and the flexibility of railway organization. Due to the lack of reliable wireless communications and accurate perceptual information, the promotion of VCTS was challenged. With the development of industrial Internet of Things (IIoT), an IIoT-based VCTS is built in the article based on the popular communication-based train control architecture. Considering the dynamic and complex operation environment, it is difficult to achieve the efficient cooperative control of VCTS. The reason is that the traditional method is frequently trapped into a local optimization. To resolve the problem, we apply reinforcement learning (RL) to obtain an optimal policy for the IIoT-based VCTS, where the traditional artificial potential field (APF) is taken to develop the reward function. RL can thus search the global optimal policy, whereas APF can help RL to reduce the computation complexity. This can substantially increase the efficiency of the proposed approach. Simulation results confirmed that the proposed RL-based cooperative control approach would bring excellent performance in the IIoT-based VCTS.

26 November 2019 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
LKLinghe Kong
Linghe Kong
WQWenhao Qu
Wenhao Qu
JYJiadi Yu
Jiadi Yu
HZHua Zuo
Hua Zuo
GCGuihai Chen
Guihai Chen
MQMeikang QIU
Meikang QIU
Fuzzy rough set based feature selection is an impor- tant technique for big data analysis. However, the classic fuzzy rough set algorithm takes all the data correlations into account, which leads to the centralized computing mode, requiring high computing and memory space resources. With the increasing amount of data in the big data era, the centralized server cannot afford the computing of fuzzy rough set. To enable the fuzzy rough set for big data analysis, in this paper, we propose the novel Distributed Fuzzy Rough Set (DFRS) based feature selection, which separates and assigns the tasks to multiple nodes for parallel computing. The key challenge is to maintain the global information on each distributed node without conserving the entire fuzzy relation matrix. We tackle this challenge by a dynamic data decomposition algorithm and a data summarization process on each distributed node. Extensive experiments based on multiple real datasets demonstrate that DFRS significantly improves the runtime and its feature selection accuracy is nearly the same as the traditional centralized computing.

2 March 2020 in IEEE Access
Verified
Journal Article
Open access
YZYang Zhou
Yang Zhou
QSQiang Sun
Qiang Sun
SLSiyu Lin
Siyu Lin