A Trajectory-Based Coverage Assessment Approach for Universal Sensor Networks

Abstract

To solve the problem of coverage performance assessment, this study proposes an evaluation method based on the trajectory of the target, which is applicable to universal sensor networks, including both heterogeneous and homogeneous sensor networks. Different from the traditional Voronoi algorithm, the proposed Improved Coverage Force Division (ICFD) plans a coverage force division map whichscales the qualitative coverage performancebasedon both covering intensities andlocations of the nodes. Furthermore, the Trajectory-based Evaluating Schedule (TES) is responsible for solving the quantitative coverage evaluationproblem by measuringthe resulting trajectories’ Balance Values (BVs). A model of weak-point ranking conjoined in consideration of coverage force and distance can guide future deployment to compensate coverage. Comparative trials using the greedy algorithm, Voronoi algorithm, and the proposed TES verify that TES achieves the approximate results for two-stage and multistage heterogeneous sensor networks with acceptable difference and lower complexity, and it is superior to the Voronoi algorithm in homogeneous sensor networks interms of breaking the four-point circle block.

An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks

“…Besides, they improve the event detection rate to calculate the event detection lost or the detection error and coverage holes that seriously damage the quality of monitoring in WSNs. In [ 32 ], the authors design a localized coverage force division algorithm to find the coverage quality in WSNs. However, their algorithm can neither detect the coverage holes nor find the shape and size of a hole.…”