Self-stabilizing neighborhood synchronizer in tree networks

Proposes a self-stabilizing synchronization technique, called the Neighborhood Synchronizer (𝒩𝒮), that synchronizes nodes with their neighbors in a tree network. The 𝒩𝒮 scheme has an extremely small memory requirement-only one bit per processor. Algorithm 𝒩𝒮 is inherently self-stabilizing. We apply our synchronizer to design a broadcasting algorithm ℬ𝒜 in a tree network. Algorithm ℬ𝒜 is also inherently self-stabilizing and needs only 2h+2m-1 rounds to broadcast m messages, where h is the height of the tree