Research Article
An Efficient Nodes Failure Recovery Management Algorithm for Mobile Sensor Networks
| | Input: DM = CV or DM = IN or DM = LF | | (1) | If (node A detects, node F has failed) | | (2) | If distance = | | (3) | Find (new neighbors) | | (4) | If (new node found) | | (5) | Restore (connectivity) | | (6) | Else if (new node not found) | | (7) | Move (possible movement distance) | | (8) | Else if (new node not found) | | (9) | Go to (step 39) | | (10) | Restore (connectivity) | | (11) | Else if | | (12) | Go to (step 18) | | (13) | End if | | (14) | End if | | (15) | End if | | (16) | End | | (17) | Else | | (18) | If DM = CV | | (19) | Move (towards node F by possible movement distance) | | (20) | Find (other recovery nodes) | | (21) | If new node found | | (22) | Restore (connectivity) | | (23) | Else if (new node not found) | | (24) | Go to (step 39) | | (25) | End if | | (26) | Else if DM = IN | | (27) | Move (towards node F by possible movement distance) | | (28) | Find (other recovery nodes) | | (29) | If new node found | | (30) | Restore (connectivity) | | (31) | Else if new node not found | | (32) | Go to (step 39) | | (33) | End if | | (34) | Else if DM = LF | | (35) | Move (towards node F by possible movement distance) | | (36) | Find (new node) | | (37) | Restore (connectivity) | | (38) | If new node not found | | (39) | Increase | | (40) | Send (redundant node)//to sink node | | (41) | End if | | (42) | End |
|
