Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks

Figure 12

(a) Boundary node diagram (red nodes are boundary nodes). (b) Boundary edge diagram (bold lines are the boundary edges we found, and red bold line is one of the false boundary edges). (c) Network diagram after deleting false boundary edges (bold lines are the boundary edges). (d) Boundary cycle diagram (the cycle formed by bold lines is the boundary cycle we found, and the red cycle is one of the deletable cycles). (e) Filtering boundary cycle diagram (the cycle formed by bold lines is the boundary cycle). (f) Hole identification diagram (the cycle formed by bold lines is the hole boundary).

(a)

(b)

(c)

(d)

(e)

(f)