VKECE-3D: Energy-Efficient Coverage Enhancement in Three-Dimensional Heterogeneous Wireless Sensor Networks Based on 3D-Voronoi and K-Means Algorithm
Related Experiment Video
Updated: Aug 13, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Pingzhang Gou1, Baoyong Guo1, Miao Guo1
1College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China.
Abstract:
During these years, the 3D node coverage of heterogeneous wireless sensor networks that are closer to the actual application environment has become a strong focus of research. However, the direct application of traditional two-dimensional planar coverage methods to three-dimensional space suffers from high application complexity, a low coverage rate, and a short life cycle. Most methods ignore the network life cycle when considering coverage. The network coverage and life cycle determine the quality of service (QoS) in heterogeneous wireless sensor networks. Thus, energy-efficient coverage enhancement is a significantly pivotal and challenging task. To solve the above task, an energy-efficient coverage enhancement method, VKECE-3D, based on 3D-Voronoi partitioning and the K-means algorithm is proposed. The quantity of active nodes is kept to a minimum while guaranteeing coverage. Firstly, based on node deployment at random, the nodes are deployed twice using a highly destructive polynomial mutation strategy to improve the uniformity of the nodes. Secondly, the optimal perceptual radius is calculated using the K-means algorithm and 3D-Voronoi partitioning to enhance the network coverage quality. Finally, a multi-hop communication and polling working mechanism are proposed to lower the nodes' energy consumption and lengthen the network's lifetime. Its simulation findings demonstrate that compared to other energy-efficient coverage enhancement solutions, VKECE-3D improves network coverage and greatly lengthens the network's lifetime.
Related Concept Videos
Area Computation by the Alternative Coordinate Method
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Distance Measurements by Taping
Three-Dimensional Force System:Problem Solving
To solve a three-dimensional force system, first resolve each force into its respective scalar components. Do this using...
Uniform Depth Channel Flow: Problem Solving
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...

