#### Filter Results:

#### Publication Year

2006

2011

#### Co-author

#### Key Phrase

#### Publication Venue

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)

Computing Steiner minimum trees in Hamming metric is a well studied problem that has applications in several fields of science such as computational linguistics and computational biology. Among all methods for finding such trees, algorithms using variations of a branch and bound method developed by Penny and Hendy have been the fastest for more than 20… (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)

- Rouven Naujoks
- 2011

Broadcasting a message from a given source node to all other nodes is a fundamental task during the operation of a wireless network. In many application scenarios the network nodes have only a limited energy supply, hence minimizing the energy consumption of any communication task prolongs the lifetime of the network. During a broadcast operation using… (More)

- ‹
- 1
- ›