Matthias Grünewald

Energy, congestion and dilation in radio networks

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

Distributed Maintenance of Resource Efficient Wireless Network Topologies

g(V)

Congestion, Dilation, and Energy in Radio Networks

of a set

Performance of distributed algorithms for topology control in wireless networks

V\subseteq \REAL^2

Network application driven instruction set extensions for embedded processing clusters

. It can be used to upperbound the number of interfering edges. For real-world applications it can be regarded as

Using mini robots for prototyping intersection management of vehicles

\Theta(\log n)

A performance evaluation method for optimizing embedded applications

. A main result of the paper is that a weak

A framework for design space exploration of resource efficient network processing on multiprocessor SoCs

c

A mapping strategy for resource-efficient network processing on multiprocessor SoCs

-spanner construction as a communication network allows to approximate the congestion-optimal communication network by a factor of

A low complexity directional scheme for mobile ad hoc networks

O(g(V)^2)