Wenzheng Xu

Dr. Wenzheng Xu

College of Computer Science, Sichuan University, Chengdu 510006, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
18 March 2020 in IEEE Access
Verified
Journal Article
Open access
YHYe Hong
Ye Hong
YZYingjie Zhou
Yingjie Zhou
Qibin LiQibin Li
Qibin Li
WXWenzheng Xu
Wenzheng Xu
XZXiujuan Zheng
Xiujuan Zheng
Residential demand response is vital for the efficiency of power system. It has attracted much attention from both academic and industry in recent years. Accurate short-term load forecasting is a fundamental task for demand response. While short-term forecasting for aggregated load data has been extensively studied, load forecasting for individual residential users is still challenging due to the dynamic and stochastic characteristic of single users’ electricity consumption behaviors, i.e., the variability of the residential activities. To address this challenge, this paper presents a short-term residential load forecasting framework, which makes use of the spatio-temporal correlation existing in appliances’ load data through deep learning. Multiple time series are conducted in the framework to describe electricity consumption behaviors and their internal spatio-temporal relationship. And a method based on deep neural network and iterative ResBlock is proposed to learn the correlation among different electricity consumption behaviors for short-term load forecasting. Experiments based on real world measurements have been conducted to evaluate the performance of the proposed forecasting approach. The results show that both the appliances’ load data and iterative ResBlocks can help to improve the forecasting performance. Compared with existing methods, measurements on Root Mean Squared Error, Mean Absolute Error and Mean Absolute Percentage Error for the proposed approach are reduced by 3.89%-20.00%, 2.18%-22.58% and 0.69%-32.78%. In addition, further experiments are conducted to evaluate the impact of using appliances' load data, iterative ResBlocks as well as other factors for the proposed approach.

8 June 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
YMYu Ma
Yu Ma
WLWeifa Liang
Weifa Liang
WXWenzheng Xu
Wenzheng Xu
Wireless energy charging has been regarded as a promising technology for prolonging sensor lifetime in wireless rechargeable sensor networks (WRSNs). Most existing studies focused on one-to-one charging between a mobile charger and a sensor that suffers charging scalability and efficiency issues. A new charging technique - one-to-many charging scheme that allows multiple sensors to be charged simultaneously by a single charger can well address the issues. In this paper, we investigate the use of a mobile charger to charge multiple sensors simultaneously in WRSNs under the energy capacity constraint on the mobile charger. We aim to minimize the sensor energy expiration time by formulating a novel charging utility maximization problem, where the amount of utility gain by charging a sensor is proportional to the amount of energy received by the sensor. We also consider the charging tour length minimization problem of minimizing the travel distance of the mobile charger if all requested sensors must be charged, assuming that the mobile charger has sufficient energy to support all requested sensor charging and itself travelling. Specifically, in this paper, we first devise an approximation algorithm with a constant approximation ratio for the charging utility maximization problem if the energy consumption of the mobile charger on its charging tour is negligible. Otherwise, we develop an efficient heuristic for it through a non-trivial reduction from a length-constrained utility maximization problem. We then, devise the very first approximation algorithm with a constant approximation ratio for the charging tour length minimization problem through exploiting the combinatorial property of the problem. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results demonstrate that the proposed algorithms are promising, and outperform the other heuristics in various settings.

31 May 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YLYuchen Li
Yuchen Li
WLWeifa Liang
Weifa Liang
WXWenzheng Xu
Wenzheng Xu
ZXZichuan Xu
Zichuan Xu
XJXiaohua Jia
Xiaohua Jia
HKHaiBin Kan
HaiBin Kan
In this paper, we study sensing data collection of IoT devices in a sparse IoT-sensor network, using an energy-constrained Unmanned Aerial Vehicle (UAV), where the sensory data is stored in IoT devices while the IoT devices may or may not be within the transmission range of each other. We formulate two novel data collection problems to fully or partially collect data stored from IoT devices using the UAV, by finding a closed tour for the UAV that consists of hovering locations and the sojourn duration at each of the hovering locations such that the accumulative volume of data collected within the tour is maximized, subject to the energy capacity on the UAV, where the UAV consumes energy on both hovering for data collection and flying from one hovering location to another hovering location. To this end, we first propose a novel data collection framework that enables the UAV to collect sensory data from multiple IoT devices simultaneously if these IoT devices are within the coverage range of the UAV, through adopting the orthogonal frequency division multiple access (OFDMA) technique. We then formulate two data collection maximization problems to deal with full or partial data collection from IoT devices at each hovering location, and show that both defined problems are NP-hard. We instead devise approximation and heuristic algorithms for the problems. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results demonstrated that the proposed algorithms are promising.

20 October 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZXZichuan Xu
Zichuan Xu
LZLiqian Zhao
Liqian Zhao
WLWeifa Liang
Weifa Liang
Omer RanaOmer Rana
Omer Rana
PZPan Zhou
Pan Zhou
GWGuowei Wu
Guowei Wu
Deep Neural Networks (DNNs) have been successfully used in a number of application areas. As the number of layers and neurons in DNNs increases rapidly, significant computational resources are needed to execute a DNN. This ever-increasing resource demand is currently met by large-scale data centers with state-of-the-art GPUs. However, increasing availability of mobile edge computing and 5G technologies provide new possibilities for DNN-driven AI applications, especially where these application make use of data sets that are distributed in different locations. One fundamental process of a DNN-driven application in mobile edge clouds is the adoption of ``inferencing'' - the process of executing a pre-trained DNN based on newly generated data from mobile devices. We investigate offloading DNN inference requests in a 5G-enabled mobile edge cloud (MEC), to admit as many inference requests as possible. We propose exact and approximate solutions for the problem. We also consider dynamic task offloading for inference requests, and devise an online algorithm that can be adapted in real time. The proposed algorithms are evaluated through large-scale simulations and using a real world test-bed. The experimental results demonstrate that the empirical performance of the proposed algorithms outperform their theoretical counterparts and other similar heuristics reported in literature.

8 March 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
WXWenzheng Xu
Wenzheng Xu
WLWeifa Liang
Weifa Liang
XJXiaohua Jia
Xiaohua Jia
ZXZichuan Xu
Zichuan Xu
ZLZheng Li
Zheng Li
YLYiguang Liu
Yiguang Liu
Wireless energy transfer technology based on magnetic resonant coupling has emerged as a promising technology for wireless sensor networks, by providing controllable yet continual energy to sensors. In this paper, we study the use of a mobile charger to wirelessly charge sensors in a rechargeable sensor network so that the sum of sensor lifetimes is maximized while the travel distance of the mobile charger is minimized. Unlike existing studies that assumed a mobile charger must charge a sensor to its full energy capacity before moving to charge the next sensor, we here assume that each sensor can be partially charged so that more sensors can be charged before their energy depletions. Under this new energy charging model, we first formulate two novel optimization problems of scheduling a mobile charger to charge a set of sensors, with the objectives to maximize the sum of sensor lifetimes and to minimize the travel distance of the mobile charger while achieving the maximum sum of sensor lifetimes, respectively. We then propose efficient algorithms for the problems. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results demonstrate that the proposed algorithms are very promising. Especially, the average energy expiration duration per sensor by the proposed algorithm for maximizing the sum of sensor lifetimes is only 9 percent of that by the state-of-the-art algorithm while the travel distance of the mobile charger by the second proposed algorithm is only about from 1 to 15 percent longer than that by the state-of-the-art benchmark.

1 May 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
WXWenzheng Xu
Wenzheng Xu
WLWeifa Liang
Weifa Liang
XJXiaohua Jia
Xiaohua Jia
HKHaiBin Kan
HaiBin Kan
YXYinlong Xu
Yinlong Xu
Xinming ZhangXinming Zhang
Xinming Zhang