O
Olaf Landsiedel
Researcher at University of Kiel
Publications - 121
Citations - 2647
Olaf Landsiedel is an academic researcher from University of Kiel. The author has contributed to research in topics: Wireless sensor network & Wireless network. The author has an hindex of 21, co-authored 108 publications receiving 2309 citations. Previous affiliations of Olaf Landsiedel include University of Tübingen & University of Gothenburg.
Papers
More filters
Proceedings ArticleDOI
Orchestra: Robust Mesh Networks Through Autonomously Scheduled TSCH
TL;DR: This paper addresses the challenge of bringing TSCH (Time Slotted Channel Hopping MAC) to dynamic networks, focusing on low-power IPv6 and RPL networks, and introduces Orchestra, which allows Orchestra to build non-deterministic networks while exploiting the robustness of TSCH.
Proceedings ArticleDOI
Accurate prediction of power consumption in sensor networks
TL;DR: This paper presents AEON (accurate prediction of power consumption), a novel evaluation tool to quantitatively predict energy consumption of sensor nodes and whole sensor networks and allows to compare different low power and energy aware approaches in terms of energy efficiency.
Proceedings ArticleDOI
Low power, low delay: opportunistic routing meets duty cycling
TL;DR: This paper introduces ORW, a practical opportunistic routing scheme for wireless sensor networks that reduces radio duty-cycles on average by 50% and delays by 30% to 90% when compared to the state of the art.
Proceedings ArticleDOI
Chaos: versatile and efficient all-to-all data sharing and in-network processing at scale
TL;DR: Chaos is introduced, the first primitive that natively supports all-to-all data sharing in low-power wireless networks, and embeds programmable in-network processing into a communication support based on synchronous transmissions.
Proceedings ArticleDOI
Let the tree Bloom: scalable opportunistic routing with ORPL
TL;DR: ORPL is presented, an opportunistic routing protocol that supports any-to-any, on-demand traffic, and increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task.