In my talk I present three algorithmic aspects that can be related to
routing in ad-hoc and sensor networks. I start by presenting the first local
clustering algorithm that provably manages to compute a non-trivial
connected dominating set approximation in a constant number of rounds for
general graphs. Then I explain a worst-case optimal geometric routing
algorithm known as GOAFR which uses the idea of face routing in an efficient
manner. And finally I present a series of new results in topology control,
in particular I present the XTC algorithm, and I show that all classic
topology control algorithms do not optimize interference.