Shancheng Zhao

Prof. Dr. Shancheng Zhao


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
2 April 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
SZShancheng Zhao
Shancheng Zhao
Recently, coded computation has emerged as a promising technique to reduce the influence of straggling computing nodes in distributed computing systems. However, most existing works neglect the time cost of communicating messages from the client to the computing nodes. Besides straggling computing nodes, straggling receivers also have significant influence on the total computing time, especially in edge computing systems, in which the client and the edge computing nodes are connected through wireless links. Motivated by this observation, we propose in this paper a new sub-task assignment method based on edge node selection to reduce the total computing time for coded edge computing systems. In the proposed method, a sub-task is assigned to the first computing node which decodes the associated messages of the sub-task successfully. Comprehensive numerical results are presented, which show that, with the proposed assignment method, the overall computing time can be reduced. We also show that further reduction can be achieved if additional edge nodes are available.

21 July 2016 in IEEE Communications Letters
Verified
Journal Article
Closed access
SZShancheng Zhao
Shancheng Zhao
Dimming control is desirable for visible light communication (VLC) systems to provide different levels of brightness. In this letter, we propose a new coding scheme for dimmable VLC systems based on serial concatenation of column-scaled (CS) low-density parity-check (LDPC) codes and constant weight codes (CWCs). In the proposed scheme, the cardinality of the finite field on which the CS LDPC code is defined varies adaptively according to the CWC. Hence, transformation between symbol metrics and bit metrics is avoided. Other advantages of the proposed scheme are described as follows: 1) its coding rates are not constrained by the dimming range as error control and dimming control are decoupled; 2) it can be easily configured to support a wide range of dimming targets; and 3) it requires essentially the same hardware architecture to implement the encoder/decoder pair. Hence, the proposed coding scheme provides an attractive candidate for VLC systems with both error and dimming control.

10 March 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
XHXiujie Huang
Xiujie Huang
YCYuhao Chen
Yuhao Chen
Zhiquan LiuZhiquan Liu
Zhiquan Liu
SZShancheng Zhao
Shancheng Zhao
ZLZhetao Li
Zhetao Li
QGQuanlong Guan
Quanlong Guan
Vehicular edge computing (VEC) is an efficient solution to alleviate the limitations of local computing resources in vehicular networks. However, the high mobility of vehicles and the dynamic variability of network topologies make it significantly challengeable. In this work, we make a fusion of model-driven and data-driven intelligence to design a multi-agent deep reinforcement learning (DRL) solution for task offloading in urban VEC networks. First, computational models for task queue, transmission, computation, energy consumption, and expense are meticulously developed for the VEC network that integrates communication and computation. Vehicular tasks vary in type, urgency, size, and timeframe, leading to different latency requirements. Tasks may be executed locally within the vehicle, at a server after V2I offloading via cellular communications, or in a neighboring vehicle after V2V offloading via millimeter-wave (mmWave) communications. Each of these options incurs different levels of latency, energy consumption, and expense. Second, based on these models and the utility function that combines latency, energy consumption, and expense, an optimization problem for task offloading is formulated. This problem can be interpreted as a Markov decision process with a carefully designed reward function. Third, to address the offloading problem, we propose a multi-agent proximal policy optimization-based task and target selection algorithm (MAPPO-TTSA). This algorithm also utilizes convolutional neural networks to extract features from large-scale states, thereby enhancing their correlation. Fourth, comprehensive training is performed on the observational data to determine the optimal parameters for predicting task offloading. Finally, extensive experiments are conducted, and simulation results are provided to demonstrate that the proposed intelligent task offloading scheme offers significant advantages in terms of average task completion delay and utility level across various scenarios.

13 January 2020 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SZShancheng Zhao
Shancheng Zhao
Jinming WenJinming Wen
Jinming Wen
Shahid MumtazShahid Mumtaz
Shahid Mumtaz
SGSahil Garg
Sahil Garg
Bong Jun ChoiBong Jun Choi
Bong Jun Choi
For industrial Internet of Things (IIoT), data trustworthiness should be maintained both at the time of sensing and at the time of transmission. This article is concerned with trustworthiness during transmission, which is determined by transmission reliability. We present a low-complexity and flexible method via partial and recursive superposition to improve the transmission reliability of IIoT, resulting in an IIoT with high trustworthiness. In our method, a portion of the previously transmitted data are superimposed onto the current transmitted data to introduce memory among different transmissions, which are then exploited by the windowed decoder to obtain performance gain. The proposed method is referred to as partially recursive block Markov superposition transmission of low-density parity-check (PrBMST-LDPC) codes. This article is focused on the construction of low-complexity PrBMST-LDPC codes since IIoT is resource-limited in nature. The first construction is the memory-one PrBMST-LDPC code. We present a simplified density evolution algorithm to optimize the superposition ratio for memory-one PrBMST-LDPC code. Both the analytical and numerical results show that PrBMST with memory one can be used to reduce the packet loss ratio (PLR) of IIoT using LDPC codes. Particularly, around 1.0 dB performance gain is obtained by PrBMST. We then present a low-complexity construction for PrBMST-LDPC codes with encoding memory larger than one. Simulation results show that compared with memory-one PrBMST, a further PLR reduction of around one order of magnitude can be obtained.

21 June 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XZXinwei Zhao
Xinwei Zhao
SZShancheng Zhao
Shancheng Zhao
XMXiao Ma
Xiao Ma
Tiled diagonal zipper codes (TDZCs) are shown to be a class of competitive forward error correction codes in modern optical fiber communication systems. This paper introduces the multichain tiled diagonal zipper codes (MC-TDZCs) in which multiple TDZC chains are coupled together in a cyclic manner. Firstly, we present the encoding and decoding algorithms of the proposed MC-TDZCs. Secondly, we analyze the graphical structures of the minimum stall patterns of the MC-TDZCs using directed graphs. Thirdly, we derive the multiplicities of these minimum stall patterns. The analytical results show that the size of the minimum-sized stall patterns of the proposed MC-TDZCs is larger than that of the underlying TDZC counterpart. Finally, we present simulation results to show the performance advantages of the proposed MC-TDZCs under the constraint of equal storage size for decoding. Particularly, a rate 0.94 MC-TDZC with four chains shows more than four orders of magnitude improvement in bit error rates compared to its underlying TDZC counterpart.

12 September 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
XZXinwei Zhao
Xinwei Zhao
SZShancheng Zhao
Shancheng Zhao
ZLZhetao Li
Zhetao Li
In this letter, we propose an enhanced anchor decoding (AD) algorithm for staircase codes with hard reliability scores (HRSs). We use the following two observations on the decoding results of the iterative bounded distance decoding (BDD) to assign the HRSs. Firstly, the miscorrection probability increases with the number of erroneous bits detected by the BDD. Secondly, the miscorrection probability of an anchor is low when the affected codewords due to error corrections of this anchor are also anchors. Most miscorrections can be reliably detected and prevented by using HRSs. The simulation results show that, for a staircase code based on the two-error-correcting Bose-Chaudhuri-Hocquenghem (BCH) code, the enhanced AD algorithm performs 0.11 dB better than the AD algorithm at a bit error rate of 10 -7 .