Wireless sensor networks (WSNs) are an emerging field of research which combines many challenges in distributed computing and network optimization. One important goal is to improve the functional lifetime of the sensor network using energy-efficient distributed algorithms, networking and routing techniques, and dynamic power management techniques. The energy consumption represents the major cost metric in almost all algorithms that are to be run in and on top of the WSN. Resulting from these constraints, various optimization criteria emerge. In our talk, we present some of the differences between energy-efficient wireless networking and network optimization usually considered by explaining key design features needed in the envisioned setting of wireless sensor networks.
|Journal||Electronic notes in discrete mathematics|
|Publication status||Published - 2003|
|Event||2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2003 - University of Twente, Enschede, Netherlands|
Duration: 14 May 2003 → 16 May 2003