Coverage hole detection and repair method of dynamic sensor network based on Sub-Voronoi graph area method

Abstract

The invention discloses a coverage hole detection and repair method of a dynamic sensor network based on a Sub-Voronoi graph area method. The method provides an algorithm for dividing a Voronoi unit into sub-Voronoi units and calculating a coverage hole area within each sub-Voronoi unit and a candidate movement position within a maximum sub-area facing to the area hole to detect and repair the coverage hole in the dynamic sensor network; two algorithms are respectively used for calculating the candidate movement positions used for repairing the coverage hole within the Voronoi polygon of each node, and the candidate movement positions are respectively SVHG and SVHI; and the algorithm can be used for accurately estimating the position of the coverage hole in the Voronoi unit, accurately calculating the area of the hole within each Voronoi unit and quickly maximizing the area coverage efficiency at the same time, so as to repair the hole and maximize the network utilization rate.

Description

technical field [0001] The invention relates to a dynamic sensor network coverage hole detection and repair method based on a sub-Voronoi diagram area method, and belongs to the technical field of artificial intelligence. Background technique [0002] Wireless sensor networks are widely used in various fields such as environmental monitoring, intrusion detection, intelligent transportation, smart agriculture, and smart cities; [0003] The coverage performance of the wireless sensor network reflects the monitoring degree of the network node to the monitoring area, and is a basic indicator to measure the service quality of the wireless sensor network; the area coverage requires that each point in the monitoring area is covered by the sensing range of at least one sensor node. The set of points in the monitoring area that are not covered by any sensor is the coverage hole; the coverage hole may be caused by the following reasons: random distribution of nodes, failure of nodes,...

AI Technical Summary

Problems solved by technology

[0005] Method based on computational geometry: "Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks" published in "Journal of Network and Computer Applications" (Journal of Network and Computer Applications) in 34 (5): 1743-1756 in 2011 (distributed wireless sensor network coverage hole detection protocol based on computational geometry method) proposed based on A distributed hole detection protocol based on computational geometry method. The existence of holes depends on the properties of a triangle composed of a reference node and any two adjacent nodes (within 1 hop or 2 hops); the communication range of each node is the same as The perception range is the same, which can save more energy in the communication process; in 2013, "Journal of Theoretical and Applied Information Technology" (Journal of Theoretical and Applied Information Technology) published "Coverage holes discovery algorithm for wireless sensor network" (coverage hole in wireless sensor network) at 48 (2): 1121-1125 Discovery Algorithm) proposes a coverage hole discovery algorithm based on geometric methods. A node forms a triangle with its adjacent nodes, calculates the circumcircle radius and circumcircle center of the triangle, and judges whether the hole exists according to the existing geometric theory; the above two This algorithm can identify triangular holes, but does not give a global perspective of coverage holes; in 2015, "Journal of Network and Computer Applications" (Network and Computer Application Journal) published "Coverage hole and boundary nodes detection in wireless sensor network" (coverage holes and boundary nodes in wireless sensor networks) at 48:35-43 Detection algorithm) proposes an algorithm to estimate whether there is a coverage hole in the wireless sensor network according to the properties of the empty circle, and to identify the hole boundary node. This algorithm can accurately identify the boundary node, effectively detect various coverage holes, and reduce the algorithm complexity; based on calculation The geometric method can accurately give the number of holes in a certain area, but cannot accurately describe the position and size of the covered holes;

Images