Anonymous wireless rings

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.

Authors

• Krzysztof Diks
• Evangelos Kranakis
• Adam Malinowski
• Andrzej Pelc

Keywords

No keywords are indexed for this paper.