Pengxu Chen

Dr. Pengxu Chen

orcid

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
30 January 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
PCPengxu Chen
Pengxu Chen
HLHongwu Liu
Hongwu Liu
Yinghui YeYinghui Ye
Yinghui Ye
LYLiang Yang
Liang Yang
KKKyeong Jin Kim
Kyeong Jin Kim
TTTheodoros A. Tsiftsis
Theodoros A. Tsiftsis
In this paper, a rate-splitting multiple access (RSMA) scheme is proposed to aid a mobile edge computing (MEC) system where multiple randomly deployed users offload their computation tasks to a MEC server. Considering that users are divided into the center and edge groups, a cognitive radio (CR)-inspired rate-splitting is designed to enable the paired users to simultaneously offload to MEC server. Under the CR principles, the rate-splitting parameters are jointly designed to attain the maximum achievable rate for the secondary user, meanwhile maintaining the primary user’s offloading performance same as in orthogonal multiple access. For the case of the paired users with fixed locations, we derive a closed-form expression for the successful computation probability (SCP) achieved by the RSMA-aided MEC (RSMA-MEC) scheme and formulate a SCP maximization problem to obtain the optimal offloading parameters. To reveal the impact of the user locations on the offloading performance of the RSMA-MEC system, various distance-based user pairing schemes are investigated by invoking stochastic geometry techniques. We provide closed-form expressions for the SCPs achieved by the user pairing schemes to characterize the offloading performance. Pros and cons of the user locations to maximize the SCP are highlighted. Simulation results verify the accuracy of the analytical results and clarify the superior offloading performance achieved by the RSMA-MEC scheme, which attains a higher SCP than the existing schemes.

12 September 2023 in Physical Communication
Verified
Journal Article
Closed access
FXFengcheng Xiao
Fengcheng Xiao
PCPengxu Chen
Pengxu Chen
SXShuobo Xu
Shuobo Xu
XPXiyu Pang
Xiyu Pang
HLHongwu Liu
Hongwu Liu

28 June 2023 in Drones
Verified
Journal Article
Open access
PDF file
MMm m
m m
HCHeng Chang
Heng Chang
PCPengxu Chen
Pengxu Chen
ZBZhiquan Bai
Zhiquan Bai
HLHongwu Liu
Hongwu Liu
In this paper, we investigate covert communications for an unmanned aerial vehicle (UAV)-aided rate-splitting multiple access (RSMA) system in which the UAV transmits to the covert and public users separately while shielding covert transmissions from a warden. Under the RSMA principles, the messages of the covert and public users are converted to common and private streams for air-to-ground transmissions. Subject to the quality of service (QoS) requirements of the public user and covertness constraint of the UAV-aid RSMA (UAV-RSMA) system, the aim of covert communication design is to maximize the covert rate by jointly optimizing the transmit power allocation, common rate allocation, and UAV hovering height, which each contribute to the uncertainty of the warden’s binary decision and attempts to enhance communication performance. To address the non-convex covert rate maximization problem in addition to the highly coupled system parameters, we decouple the original problem into three subproblems of transmit power allocation, common rate allocation, and UAV hovering height. We derive the optimal solutions for each of the subproblems of the transmit power and rate allocations and formulate a signomial programming problem to tackle UAV hovering height optimization. The simulation results indicate the superior covert rate performance achieved by the proposed AO algorithm and demonstrate that the proposed UAV-RSMA scheme achieves a higher covert rate than the benchmark schemes.

1 September 2023 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
HCHeng Chang
Heng Chang
PCPengxu Chen
Pengxu Chen
SXShuobo Xu
Shuobo Xu
YMYuming Mao
Yuming Mao
HLHongwu Liu
Hongwu Liu

3 November 2016
Verified
Conference Paper
Closed access
ZZZezhong Zheng
Zezhong Zheng
PCPengxu Chen
Pengxu Chen
MZMingcang Zhu
Mingcang Zhu
ZHZhiqin Huang
Zhiqin Huang
Yong HeYong He
Yong He
JLJiang Li
Jiang Li
Hyperspectral remote sensing image (HSI) consists of hundreds of bands that contain rich space, radiation and spectral information. The high-dimensional data can also lead to the curse of dimensionality problem making it difficult to be used effectively. In this paper, we proposed a manifold learning algorithm to reduce the dimensionality for HSI data. For high dimensional datasets with continuous variables, it is often the case that the data points are arranged along with low dimensional structures, named manifolds, in the high dimensional space. Manifold learning aims to identifying those special low dimensional structures for subsequent usage such as classification or regression. However, many manifold learning algorithms perform an eigenvector analysis on a data similarity matrix whose size is N×N, where N is the number of data points. The memory complexity of the analysis is at least O(N2) that is not feasible for a regular computer to compute or storage for very large datasets. To solve this problem, we used statistical sampling methods to sample a subset of data points as landmarks. A skeleton of the manifold was then identified based on the landmarks. The remaining data points were then inserted into the skeleton by Locally Linear Embedding (LLE). We tested our algorithm on AVIRIS Salinas-A data set. The experimental results showed that the HSI dataset could be reduced to a lower-dimensional space for land use classification with good performance, and the main structure was preserved well.