 
Summary: Selfstabilizing Population Protocols
Dana Angluin, James Aspnes, Michael J. Fischer
and
Hong Jiang
Yale University
This paper studies selfstabilization in networks of anonymous, asynchronously interacting nodes
where the size of the network is unknown. Constantspace protocols are given for Dijkstrastyle
roundrobin token circulation, leader election in rings, 2hop coloring in degreebounded graphs,
and establishing consistent global orientation in an undirected ring. A protocol to construct a
spanning tree in regular graphs using O(log D) memory is also given, where D is the diameter of
the graph. A general method for eliminating nondeterministic transitions from the selfstabilizing
implementation of a large family of behaviors is used to simplify the constructions, and gen
eral conditions under which protocol composition preserves behavior are used in proving their
correctness.
Categories and Subject Descriptors: C.2.4 [Computercommunication Networks]: Distributed
SystemsDistributed applications; B.8.1 [Performance; Reliability]: Reliability, Testing, and
FaultTolerance
General Terms: Algorithms, Reliability
Additional Key Words and Phrases: Anonymous, fairness, finitestate, population protocols, self
stabilization, sensor networks
