Chuan-Yi Gao

Chuan-Yi Gao

Auto-generated profile, based on publicly available information

Chuan-Yi Gao

Master’s degree in electronics and communication engineering at Xi’an University of Posts and Telecommunications, Xi’an 710121, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
11 November 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XZXiaoqiang Zhao
Xiaoqiang Zhao
YCYanpeng Cui
Yanpeng Cui
CGChuan-Yi Gao
Chuan-Yi Gao
ZGZheng Guo
Zheng Guo
QGQiang Gao
Qiang Gao
As one of the crucial scenarios of the Internet of Things, wireless sensor networks (WSNs) perform tasks invariably on basis of the effective cover effect of targets. The cover effect is improved commonly by redeployment of sensor nodes since they tend to deviate from the optimal deployment location frequently. Given the complex and harsh environment of three-dimensional WSNs, which impede the recharging and restoration of the batteries of sensor nodes, the intention of our research is to deal with the multi-objective optimization problem of minimizing total energy consumption and balancing residual energy based on coverage enhancement during redeployment. By using truncated octahedrons to stack the three-dimensional environment seamlessly, the coverage enhancement and energy optimization problems are transformed into a task-assignment problem of moving nodes to truncated octahedrons, and an energy-efficient coverage enhancement strategy based on the vampire bat optimizer (VBO) is proposed to solve the above problem, which is inspired by the egoistic and altruistic behavior of vampire bats. Simulation results demonstrate that the proposed strategy can enhance the uniformity of residual energy of nodes by 30.53%, 43.44% and 32.03% compared to the virtual force-directed particle swarm optimization (VFPSO), the three-dimensional virtual force algorithm (3DVFA), and the Hungarian algorithm (HA), respectively. Additionally, the proposed strategy can reduce the total energy consumption of nodes and also perform well in terms of energy consumption of the maximum energy consumption nodes, final coverage rate, and time consumption.