Research Article
Boundary Detection Method for Large-Scale Coverage Holes in Wireless Sensor Network Based on Minimum Critical Threshold Constraint
Algorithm 2
Iterative thinning algorithm for local large-scale coarse boundary.
| Input: The local large-scale coarse boundary , the minimum cut node pair , the least common | | ancestor . | | Output: The accurate large-scale coverage hole boundary . | | (1) ← the network consisting of and its internal redundant shortest paths; //The first stage | | (2) ← generating the shortest path tree of the ; | | (3) ← searching the shortest path from to in the ; | | (4) ← searching the shortest path from to in the ; | | (5) ; | | (6) ← the network consisting of and its internal sleep nodes; //The second stage | | (7) ← generating the shortest path tree of the ; | | (8) ← searching the shortest path from to in the ; | | (9) ← searching the shortest path from to in the ; | | (10) ; | | (11) return ; |
|