Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign
transmit power to each sensor such that the sum of the transmit powers of all the sensors is …

While several important problems in the field of sensor networks have already been tackled,
there is still a wide range of challenging, open problems that merit further attention. We …

Motivated by optimization problems in sensor coverage, we formulate and study the
Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a …

Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign
transmit power to each sensor such that the resulting topology containing only bidirectional …

Motivated by the problem of orienting directional antennas in wireless communication
networks, we study average bounded-angle minimum spanning trees. Let P be a set of …

We present a new efficient localized algorithm to construct, for any given quasi-unit disk
graph G=(V, E) and any e> 0, a (1+ e)-spanner for G of maximum degree O (1) and total …

Energy consumption in general and interference in particular being among the most critical
issues in wireless networks, this paper introduces an explicit denition of interference, based …

Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with
sensors, are deployed in some terrain or other. After activation thesensorsformaself …

In order to develop algorithms for sensor networks and in order to give mathematical
correctness and performance proofs, models for various aspects of sensor networks are …

LNCS 4056 - Sensor Networks: Distributed Algorithms Reloaded – or Revolutions? Page 1
Sensor Networks: Distributed Algorithms Reloaded – or Revolutions? Roger Wattenhofer …