#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2002

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Stefan Dulman, Tim Nieberg, Jian Wu, Paul J. M. Havinga
- WCNC
- 2003

In wireless sensor networks (WSN) data produced by one or more sources usually has to be routed through several intermediate nodes to reach the destination. Problems arise when intermediate nodesâ€¦ (More)

- Tim Nieberg, Johann Hurink
- WAOA
- 2005

We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs. In contrast to previously known approximation schemes for the minimum dominatingâ€¦ (More)

- Lodewijk van Hoesel, Tim Nieberg, Jian Wu, Paul J. M. Havinga
- IEEE Wireless Communications
- 2004

This article presents a cross-layered approach for networking in wireless sensor networks. WSNs differ greatly from traditional ad hoc wireless networks and therefore require the use of new types ofâ€¦ (More)

- L.F.W. van Hoesel, Tim Nieberg, H.J. Kip, P. J. M. Havinga
- 2004 IEEE 59th Vehicular Technology Conferenceâ€¦
- 2004

The paper presents EMACs, a medium access protocol especially designed for wireless sensor networks. The medium access protocol consists of a fully distributed and self-organizing TDMA scheme, inâ€¦ (More)

- Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
- DISC
- 2005

The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm forâ€¦ (More)

- Tim Nieberg, Johann Hurink, Walter Kern
- ACM Trans. Algorithms
- 2008

Wireless networks are created by the communication links between a collection of radio transceivers. The nature of wireless transmissions does not lead to arbitrary undirected graphs but toâ€¦ (More)

- Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer
- DIALM-POMC
- 2005

We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms runâ€¦ (More)

- Tim Nieberg
- Electronic Notes in Discrete Mathematics
- 2003

- Tim Nieberg, Johann Hurink, Walter Kern
- WG
- 2004

A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem in unit disk graphs.â€¦ (More)

- Tim Nieberg, Stefan Dulman, +4 authors Harmke de Groot
- 2003

In this paper, we present the design of the communication in a wireless sensor network. The resource limitations of a wireless sensor network, especially in terms of energy, require an integrated,â€¦ (More)