Rouven Naujoks

Learn More
13 Article history: 14 Available online xxxx 15 1 6 a b s t r a c t 17 In this paper, we present approximation algorithms for a variety of problems occurring in 18 the design of energy-efficient wireless communication networks. We first study the k-sta-19 tion network problem, where for a set S of stations and some constant k, one wants to 20 assign(More)
Hard real-time systems require tasks to finish in time. To guarantee the timeliness of such a system, static timing analyses derive upper bounds on the worst-case execution time (WCET) of tasks. There are two types of timing analyses: numeric and parametric. A numeric analysis derives a numeric timing bound and, to this end, assumes all information such as(More)
A fundamental class of problems in wireless communication is concerned with the assignment of suitable transmission powers to wireless devices/stations such that the resulting communication graph satisses certain desired properties and the overall energy consumed is minimized. Many concrete communication tasks in a wireless network like broadcast,(More)
  • 1