Briefly describe the characteristics of three typical coverage algorithms (grid-based coverage, circle coverage, worst-case and best-case coverage)? And examples are given to illustrate the applicable application scenarios.
Refer to SCCP for the answer
: Wireless Sensor Network Self-Adjusting Circumferential Coverage Protocol
Wireless Network Coverage Common Technologies
Application of Wireless Sensor Networks in the Internet of Things
Grid-based coverage:
consider that sensor nodes and target points are configured in grid form, nodes use a Boolean coverage model, and use energy vectors to represent the coverage of grid points. A grid-based overlay localization sensor configuration algorithm devises a simulated annealing algorithm to minimize the distance error.
Fields of application: It can monitor soil environmental status, crop irrigation and planting status, livestock and poultry environmental status and surface characteristic testing.
Circumferential Covering:
Generalizing circular covering of the stochastic node covering type as a decision problem. Huang considers the circumference overlap of the coverage area of each sensor node, and then determines whether a given sensor's circumference is completely covered according to the information of neighboring nodes. Then Huang et al. further used a similar method in the literature to map the three-dimensional spherical covering to the two-dimensional circumferential covering, and used a distributed method to solve the problem of three-dimensional spherical covering without increasing the computational complexity. Energy saving is the core issue of wireless sensor network design, minimizing energy consumption and maximizing system lifetime has become the goal of wireless sensor network. Therefore, in a large wireless sensor network, it is very important to prolong the life of the system through energy efficient design without affecting the original performance of the whole use.
Application fields: Use WSN to monitor overhead transmission lines, deploy a large number of sensor nodes (tension sensors, wind speed sensors, temperature sensors, etc.) along the transmission lines, and deploy relay nodes on towers.
Worst and best case coverage: The worst and best case coverage belongs to the types of deterministic network path/target coverage and fence coverage. The algorithm considers how to sense and track the target crossing the network or the stores on its path, reflecting a network coverage nature.
Worst coverage refers to how to find a path in the network, so that the probability of the target moving along the path being discovered by the nodes in the network is the smallest. This path is called the maximal breach path, which maximizes the minimum distance from a point on this path to the nearest sensor around it.
Optimal coverage refers to finding a path in the network, so that the target along the path has the greatest probability of being discovered by nodes in the network. This path is called the maximal support path, which minimizes the maximum distance from a point on the path to the nearest surrounding sensor.
Application areas: industrial safety, traffic control, security system, warehousing and logistics supervision, etc.