Research Article
Hybrid Recovery Strategy Based on Random Terrain in Wireless Sensor Networks
Algorithm 2
Random terrain based path planning (
).
Input: A set of disjoint segments, and . | Output: The initial data collection and aggregation tour | Construct on | for each edge do | | end for | Find a minimum spanning tree of | for each odd-degree vertex do | | end for | Construct on and establish a minimum weighted perfect mathing | Build an Euler graph | Draw an Euler closed trail from a randomly chosen vertex and record the sequence of the trail | | repeat | Starts from , visit every vertex | if is visited, then | jump to the next vertex in | else | | end if | until all s are visited | if all segments are on then | if then | | else | | end if | else | | for all s not on do | Find the edge closest to | | end for | if then | | else | | end if | end if | Return |
|