Distributed Connectivity Restoration Algorithm with Optimal Repair Path in Wireless Sensor and Actor Networks

Algorithm 1

GDCR.

1: Initialize 1-hop neighbor’s information table NT for each node;

2: for every node do

3:  if is a critical node then

4:   ; ;

5:  else

6:   ; ;

7:  end if

8: end for

9: while the gradient distribution is not stable do

10:  if critical node received a HELLO message then

11:    updates its own gradient value based on formula (2)

12:  End if

13: End while

14: For every critical node do

15:  Appoint an optimal backup for node based on the criteria mentioned in Section 4-B2.

16:   sends a BACKUP message to notify its backup node to monitor its status

17: end for

18: if backup node A detects the failure or move of its primary node F then

19:  Move node A to the location of node F

20: end if