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

Zhixuan Huang

dblp:252/4856 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 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
Internet of things and sensor networks · 87% Internet architecture and protocols · 13%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
mobile crowdsensing
1.012026
Q-DBPP: A Quality-Aware Dual-Bilateral Privacy Preserving Scheme in Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2026
Internet of things and sensor networks › mobile crowdsensing
worker recruitment
1.012026
Q-DBPP: A Quality-Aware Dual-Bilateral Privacy Preserving Scheme in Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2026
Privacy and data protection
location privacy
1.012026
Q-DBPP: A Quality-Aware Dual-Bilateral Privacy Preserving Scheme in Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2026
Internet architecture and protocols
quality of service
0.312026
Q-DBPP: A Quality-Aware Dual-Bilateral Privacy Preserving Scheme in Mobile Crowd Sensing · IEEE Trans. Mob. Comput. 2026

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

upper confidence bound · 2.0reverse auction · 2.0perturbation-based privacy preservation · 2.0
YearPublicationVenuePosition
2026 Q-DBPP: A Quality-Aware Dual-Bilateral Privacy Preserving Scheme in Mobile Crowd Sensing
abstract
In Mobile Crowd Sensing (MCS), privacy and quality are two pivotal issues. Specifically, Bilateral Location Privacy Preservation (BLPP) and Bilateral Data Privacy Preservation (BDPP) represent the most critical dual-bilateral privacy in MCS. However, recruiting high-quality workers typically necessitates calculating the spatial proximity of each worker-task pair and the trustworthiness of the reported data, which tends to introduce significant dual-bilateral privacy risks. Additionally, due to the lack of prior knowledge about the workers' trustworthiness at the initial stage, the platform also faces the exploration-exploitation dilemma in worker recruitment. Existing work either overlooks the service quality of worker recruitment or fails to preserve the dual-bilateral privacy, making these two issues have not yet been adequately addressed. To bridge the gaps by addressing the associated challenges, this paper proposes aQuality-awareDual-BilateralPrivacyPreserving (Q-DBPP) scheme, for upholding service quality under both BLPP and BDPP. Specifically, we present two perturbation-based privacy preservation stages to calculate Degree of Proximity (DoP) and Degree of Trust (DoT) while safeguarding BLPP and BDPP, respectively. Meanwhile, to address the exploration-exploitation dilemma, we employ an upper confidence bound-based high-quality worker recruitment stage, which integrates the estimated DoT and DoP into the reverse auction to comprehensively optimize service quality. To the best of our knowledge, our Q-DBPP scheme is the first to simultaneously achieve high service quality and dual-bilateral privacy in MCS. Theoretical analyses and extensive experiments validate the superior performance of our Q-DBPP scheme in terms of privacy, incentive, efficiency, and quality.
Jianheng Tang 0001, Zhixuan Huang, Kejia Fan, Anfeng Liu, Tian Wang 0001, Yunhuai Liu, Mianxiong Dong, Houbing Song
IEEE Trans. Mob. Comput.2
2025 Latent Feature Disentanglement Bidirectional Prompting Network for Unsupervised Cloud Removal
Zhixuan Huang, Bo Du 0001, Lyuyang Tong, Jun Wan 0005
IEEE Trans. Geosci. Remote. Sens.2
2024 Joint Sensing and Communication for mmWave VR in Metaverse: A Meta-Learning Approach
abstract
In this paper, we propose a joint sensing and communication framework for virtual reality (VR) applications in Metaverse. Although millimeter-wave (mmWave) communication can achieve multi-Gbps wireless transmission data rate, a slight movement of the VR headset can result in a significant drop in transmission rate. This significantly deteriorates user’s experience in Metaverse applications. By characterizing the relationship between mmWave beam gain and beam width, we find that adaptively turning off part of antennas can improve the overall transmission performance for mobile Metaverse. To this end, we formulate a problem with the objective of adaptively configuring receiver’s phase shift, and adjusting the beam width to cope with the variation in VR user’s viewpoints in Metaverse services. By revealing the correlation between power consumption and signal-to-noise ratio of VR headset, the proposed dual method based on meta reinforcement learning enables reliable and energy-efficient mmWave communication for VR. Based on the sensing information collected from VR users, the beamforming strategy is continuously updated by reshaping the reward of learning process, which minimizes the power consumption while meeting transmission requirements of Metaverse applications. Extensive experimental results demonstrate that the adaptability of the proposed framework outperforms the existing benchmarks in various VR scenarios, which ensures the applicability of mmWave communication to Metaverse applications.
Zhixuan Huang, Peng Yang 0004, Conghao Zhou, Wen Wu 0003, Ning Zhang 0007
IEEE Internet Things J.1
2023 Deadline Aware Two-Timescale Resource Allocation for VR Video Streaming
abstract
In this paper, we investigate resource allocation problem in the context of multiple virtual reality (VR) video flows sharing a certain link, considering specific deadline of each video frame and the impact of different frames on video quality. Firstly, we establish a queuing delay bound estimation model, enabling link node to proactively discard frames that will exceed the deadline. Secondly, we model the importance of different frames based on viewport feature of VR video and encoding method. Accordingly, the frames of each flow are sorted. Then we formulate a problem of minimizing long-term quality loss caused by frame dropping subject to per-flow quality guarantee and bandwidth constraints. Since the frequency of frame dropping and network fluctuation are not on the same time scale, we propose a two-timescale resource allocation scheme. On the long timescale, a queuing theory based resource allocation method is proposed to satisfy quality requirement, utilizing frame queuing delay bound to obtain minimum resource demand for each flow. On the short timescale, in order to quickly fine-tune allocation results to cope with the unstable network state, we propose a low-complexity heuristic algorithm, scheduling available resources based on the importance of frames in each flow. Extensive experimental results demonstrate that the proposed scheme can efficiently improve quality and fairness of VR video flows under various network conditions.
Qingxuan Feng, Peng Yang 0004, Zhixuan Huang, Ning Zhang 0007
GLOBECOM3
2023 Predictive and Robust Field-of-View Selection for Virtual Reality Video Streaming
abstract
Virtual reality technology is rapidly evolving towards providing immersive user experience. By predicting user’s field-of-view (FoV) in advance, only transmitting content viewed by the user can help to meet the stringent requirements of delivering enhanced video quality. In this paper, a predictive and robust FoV selection algorithm is devised to dynamically identify a subset of video tiles, guided by the prediction error due to user’s stochastic head movement. Considering that the required data size to cover actual FoV is positively correlated with the prediction error, we construct a context space represented by the prediction error. A partition method of context space is exploited to discretize continuous context, where the prediction errors are classified effectively, and adaptive tile selection can be carried out. Then, a padding strategy is proposed by estimating the transmission gain of each tile in different prediction context, which improves the coverage of transmitted content around the true FoV at less bandwidth cost. Experimental results based on a real-world dataset demonstrate that the proposed algorithm can achieve dynamic FoV adjustment, and effectively improve user’s quality of experience.
Zhixuan Huang, Peng Yang 0004, Wen Wu 0003, Ning Zhang 0007
PIMRC1