The efficient and robust realization of wireless sensor networks is a challenging technological and algorithmic task, because of the unique characteristics and severe limitations of these devices. This talk presents representative algorithms for important problems in wireless sensor networks, such as data propagation and energy balance. The protocol design uses key algorithmic techniques like randomization and local optimization. Crucial performance properties of the protocols (correctness, fault-tolerance, scalability) and their trade-offs are investigated through both analytic means and large scale simulation. The experimental evaluation of algorithms for such networks is very beneficial, not only towards validating and fine-tuning algorithmic design and analysis, but also because of the ability to study the accurate impact of several important network parameters and technological details. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Nikoletseas, S. (2006). Algorithms for wireless sensor networks: Design, analysis and experimental evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4007 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/11764298_1
Mendeley helps you to discover research relevant for your work.