Faster Communication in Known Topology Radio Networks L. Gasieniec, D. Peleg, and Q. Xin This presentation concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is based on full knowledge about the size and the topology of the network. The first part of the presentation examines the two communication primitives in general graphs. In particular, we propose a new (efficiently computable) deterministic schedule that uses $O(D+\Delta\log n)$ time units to complete the gossiping task in any radio network with size $n$, diameter $D$ and max-degree $\Delta$. Our new schedule improves and simplifies the currently best known gossiping schedule due to Gasieniec, Potapov, and Xin (SIROCCO'04). For the broadcast task we show two new results: a deterministic efficient algorithm for computing a radio schedule of length $D+O(\log^3 n)$, and a randomized algorithm for computing a radio schedule of length $D+O(\log^2 n)$. These results improve on the best currently known $O(D+\log^4 n)$ time schedule due to Elkin and Kortsarz (SODA'05). The second part of the presentation focuses on radio communication in planar graphs, devising a new broadcasting schedule using fewer than $3D$ time slots. This result improves on the currently best known $D+O(\log^3n)$ time schedule proposed by Elkin and Kortsarz (SODA'05).