A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors. A processor receives a message in a given step if and only if it is silent then and precisely one of its neighbors transmits. This stringent rule poses serious difficulties in performing even the simplest tasks. This is true even under the overly optimistic assumptions of centralized coordination and complete knowledge of the network topology. We look at the question of simulating two of the standard message-passing models on a radio network. In the general message-passing model, a processor may send each of its outgoing neighbors a possibly different message in each round. In the uniform message-passing model, in each round a processor must send an identical message to all its outgoing neighbors. Both message-passing models can easily simulate the radio model with no overhead. In the other direction, we propose and study a primitive called the single-round simulation (SRS), enabling the simulation of a single round of an algorithm designed for the standard message models. We give lower bounds for the length of SRS schedules for both models and supply constructions or existence proofs for schedules of matching (or almost matching) lengths.
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics