Zhimin Liu

Zhimin Liu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
15 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZLZhimin Liu
Zhimin Liu
GJGuiyan Jiang
Guiyan Jiang
WJWei Jia
Wei Jia
Tian WangTian Wang
Tian Wang
YWYouke Wu
Youke Wu

10 April 2025 in IEEE Sensors Journal
Verified
Journal Article
Closed access
ZLZhimin Liu
Zhimin Liu
GJGuiyan Jiang
Guiyan Jiang
YWYouke Wu
Youke Wu
Tian WangTian Wang
Tian Wang
SLshukun liu
shukun liu
ZOZhangdong Ouyang
Zhangdong Ouyang
In wireless visual sensor networks (WVSNs), coverage estimation is essential for optimizing network energy consumption and reducing deployment costs. In recent years, the majority of literature primarily focuses on small-scale networks, and typically assumes that visual sensors are either predetermined or randomly deployed in obstacle-free region of interest (RoI). However, in real-world scenarios, these sensors are frequently deployed in challenging-to-access environments that contain irregular obstacles. Moreover, the targets in these environments exhibit considerable diversity in shape and size. To address these challenges, this paper presents an issue of irregular targets K coverage with obstacles (K-ITCO) in WVSNs deployed in irregular RoI. In addition, we account for the probability that targets are unobstructed and consider the boundary effects. We derive two K-ITCO estimation models and their respective solving methods (K-ITCO-BE and K-ITCO-noBE) that predict a specified coverage ratio with a high probability. To validate the effectiveness and accuracy of our proposed models, multiple sets of simulations are designed to analyze the numerical and simulation results. Our findings demonstrate a high degree of consistency with the simulation outcomes, and indicate that the model can effectively estimate K-ITCO ratio.

6 July 2021 in IEEE Access
Verified
Journal Article
Open access
ZLZhimin Liu
Zhimin Liu
GJGuiyan Jiang
Guiyan Jiang
Recently, full-view coverage was introduced to capture intruders from any direction in camera sensor networks (CSNs), it can identify intruders more effectively than traditional coverage. However, the full-view coverage usually requires a large number of camera sensors so that its estimation problem becomes more complicated. In addition, in practical application scenario, the camera sensors are often randomly deployed in an irregular bounded region. In this paper, we assume that many heterogeneous camera sensors are deployed in a bounded convex region. In order to predict the sensor parameter needed to achieve any given full-view coverage probability (ratio) of the heterogeneous CSNs, we deduce the sensor parameter estimation model to estimate the sensor scale, sensing radius and other parameters so as to guide the engineer to design a better CSNs. Finally, To evaluate the accuracy of the proposed model, a series of simulation experiments are conducted to verify the results. By analysis of the results, we can conclude that the mean absolute coverage error defined in this paper is not greater than 6.5%

27 December 2017 in IEEE Access
Verified
Journal Article
Open access
ZLZhimin Liu
Zhimin Liu
ZOZhangdong Ouyang
Zhangdong Ouyang
Coverage estimation is one of the fundamental issues of camera sensor networks (CSNs), and is also an important metric used to evaluate the monitoring quality of field of interest (FoI). In comparison with conventional omnidirectional sensor networks, coverage estimation in CSNs is more challenging due to the sensing region of camera sensor that is a sector-disk region. Moreover, the heterogeneous deployment of CSNs makes the coverage estimation problem even more complex. Currently, most of the literatures assume that a great number of camera sensors are directly deployed in the FoI. This paper assumes that all heterogeneous camera sensors are stochastically deployed outside the FoI. For such heterogeneous CSNs, we derived a k-coverage probabilistic expression to estimate the minimum number of camera sensors required for a desired level of k-coverage. To evaluate the performance of the proposed k-coverage estimation expression, several simulation experiments are conducted to validate the theoretical results.

26 November 2020 in IEEE Access
Verified
Journal Article
Open access
SLshukun liu
shukun liu
CLChaoliang Li
Chaoliang Li
ZLZhimin Liu
Zhimin Liu
QZQiang Zhang
Qiang Zhang
In accordance with the dynamically changing characteristics of user application load demand, the optimization of energy consumption in the process of virtual machine automatic deployment on the basis of the effective integration of user personalized resource demand in cloud platforms and the dynamic migration technology of virtual machines is studied in this work. Aiming at the problem of energy consumption optimization, an energy-efficient virtual machine deployment framework, which can be dynamically adjusted in accordance with the user’s actual resource needs, is designed. In the virtual machine deployment framework, this paper presents a virtual machine deployment selection algorithm based on a double-cursor control mechanism for the resource usage state of CPU and memory, which achieves a binocular optimization balance to a certain extent. Simulation experiment results show that when the virtual machine deployment framework proposed in this paper and the virtual machine deployment selection algorithm based on a double-cursor control mechanism are combined, the number of necessary active physical nodes in the cloud data center can be effectively controlled, and the frequency of virtual machine migration synchronization can be reduced. Consequently, the cloud data center can maintain low energy costs.

25 September 2023 in IEEE Access
Verified
Journal Article
Open access
ZLZhimin Liu
Zhimin Liu
ZCZuoqing Cao
Zuoqing Cao
SLshukun liu
shukun liu
PBPinial Khan Butt
Pinial Khan Butt
Coverage is a prominent indicator for measuring the quality of service in directional sensor networks. From the perspective of energy and deployment costs, full coverage may be expensive or unrealistic, partial coverage can operate more energy-efficient by scheduling working status of sensors. In certain practical application scenarios, irregular obstacles like trees, mountains, buildings, and vehicles, which have adverse influence on QoC, often exist in the field of interest (FoI). Meanwhile, due to sensors may fall near the border of the FoI, it also has effect on the coverage contribution. In this paper, we assume that sensors are randomly deployed in a square FoI with irregular shape obstacles existence, and introduce the concept of occlusion coverage of partial targets. Afterwards, we take the border effects into account and derive the critical sensor density for achieving an expected coverage ratio with a high probability. Finally, we conduct a series of simulation experiments to verify the accuracy between simulation results and numerical results, and take analysis of mean absolute error between them. The results show that our method has good performance on estimating critical sensor density.