Cheng Li

Cheng Li

Auto-generated profile, based on publicly available information

Cheng Li

Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
24 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YGYixiao Gu
Yixiao Gu
YYYao Yao
Yao Yao
CLCheng Li
Cheng Li
BXBin Xia
Bin Xia
DXDingjie Xu
Dingjie Xu
CZChaoxian Zhang
Chaoxian Zhang
To realize the vision of the Internet of Things (IoT), mobile-edge computing (MEC) has recently emerged as a promising paradigm to meet the computation demand from mobile users (MUs). In this article, we study the network performance in large-scale stochastic MEC wireless networks, where the tasks can be computed locally by the local computation capabilities (LCCs) or be offloaded to MEC servers for edge computing. To this end, a MEC network is modeled featuring random node distribution, dynamic task requests, orthogonal frequency-division multiple access, task retransmission, and parallel computing in MEC servers. Given the model, a 2-D discrete-time Markov chain is first adopted to characterize the task execution process, including local computing and task offloading. Based on the coupling between communication and computing, the average outage probability of the task transmission and the average MEC computation load are derived by integrating the stochastic geometry and queuing theory. Furthermore, by jointly analyzing the local computation latency, transmission latency, and edge computation latency, we derive the average end-to-end latency of the task execution. Our results show that the LCCs in MUs can improve the network performance, including communication and computation performance, in stochastic MEC networks. In addition, useful guidelines for MEC network provisioning and planning are provided to avoid either the local computing or the task offloading being the latency performance bottleneck.

28 December 2016 in IEEE Communications Letters
Verified
Journal Article
Closed access
BXBin Xia
Bin Xia
CLCheng Li
Cheng Li
QJQianmin Jiang
Qianmin Jiang
In this letter, we consider a multi-user two-way full-duplex (FD) relay system, where the user pairs are predefined and the multiple pairs are competing one relay node to exchange messages within the pair. The system is suffering from independent but not identically distributed fading channels. We analyze the system outage performance with Max-Min scheduling scheme. The exact closed-form outage probability expressions are derived. In addition, the impacts of the residual self-interference incurred by the FD mode are considered. Moreover, we obtain some insights on the self-interference cancellation requirements for the FD mode. The superiority of FD mode and the multi-user diversity gain of the system are verified by the analytical results, which are corroborated by the numerical simulations.

8 November 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
CLCheng Li
Cheng Li
NRNathaniel Raymondi
Nathaniel Raymondi
BXBin Xia
Bin Xia
ASAshutosh Sabharwal
Ashutosh Sabharwal
Limited access to available spectrum motivates new age radio frequency (RF) systems to co-exist and cooperate. In this paper, we consider a joint communication and radar system (labeled Comm-Radar), that is capable of receiving and decoding communication signals while simultaneously enabling radar functionalities. Traditionally, systems that leverage principles of spectrum convergence, deemed each functions to be detrimental to the others. This has led to successive interference cancellations strategies that effectively isolate each of the functionalities. Here, in the context of Comm-Radar processing structure, we show that ambient communication transmissions actually assist in radar estimation. The insight is that communications multipath reflects off radar targets (we denote these comm-target paths) in the environment, and can be processed at the receiver to extract extra information. In this work we characterize the fundamental performance limits of such a joint system.To demonstrate the radar performance gain achievable via the processing of extra comm-target paths, the closed-form Cramér-Rao Bound (CRB) for the estimation of direction, range and velocity of a target is derived, for both the general case, and practical radar and communication signalling schemes. Based on the CRB, joint outer bounds are obtained to characterize the trade off between estimation performance and communication rate. Finally, numerical results verify the advantages of utilizing the target reflections from the communication signal to bolster radar performance.

4 January 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CLCheng Li
Cheng Li
BXBin Xia
Bin Xia
QJQianmin Jiang
Qianmin Jiang
YYYao Yao
Yao Yao
GYGuanghua Yang
Guanghua Yang
In contrast to the traditional assumption of the independent and identically distributed fading channels, this paper studies the achievable rate of the multiuser two-way full-duplex (FD) relay system under the independent and nonidentically distributed (i.ni.d.) fading channels, which leads to the different selection probabilities and different weighted rates of different user pairs contributing to the overall system achievable rate as well. To be specific, we first derive the user pair selection probabilities of the max-min scheduling scheme for the i.ni.d. channels. Then, based on the selection probabilities, we solve the hard problem of the weighted rate derivation of each pair. Finally, according to the total probability theorem, the general expressions of the system achievable rate are obtained. In addition, theoretical evaluations and numerical simulations are conducted. The results verify the accuracy of the theoretical analysis and reveal the superiority of the FD mode especially within the low transmitting power regime.

26 April 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
CLCheng Li
Cheng Li
PHPihe Hu
Pihe Hu
YYYao Yao
Yao Yao
BXBin Xia
Bin Xia
ZCZhiyong Chen
Zhiyong Chen
Multi-User scheduling is challenging due to the channel unbalance problem, which leads to the system performance degradation. In this paper, two optimal multi-user scheduling schemes maximizing the system throughput are proposed for the fixed and adaptive power transmission scenarios of the full-duplex (FD) multi-user buffer-aided relay system, respectively. Independent and non-identically distributed (i.ni.d.) model is used to characterize the unbalanced channels of different links. In particular, optimal weight factor of each pair is designed based on the statistical channel state information in both scenarios. With the weight factors, the proposed schemes are able to balance the throughput gaps between different links. In addition, we propose optimal power allocation scheme with closed-form expressions under average power constraint for the adaptive power transmission scenario. By combining the optimal weight factor and the power allocation scheme, novel optimal selection function is obtained to facilitate the selection process. Considering the specific i.ni.d. Rayleigh fading, system throughput is further derived in both cases. Theoretical analysis is verified by the numerical simulations and the results demonstrate the superiority of the proposed schemes.

1 August 2019
Verified
Conference Paper
Closed access
JLJie Liang
Jie Liang
ZCZhiyong Chen
Zhiyong Chen
CLCheng Li
Cheng Li
BXBin Xia
Bin Xia
In this paper, we deal with the problem of relay selection in mobile relay edge computing system, where a source node transmits a computation-intensive task to a destination node via the aid of multiple relay nodes. It differs from the traditional relay nodes in the way that each relay node is equipped with an edge computing server with different computing ability, and thus each relay node can execute the received task and forward the computed result to the destination. Accordingly, we define a delay outage probability to evaluate the impact of the relay computing ability on the link communication, and then propose a latency-best relay selection (LBRS) scheme which not only considers the communication capability but also considers the computing ability of relay nodes. The performance of the proposed relay selection scheme with the traditional communication-only relay selection (CORS) and computing-only selection (CPORS) schemes in terms of the delay outage probability and the diversity order are analyzed, compared with other relay selection schemes. The theoretical derivation points out that the proposed LBRS scheme reduces to the traditional CORS scheme under the high signal-to-noise ratio (SNR) region. We further reveal that the diversity order of both the proposed LBRS and CORS schemes are dependent on the computing ability of relay nodes.