Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haihong Sheng

dblp:326/5764 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0002-0919-7861ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation › constellation design
constellation shaping
0.612022
Optimal Probabilistic Constellation Shaping for Covert Communications · IEEE Trans. Inf. Forensics Secur. 2022
Physical-layer communications › physical layer security
covert communication
0.612022
Optimal Probabilistic Constellation Shaping for Covert Communications · IEEE Trans. Inf. Forensics Secur. 2022
Physical-layer communications › physical layer security › covert communication
covert rate maximization
0.612022
Optimal Probabilistic Constellation Shaping for Covert Communications · IEEE Trans. Inf. Forensics Secur. 2022
Physical-layer communications
modulation
0.612022
Optimal Probabilistic Constellation Shaping for Covert Communications · IEEE Trans. Inf. Forensics Secur. 2022
Physical-layer communications › modulation › constellation design
probabilistic constellation shaping
0.612022
Optimal Probabilistic Constellation Shaping for Covert Communications · IEEE Trans. Inf. Forensics Secur. 2022

Methods — techniques the papers use, named apart from their topics

gradient descent · 0.6frank-wolfe method · 0.6
YearPublicationVenuePosition
2024 Feasibility Conditions for Mobile LiFi
abstract
Light fidelity (LiFi) is a potential key technology for future 6G networks. However, its feasibility of supporting mobile communications has not been fundamentally discussed. In this paper, we investigate the time-varying channel characteristics of mobile LiFi based on measured mobile phone rotation and movement data. Specifically, we define LiFi channel coherence time to evaluate the correlation of the channel timing sequence. Then, we derive the expression of LiFi transmission rate based on the m-pulse-amplitude-modulation (M-PAM). The derived rate expression indicates that mobile LiFi communications is feasible by using at least two photodiodes (PDs) with different orientations. Further, we propose two channel estimation schemes, and propose a LiFi channel tracking scheme to improve the communication performance. Finally, our experimental results show that the channel coherence time is on the order of tens of milliseconds, which indicates a relatively stable channel. In addition, based on the measured data, better communication performance can be realized in the multiple-input multiple-output (MIMO) scenario with a rate of 36Mbit/s, compared to other scenarios. The results also show that the proposed channel estimation and tracking schemes are effective in designing mobile LiFi systems.
Shuai Ma 0002, Haihong Sheng, Junchang Sun, Hang Li 0003, Xiaodong Liu 0006, Chen Qiu 0004, Majid Safari, Naofal Al-Dhahir, Shiyin Li
IEEE Trans. Wirel. Commun.2
2023 Covert Beamforming Design for Integrated Radar Sensing and Communication Systems
abstract
We propose covert beamforming design frameworks for integrated radar sensing and communication (IRSC) systems, where the radar can covertly communicate with legitimate users under the cover of the probing waveforms without being detected by the eavesdropper. Specifically, by jointly designing the target detection beamformer and communication beamformer, we aim to maximize the radar detection mutual information (MI) (or the communication rate) subject to the covert constraint, the communication rate constraint (or the radar detection MI constraint), and the total power constraint. For the perfect eavesdropper’s channel state information (CSI) scenario, we transform the covert beamforming design problems into a series of convex subproblems, by exploiting semidefinite relaxation, which can be solved via the bisection search method. Considering the high complexity of iterative optimization, we further propose a single-iterative covert beamformer design scheme based on the zero-forcing criterion. For the imperfect eavesdropper’s CSI scenario, we develop a relaxation and restriction method to tackle the robust covert beamforming design problems. Simulation results demonstrate the effectiveness of the proposed covert beamforming schemes for perfect and imperfect CSI scenarios.
Shuai Ma 0002, Haihong Sheng, Hang Li 0003, Youlong Wu, Chao Shen 0004, Naofal Al-Dhahir, Shiyin Li
IEEE Trans. Wirel. Commun.2
2022 Optimal Probabilistic Constellation Shaping for Covert Communications
abstract
In this paper, we investigate the optimal probabilistic constellation shaping design for covert communication systems from a practical view. Different from conventional covert communications with equiprobable constellations modulation, we propose non-equiprobable constellations modulation schemes to further enhance the covert rate. Specifically, we derive covert rate expressions for practical discrete constellation inputs for the first time. Then, we study the covert rate maximization problem by jointly optimizing the constellation distribution and power allocation. In particular, an approximate gradient descent method is proposed for obtaining the optimal probabilistic constellation shaping. To strike a balance between the computational complexity and the transmission performance, we further develop a framework that maximizes a lower bound on the achievable rate where the optimal probabilistic constellation shaping problem can be solved efficiently using the Frank-Wolfe method. Extensive numerical results show that the optimized probabilistic constellation shaping strategies provide significant gains in the achievable covert rate over the state-of-the-art schemes.
Shuai Ma 0002, Haihong Sheng, Hang Li 0003, Jia Shi 0001, Long Yang 0002, Youlong Wu, Naofal Al-Dhahir, Shiyin Li
IEEE Trans. Inf. Forensics Secur.3