Distributed Algorithms in Wireless Sensor Networks

Nieberg, Tim (2003) Distributed Algorithms in Wireless Sensor Networks. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, pp. 81-83.

PDF
Restricted to UT campus only
157Kb

Abstract:	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.
Item Type:	Book Section
Copyright:	© 2003 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/74956
Official URL:	http://dx.doi.org/10.1016/S1571-0653(04)00444-5
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page