Tradeoffs between knowledge and time of communication in geometric radio networks
Anders Dessmark, Andrzej Pelc · 2001
We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes know only a limited part of the network Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range r. A signal from this node can reach all nodes at distance at most r from it but if a node is situated within range of two nodes transmitting simultaneously it cannot get any message. Each node knows the part of the network within knowledge radius s from it, i.e., it knows the positions, labels and ranges of all nodes at distance at most s.