We introduce anonymous wireless rings: a new computational model for ring networks. In the well-known hardware ring each processor has two buffers, one corresponding to each of its neighbors. In the wireless ring each processor has a single buffer and cannot distinguish which neighbor the arriving bit comes from. This feature substantially increases anonymity of the ring. A priori it is not clear whether any nontrivial computation can be performed on wireless rings. Nevertheless we show that wireless rings are computationally equivalent to hardware rings.

doi.org/10.1016/0304-3975(94)00178-L
Theoretical Computer Science
School of Computer Science

Diks, K. (Krzysztof), Kranakis, E, Malinowski, A. (Adam), & Pelc, A. (Andrzej). (1995). Anonymous wireless rings. Theoretical Computer Science, 145(1-2), 95–109. doi:10.1016/0304-3975(94)00178-L