Hong Gao

Hong Gao

Auto-generated profile, based on publicly available information

Hong Gao

Zhejiang Normal University

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 November 2010 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
WFWenfei Fan
Wenfei Fan
HGHong Gao
Hong Gao
XJXibei Jia
Xibei Jia
JLJianzhong Li
Jianzhong Li
SMShuai Ma
Shuai Ma

26 September 2016 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Open access
XZXu Zheng
Xu Zheng
ZCZhipeng Cai
Zhipeng Cai
JLJianzhong Li
Jianzhong Li
HGHong Gao
Hong Gao
The past decade witnessed the dramatic evolution from Quality of Service (QoS) to Quality of Experience (QoE) in the design of wireless networks, especially on the aspect of link scheduling. In many applications, end users are concerned more about transmission quality of an individual task rather than the quality of a link, where a task may refer to a piece of music, video, etc. and may include many packets. This paper proposes a new network model aiming at improving user experience by pushing the scheduling problem to the task layer. A novel QoE requirement is designed to generalize the QoS requirements of a task, which is the ratio requirement. Following this design, a corresponding scheduling policy is proposed to capture it for each task and then reach an application-aware transmission allocation. We theoretically analyze the performance of the scheduling policy, and discuss the design of an optimal solution and the impact of the QoE requirements. Finally, the simulation results indicate that our scheduling policy can significantly improve QoE.

23 February 2013 in World Wide Web
Verified
Journal Article
Closed access
PDF file
YYYajun Yang
Yajun Yang
JYJeffrey Xu Yu
Jeffrey Xu Yu
HGHong Gao
Hong Gao
JPJian Pei
Jian Pei
JLJianzhong Li
Jianzhong Li

19 August 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TZTongxin Zhu
Tongxin Zhu
JLJianzhong Li
Jianzhong Li
HGHong Gao
Hong Gao
YLYingshu Li
Yingshu Li
ZCZhipeng Cai
Zhipeng Cai
Age of Information (AoI) is a new metric for measuring the freshness of sensory data in wireless sensor networks. The Battery-Free Wireless Sensor Network (BF-WSN) is proposed to break through the lifetime limitation of battery-powered wireless sensor networks. However, the emerging BF-WSN also brings challenges to the minimization of AoI, on account of its energy characteristics. In this paper, we investigate the AoI minimization data collection scheduling problem for BF-WSNs. The off-the-shelf works for the AoI minimization data collection scheduling problem either focus on simple networks with no more than three nodes or assume that battery-free sensor nodes have specific energy harvesting process, such as Bernoulli process and Poisson process. Different from these works, we first consider the AoI minimization data collection scheduling for one-hop BF-WSNs with multiple battery-free sensor nodes transmitting their sensory data to the sink node, where the energy harvesting processes of battery-free sensor nodes are non-specific. We propose the optimal offline algorithm and the online algorithm for the problem, respectively. The optimality of the offline algorithm and the competitive ratio of the online algorithm are theoretical proved and analyzed. Numerical results are provided to verify the performances of the proposed algorithms.

28 November 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
QCQuan Chen
Quan Chen
SGSong Guo
Song Guo
KWKaijia Wang
Kaijia Wang
WXWenchao Xu
Wenchao Xu
JLJing Li
Jing Li
Albert ZomayaAlbert Zomaya
Albert Zomaya
By combining edge computing and parallel computing, distributed edge computing has emerged as a new paradigm to exploit the booming IoT devices at the edge. To accelerate computation at the edge, i.e., the inference tasks for DNN-driven applications, the parallelism of both computation and communication needs to be considered for distributed edge computing, and thus, the problem of Minimum Latency joint Communication and Computation Scheduling (MLCCS) is proposed. However, existing works have rigid assumptions that the communication time of each device is fixed and the workload can be split arbitrarily small. Aiming at making the work more practical and general, the MLCCS problem without the above assumptions is studied in this paper. First, the MLCCS problem under a general model is formulated and proved to be NP-hard. Second, a pyramid-based computing model is proposed to consider the parallelism of communication and computation jointly, which has an approximation ratio of $1+\delta$ , where $\delta$ is related to devices’ communication rates. An interesting property under such a computing model is identified and proved, i.e., the optimal latency can be obtained under arbitrary scheduling order when all the devices share the same communication rate. When the workload cannot be split arbitrarily, an approximation algorithm with a ratio of at most $2\cdot (1+\delta)$ is proposed. Additionally, for handling the dynamically changing network scenarios, several algorithms are also proposed accordingly. Finally, the theoretical analysis and simulation results verify that the proposed algorithm has high performance in terms of latency. Two testbed experiments are also conducted, which show that the proposed method outperforms the existing methods, reducing the latency by up to 29.2% for inference tasks at the edge.

7 July 2023 in World Wide Web
Verified
Journal Article
Open access
PDF file
JLJiayi Liu
Jiayi Liu
DYDonghua Yang
Donghua Yang
KZKaiqi Zhang
Kaiqi Zhang
HGHong Gao
Hong Gao
JLJianzhong Li
Jianzhong Li
Anomaly detection is one of the most important research contents in time series data analysis, which is widely used in many fields. In real world, the environment is usually dynamically changing, and the distribution of data changes over time, namely concept drift. The accuracy of static anomaly detection methods is bound to be reduced by concept drift. In addition, there is a sudden concept drift, which is manifested as a abrupt variation in a data point that changes the statistical properties of data. Such a point is called a change point, and it has very similar behavior to an anomaly. However, the existing methods cannot distinguish between anomaly and change point, so the existence of change point will affect the result of anomaly detection. In this paper, we propose an unsupervised method to simultaneously detect anomaly and change point for time series with concept drift. The method is based on the fluctuation features of data and converts the original data into the rate of change of data. It not only solves the concept drift, but also effectively detects and distinguishes anomalies and change points. Experiments on both public and synthetic datasets show that compared with the state-of-the-art anomaly detection methods, our method is superior to most of the existing works and significantly superior to existing methods for change point detection. It fully demonstrates the superiority of our method in detecting anomalies and change points simultaneously.