a localized self-healing algorithm for networks of moveable sensor nodes mohamed younis, sookyoung...
TRANSCRIPT
A LOCALIZED SELF-HEALING ALGORITHM FOR NETWORKS OF
MOVEABLE SENSOR NODES
Mohamed Younis, Sookyoung Lee, Sheetal Gupta and Kevin Fisher
Department of Computer Science and Electrical EngineeringUniversity of Maryland, Baltimore County
IEEE Globecom 2008
Introduction Related work
DARA approach RIM Approach Simulation
NN approach Conclusion
A Wireless sensor and actor networks (WSAN) involves two types of nodes: Sensors Actors
Command node
Sensor nodeActor
Inter - actor communication
Communication with the command node
The failed actor serves as a cut-vertex node in the network
Command node
Sensor nodeActor
Inter - actor communication
Communication with the command node
Actor
Inter - actor communication
A
B C
DE
Actor
Inter - actor communication
A
B C
DE
[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.
3
12
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.
[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.
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
Nodes know their position relative to their neighbors, not necessarily their exact coordinates.
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}
Periodically send heartbeat messages to their neighbors to ensure that they are functional
D
E
C
A
B
F
G
H
Move until they are a distance r/2 from the failed node
D
C
A
B
F
G
H
Fr
2
r
2
r
E
This point is the closest intersection point of the two circles of radius r centered at B and C.
D
A
BG
H
C
E
C
Node D determines its new location based only on B’s position.
D
A
BG
H
Br
E
C
D
A
BG
H
Dr
E
Node E determines its new location based only on D’s position.
Simulator ?????
Number of sensors 300 mobile actor nodes
Area size 1000m × 1000m
Initially placed random
Every node is aware of its 2-hop neighbors
D
E
C
A
B
F
G
H
D
B
F
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.
