A LOCALIZED SELF-HEALING ALGORITHM FOR NETWORKS OF MOVEABLE SENSOR NODES

1. Mohamed Younis, Sookyoung Lee, Sheetal Gupta and Kevin Fisher Department of Computer Science and Electrical Engineering University of Maryland, Baltimore County IEEE Globecom 2008 A LOCALIZED SELF-HEALING ALGORITHM FOR NETWORKS OF MOVEABLE SENSOR NODES

2. Introduction • Related work • DARA approach • RIM Approach • Simulation • NN approach • Conclusion outline

3. A Wireless sensor and actor networks (WSAN) involves two types of nodes: • Sensors • Actors Introduction Command node Sensor node Actor Inter - actor communication Communication with the command node

4. The failed actor serves as a cut-vertex node in the network Introduction Command node Sensor node Actor Inter - actor communication Communication with the command node

5. Introduction E D A B C Actor Inter - actor communication

6. Introduction E D A B C Actor Inter - actor communication

7. Related work - DARA [11] A. Abbasi, K. Akkaya and M. Younis, “A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks,” in the Proceedings of the 32nd IEEE Conf. on Local Computer Networks (LCN’07), Dublin, Ireland, Oct. 2007.

8. Related work - DARA 1 3 2 1 [11] A. Abbasi, K. Akkaya and M. Younis, “A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks,” in the Proceedings of the 32nd IEEE Conf. on Local Computer Networks (LCN’07), Dublin, Ireland, Oct. 2007.

9. Related work - DARA [11] A. Abbasi, K. Akkaya and M. Younis, “A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks,” in the Proceedings of the 32nd IEEE Conf. on Local Computer Networks (LCN’07), Dublin, Ireland, Oct. 2007.

10. The paper proposed only requires the knowledge of 1-hop neighbors approach. • Minimizes messaging overhead • Reduces the distance that individual nodes travel during the recovery GOAL

11. Nodes know their position relative to their neighbors, not necessarily their exact coordinates. assumption

12. Each node broadcasts a HELLO message to introduce itself to its neighbors, then builds a list of directly reachable nodes. Each table entry contains two parameters: {Node_ID, Relative position} Rim approach

13. Periodically send heartbeat messages to their neighbors to ensure that they are functional Rim approach E D G B F C A H

14. Move until they are a distance r/2 from the failed node Rim approach E D G B r F F C A H

15. This point is the closest intersection point of the two circles of radius r centered at B and C. Rim approach E D B G C A H

16. Node D determines its new location based only on B’s position. Rim approach E D r B B G C A H

17. Node E determines its new location based only on D’s position. Rim approach E r D D B G C A H

18. Simulation

19. Simulation

20. Every node is aware of its 2-hop neighbors Nearest Neighbor(NN) algorithm E D D G B B F F C A H

21. Simulation

22. Simulation

23. Simulation

24. RIM is a distributed algorithm for Recovery through Inward Motion. RIM minimizes messaging overhead and reduces the distance each individual node travels during the recovery. CONCLUSION