This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-09-07 Creation time: 20-33-17 --- Number of references 3 techreport 2008-fgsn-alizai-stle 2008 7 27-30 wld fileadmin/papers/2008/2008-08-alizai-fgsn-stle.pdf ftp://ftp.inf.fu-berlin.de/pub/reports/tr-b-08-12.pdf Print Fachbereich Mathematik und Informatik

Berlin, Germany

Proceedings of the 7th GI/ITG Workshop on Wireless Sensor Networks FGSN 08 September 2010 en 1 Muhammad HamadAlizai OlafLandsiedel KlausWehrle AlexanderBecher inproceedings 2008-becher-hotemnets-linkestimation 2008 6 3 1--5 Commonly, routing in sensor networks is limited to longterm stable links. Unstable links, although often promising to be of large routing progress, are not considered for packet forwarding as link estimators typically cannot handle their dynamics. In this paper we introduce short-term link estimation to capture link dynamics at a high resolution in time and to identify when these render a link temporarily reliable or unreliable. We identify such dynamics based on packet overhearing, predict short-term availability and unavailability, and adapt neighbor tables, thereby enlarging the set of links useable by any routing algorithm. Additionally, we show that short-term link estimation integrates seamlessly into today's sensor network link estimators and routing protocols. wld fileadmin/papers/2008/2008-becher-hotemnets-linkestimation.pdf Online ACM Press

New York, NY, USA

Proceedings of Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08), Charlottesville, VA, USA Chalottesville, USA Fifth Workshop on Embedded Networked Sensors (Hot EmNets'08) June 2-3, 2008 en 978-1-60558-209-2 1 AlexanderBecher OlafLandsiedel GeorgKunz KlausWehrle inproceedings 200804landsiedelIPSN08TimingMatters 2008 344-354 The rising complexity of data processing algorithms in sensor networks combined with their severely limited computing power necessitates an in-depth understanding of their temporal behavior. However, today only cycle accurate emulation and test-beds provide a detailed and accurate insight into the temporal behavior of sensor networks. In this paper we introduce fine grained, automated instrumentation of simulation models with cycle counts derived from sensor nodes and application binaries to provide detailed timing information. The presented approach bridges the gap between scalable but abstracting simulation and cycle accurate emulation for sensor network evaluation. By mapping device-specific code with simulation models, we can derive the time and duration a certain code line takes to get executed on a sensor node. Hence, eliminating the need to use expensive instruction-level emulators with limited speed and restricted scalability. Furthermore, the proposed design is not bound to a specific hardware platform, a major advantage compared to existing emulators. Our evaluation shows that the proposed technique achieves a timing accuracy of 99% compared to emulation while adding only a small overhead. Concluding, it combines essential properties like accuracy, speed and scalability on a single simulation platform. fileadmin/papers/2008/2008-04-IPSN-2008-landsiedel-Timing-Matters.pdf Print IEEE Computer Society

Washington, DC, USA

Proceedings of the 7th ACM International Conference on Information Processing in Sensor Networks (IPSN 2008), St. Louis, MO, USA en 978-0-7695-3157-1 1 OlafLandsiedel Muhammad HamadAlizai KlausWehrle