Predavatelj: František Galčik (P.J. Šafarik University in Košice)

Radio networks differ from other communication networks in the way
how the nodes send and receive messages. Radio networks are often
modeled by graphs. We present a standard graph model of radio
networks and a newly proposed graph model of radio networks with a
long-range interference. We focus on the broadcasting problem in the
case when full topology information is available to nodes. For both
models, we give an overview of main results and show some basic
algorithms. Finally, we discuss relations between communication
algorithms (in distributed setting, as well) and useful combinatorial
tools such as selective families.