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

Haocheng Zhou

dblp:181/0459 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · unresolved

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

Computer networks · 2 · 1 since 2021Systems, architecture and hardware · 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
Edge and fog computing · 44% Internet of things and sensor networks · 44% Vehicular, aerial and satellite networks · 13%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
query processing
1.012026
Efficient Query Evaluation for Highly-Frequent Earth Observation via Satellite Maneuver in Space Edge Computing · IEEE Trans. Parallel Distributed Syst. 2026
Edge and fog computing
satellite edge computing
1.012026
Efficient Query Evaluation for Highly-Frequent Earth Observation via Satellite Maneuver in Space Edge Computing · IEEE Trans. Parallel Distributed Syst. 2026
Vehicular, aerial and satellite networks › satellite networks
LEO satellite networks
0.312026
Efficient Query Evaluation for Highly-Frequent Earth Observation via Satellite Maneuver in Space Edge Computing · IEEE Trans. Parallel Distributed Syst. 2026

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

lipschitz bandit learning · 2.0approximation algorithm · 2.0
YearPublicationVenuePosition
2026 Minimizing the Delay Disparity for Cross-Region Virtual Reality Gaming in Satellite Edge Computing
Tong Sheng, Zichuan Xu, Haocheng Zhou, Qiufen Xia
IWQoS3
2026 Efficient Query Evaluation for Highly-Frequent Earth Observation via Satellite Maneuver in Space Edge Computing
abstract
Big data analytics for Earth observation has been playing an increasingly important role in supporting environmental monitoring, disaster early warning, and sustainable development through timely analysis of massive multi-source data collected by satellites. With the growing need for such timely Big Data analysis, Space Edge Computing (SEC) networks have been proposed to provide in-orbit analytic services for users worldwide, by integrating computing capability through Low-Earth-Orbit (LEO) satellites. However, the monitoring frequency of LEO satellites over specific target areas remains limited due to orbital constraints, making it difficult to meet the high-frequency data acquisition demands of Big Data analytics. Satellite inclination maneuver is a promising method to cover a wide range of target areas and enhance monitoring frequency by adjusting orbital inclination of satellites. Although such maneuvering enables satellites to timely process datasets, reducing energy wastage caused by inter-satellite data transmission, it consumes propulsion fuel, which is limited and difficult to replenish in a timely manner. Therefore, balancing the energy consumed for data processing and the fuel consumed for maneuvering is essential for efficient and sustainable Big Data analytics in SEC networks. In this paper, we aim to optimize Big Data query evaluation problem with satellite maneuver in an SEC network, focusing on minimizing the weighted sum of energy consumed for processing and fuel consumed for maneuvering. Specifically, we consider that each Earth observation service needs to guarantee a certain level of monitoring frequency, which may not always be satisfied by the original orbital coverage of LEO satellites. In such cases, some satellites will be selected to perform inclination maneuvers for additional monitoring and processing to guarantee the quality of Earth observation services. To this end, we first propose an approximation algorithm with a provable approximation ratio for the offline query evaluation problem, which leverages a customized auxiliary graph to jointly minimize energy and fuel consumption. We then devise an online learning algorithm, referred to as the customized Lipschitz bandit learning algorithm, with a bounded regret for the online Big Data query evaluation problem in an SEC network. We finally evaluate the performance of the proposed algorithms in a real SEC network topology. Experiment results show that the performance of the proposed algorithms achieve 11% lower energy consumption and 10.6% lower fuel consumption than those of their comparison counterparts.
Guangyuan Xu, Zichuan Xu, Hao Wang 0023, Haocheng Zhou, Peichen Liu, Guiqiang Zhang, Qiufen Xia
IEEE Trans. Parallel Distributed Syst.4
2016 Characterizing mobile *-box applications
Xiapu Luo, Haocheng Zhou, Le Yu 0002, Lei Xue 0001, Yi Xie 0004
Comput. Networks2