Optimization of Self-Directed Target Coverage in Wireless Multimedia Sensor Network

Algorithm 4

Random algorithm to generate all possible paths in dilatation 𝐺.

Input: dilatation G

Output: subset of self-direction action(ROTATE)

randomly chose a self-direction action for every node and denote it as 𝑊;

Let 𝑊^′=Ø;

WHILE(every target 𝑇_𝑖∈𝑇 is covered by self-direction action in 𝑊)

  Randomly chose a self-direction action Rotate∈𝑊

   𝑊^′=𝑊;

   𝑊=𝑊−{Rotate};

END

RETURN 𝑊^′