Hanqing Ding

dblp:236/1044 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0002-4600-4416ORCID · corroborated

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

Computer networks · 3 · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 50% Cloud and datacenter computing · 50%
Computer networks
1 paper
Physical-layer communications · 100%
Network and information security
1 paper
Network security · 100%

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

TopicWeightPapersLastEvidence papers
Network security
covert channel
1.012026
Generative Covert Communication: Leveraging Signal Coupling for Secret Data Transmission · INFOCOM 2026
Interconnection networks and networks-on-chip
on-chip communication
1.012026
P2C-MUX: Multiplexing with Power and Polarity Coding for Communication Efficiency · INFOCOM 2026
Cloud and datacenter computing › resource management
resource multiplexing
1.012026
P2C-MUX: Multiplexing with Power and Polarity Coding for Communication Efficiency · INFOCOM 2026

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

generative modeling · 2.0power coding · 1.0polarity coding · 1.0
YearPublicationVenuePosition
2026 Generative Covert Communication: Leveraging Signal Coupling for Secret Data Transmission
Zhao Li 0005, Linchuan Tan, Kang G. Shin, Hanqing Ding, Jia Liu 0009, Shen Qian, Zheng Yan 0002
INFOCOM5
2026 P2C-MUX: Multiplexing with Power and Polarity Coding for Communication Efficiency
Zhao Li 0005, Zhangbo Gao, Kang G. Shin, Hanqing Ding, Jia Liu 0009, Shen Qian, Zheng Yan 0002
INFOCOM5
2023 Improved DetNet Algorithm Based on GRU for Massive MIMO Systems
Hanqing Ding, Bingwei Li
ICIC (2)1
2021 Research on Lightweight Mutual Authentication for the Product Authorization Chain
abstract
With the development of the globalization economic integration in Internet of Things (IoT), it is very crucial to protect the wireless two-way authentication between users’ intelligent terminals and servers in the product authorization chain. In order to ensure that legitimate users connect to the wireless network correctly, a lightweight wireless mutual authentication scheme for the product authorization chain was proposed contrapose to the security defect of Kaul and Awasthi’s scheme, which easily suffered from offline password guessing attack. The improved scheme uses lightweight hash function and verifies the freshness of messages by using the send packet sequence number instead of timestamp, which can avoid strict clock synchronization between devices, and user passwords can be updated by themselves. Security analysis and cost and efficiency analysis show that the scheme presented in this paper has higher security, lower storage and communication costs, and lower computational complexity.
Hanqing Ding, Yifeng Yin, Yong Gan
Secur. Commun. Networks1
2019 Optimisation of convergence-aware coded PDMA for 5G wireless systems
abstract
Orthogonal frequency division multiplexing‐based pattern division multiple access (PDMA) is considered as a promising multiple access scheme for future wireless communication systems due to its high spectral efficiency and powerful ability to support massive users. In this study, it is shown that two pattern matrices with unequal diversity gain in the PDMA system have better convergence performance compared with the signature matrices in a traditional low‐density signature multiple access system by simulations and extrinsic information transfer (EXIT) chart analysis. For a low‐density parity check (LDPC)‐coded PDMA system, the EXIT characteristics between the front‐end multiple‐user detector (MUD) and the LDPC decoder may be mismatch, which usually leads to degraded performance when an iterative detection and decoding algorithm is used. To overcome this problem, a two‐stage iterative optimisation algorithm, which is easy to implement is proposed to find an optimal (near optimal) degree distribution pair for the LDPC code. Both EXIT chart analysis and simulation results demonstrate that the proposed algorithm exhibits further performance gain compared with regular (3,6) LDPC‐coded systems under both an additive white Gaussian noise channel and a Rayleigh fading channel.
Xueqin Han, Hanqing Ding, Zeqi Yu, Xiaoming Dai
IET Commun.3