Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks

Ran, Yingli; Huang, Xiaohui; Zhang, Zhao; Du, Ding‐Zhu

doi:10.1007/s10898-021-01033-y

Cited by 18 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to verify the performance of the proposed method, the influence of the video sensor node parameters and the proposed algorithm parameters on the node coverage is studied, and the existing coverage enhancement algorithms PCMOD [7] , VFA-PSO [9] and Genetic Algorithm [10] , respectively, to evaluate the coverage performance of the video sensor networks through coverage.…”

Section: Comparison Of Simulation Resultsmentioning

confidence: 99%

Research on video sensor networks coverage optimization method in obstacle scene

Zhang

2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Aiming at the presence of obstacles when monitoring wild animals in the forest, an obstacle avoidance method is introduced, and a video sensor networks coverage optimization algorithm for virtual force affected by obstacles fused to an immune clone particle swarm is proposed. The algorithm adjusts locally through virtual forces to reduce the overlapping area and then uses the immune cloning particle swarm algorithm to optimize the global nodes to improve the coverage of nodes in the obstacle scene. The simulation results show that the algorithm proposed in this paper can improve the coverage of nodes.

show abstract

Section: Comparison Of Simulation Resultsmentioning

confidence: 99%

Research on video sensor networks coverage optimization method in obstacle scene

Zhang

2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

show abstract

Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem

Ran,

Jin,

Zhang

2024

Networks

View full text Add to dashboard Cite

Given a set of points on a line, a set of intervals along the line and an integer , each point is associated with a covering requirement , the goal of the minimum interval partial multi‐cover (MinIPMC) problem is to select the minimum number of intervals to fully cover at least points, where a point is fully covered if it belongs to at least selected intervals. This paper presents a 2‐approximation algorithm for the MinIPMC problem.

show abstract

Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations

Wei

Zhao

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks

Cited by 18 publications

References 30 publications

Research on video sensor networks coverage optimization method in obstacle scene

Research on video sensor networks coverage optimization method in obstacle scene

Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem

Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations

Contact Info

Product

Resources

About