supported by the DFG-Sonderforschungsbereich 376 and by

We investigate the problem of path selection in radio networks for a given set of sites in two-dimensional space. For some given static point-to-point communication demand we define measures for congestion, energy consumption and dilation that take interferences between communication links into account. We show that energy optimal path selection for radio networks can be computed in polynomial time. Then, we introduce the diversity g(V) of a set V ⊆ 2. It can be used to upperbound the number of interfering edges. For real-world applications it can be regarded as Θ(log n). A main result of the paper is that a weak c-spanner construction as a communication network allows to approximate the congestionoptimal communication network by a factor of O(g(V) 2). Furthermore, we show that there are vertex sets where only one of the performance parameters congestion, energy, and dilation can be optimized at a time. We show trade-offs lower bounding congestion × dilation and dilation × energy. For congestion and energy the situation is even worse. It is only possible to find a reasonable approximation for either congestion or energy minimization, while the other parameter is at least a polynomial factor worse than in the optimal network