Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Complexity of Radio Communication (Extended Abstract)
 

Summary: On the Complexity of Radio Communication
(Extended Abstract)
Noga Alon
Amotz Bar-Noy
Nathan Linial
David Peleg
Abstract
A radio network is a synchronous network of processors
that communicate by transmitting messages to their neigh-
bors. 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 coordina-
tion and complete knowledge of the network topology. This
paper is concerned with lower and upper bounds for the
complexity of realizing various communication primitives
for radio networks.
Our first result deals with the broadcast operation. We
prove the existence of a family of radius-2 networks on n

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics