Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Koen Langendoen is active.

Publication


Featured researches published by Koen Langendoen.


international conference on embedded networked sensor systems | 2003

An adaptive energy-efficient MAC protocol for wireless sensor networks

Tijs van Dam; Koen Langendoen

In this paper we describe T-MAC, a contention-based Medium Access Control protocol for wireless sensor networks. Applications for these networks have some characteristics (low message rate, insensitivity to latency) that can be exploited to reduce energy consumption by introducing an activesleep duty cycle. To handle load variations in time and location T-MAC introduces an adaptive duty cycle in a novel way: by dynamically ending the active part of it. This reduces the amount of energy wasted on idle listening, in which nodes wait for potentially incoming messages, while still maintaining a reasonable throughput.We discuss the design of T-MAC, and provide a head-to-head comparison with classic CSMA (no duty cycle) and S-MAC (fixed duty cycle) through extensive simulations. Under homogeneous load, T-MAC and S-MAC achieve similar reductions in energy consumption (up to 98%) compared to CSMA. In a sample scenario with variable load, however, T-MAC outperforms S-MAC by a factor of 5. Preliminary energy-consumption measurements provide insight into the internal workings of the T-MAC protocol.


Computer Networks | 2003

Distributed localization in wireless sensor networks: a quantitative comparison

Koen Langendoen; Niels Reijers

This paper studies the problem of determining the node locations in ad-hoc sensor networks. We compare three distributed localization algorithms (Ad-hoc positioning, Robust positioning, and N-hop multilateration) on a single simulation platform. The algorithms share a common, three-phase structure: (1) determine node-anchor distances, (2) compute node positions, and (3) optionally refine the positions through an iterative procedure. We present a detailed analysis comparing the various alternatives for each phase, as well as a head-to-head comparison of the complete algorithms. The main conclusion is that no single algorithm performs best; which algorithm is to be preferred depends on the conditions (range errors, connectivity, anchor fraction, etc.). In each case, however, there is significant room for improving accuracy and/or increasing coverage.


international parallel and distributed processing symposium | 2006

Murphy loves potatoes: experiences from a pilot sensor network deployment in precision agriculture

Koen Langendoen; Aline Baggio; Otto W. Visser

We report on preliminary experiences with deploying a large-scale sensor network (about 100 nodes) for a pilot in precision agriculture. The pilot did not answer the initial research questions, but instead revealed many engineering problems typically overlooked by (computer) scientists evaluating their work by means of simulation. The deployment prompted us to rethink our development process and includes important lessons for the WSN research community as a whole


acm/ieee international conference on mobile computing and networking | 2001

Dynamic voltage scaling on a low-power microprocessor

Johan A. Pouwelse; Koen Langendoen; Henk J. Sips

Power consumption is the limiting factor for the functionality of future wearable devices. Since interactive applications like wireless information access generate bursts of activities, it is important to match the performance of the wearable device accordingly. This paper describes a system with a microprocessor whose speed can be varied (frequency scaling) as well as its supply voltage. Voltage scaling is important for reducing power consumption to very low values when operating at low speeds. Measurements show that the energy per instruction at minimal speed is 1/5 of the energy required at full speed. The frequency and voltage can be scaled dynamically from user space in only 140 μs. This allows power-aware applications to quickly adjust the performance level of the processor whenever the workload changes. Experiments with an H.263 video benchmark show that the power-aware decoder outperforms a static fixed-frequency policy as well as a dynamic interval-based scheduler.


sensor networks and applications | 2003

Efficient code distribution in wireless sensor networks

Niels Reijers; Koen Langendoen

The need to reprogramme a wireless sensor network may arise from changing application requirements, bug fixes, or during the application development cycle. Once deployed, it will be impractical at best to reach each individual node. Thus, a scheme is required to wirelessly reprogramme the nodes. We present an energy-efficient code distribution scheme to wirelessly update the code running in a sensor network. Energy is saved by distributing only the changes to the currently running code. The new code image is built using an edit script of commands that are easy to process by the nodes. A small change to the programme code can cause many changes to the binary code because the addresses of functions and data change. A naive approach to building the edit script string would result in a large script. We describe a number of optimisations and present experimental results showing that these significantly reduce the edit script size.


international conference on embedded wireless systems and networks | 2007

Crankshaft: an energy-efficient MAC-protocol for dense wireless sensor networks

Gertjan P. Halkes; Koen Langendoen

This paper introduces Crankshaft, a MAC protocol specifically targeted at dense wireless sensor networks. Crankshaft employs node synchronisation and offset wake-up schedules to combat the main cause of inefficiency in dense networks: overhearing by neighbouring nodes. Further energy savings are gained by using efficient channel polling and contention resolution techniques. Simulations show that Crankshaft achieves high delivery ratios at low power consumption under the common convergecast traffic pattern in dense networks. This performance is achieved by trading broadcast bandwidth for energy efficiency. Finally, tests with a TinyOS implementation demonstrate the real-world feasibility of the protocol.


ACM Transactions on Computer Systems | 1998

Performance evaluation of the Orca shared-object system

Henri E. Bal; Raoul Bhoedjang; Rutger F. H. Hofman; Ceriel J. H. Jacobs; Koen Langendoen; Tim Rühl; M. Frans Kaashoek

Orca is a portable, object-based distributed shared memory (DSM) system. This article studies and evaluates the design choices made in the Orca system and compares Orca with other DSMs. The article gives a quantitative analysis of Orcas coherence protocol (based on write-updates with function shipping), the totally ordered group communication protocol, the strategy for object placement, and the all-software, user-space architecture. Performance measurements for 10 parallel applications illustrate the trade-offs made in the design of Orca and show that essentially the right design decisions have been made. A write-update protocol with function shipping is effective for Orca, especially since it is used in combination with techniques that avoid replicating objects that have a low read/write ratio. The overhead of totally ordered group communication on application performance is low. The Orca system is able to make near-optimal decisions for object placement and replication. In addition, the article compares the performance of Orca with that of a page-based DSM (TreadMarks) and another object-based DSM (CRL). It also analyzes the communication overhead of the DSMs for several applications. All performance measurements are done on a 32-node Pentium Pro cluster with Myrinet and Fast Ethernet networks. The results show that Orca programs send fewer messages and less data than the TreadMarks and CRL programs and obtain better speedups.


Mobile Networks and Applications | 2005

Comparing energy-saving MAC protocols for wireless sensor networks

Gertjan P. Halkes; T. van Dam; Koen Langendoen

Applications for wireless sensor networks have notably different characteristics and requirements from standard WLAN applications. Low energy consumption is the most important consideration. The low message rate that is typical for sensor network applications and the relaxed latency requirements allow for significant reductions in energy consumption of the radio. In this article we study the energy saved by two MAC protocols optimized for wireless sensor networks, S-MAC and T-MAC, in comparison to standard CSMA/CA, We also report on the effects of low-power listening, a physical layer optimization, in combination with these MAC protocols. The comparison is based on extensive simulation driven by traffic that varies over time and location; sensor nodes are inactive unless they observe some physical event, or send status updates to the sink node providing the connection to the wired world. T-MAC} in combination with low-power listening saves most energy, but can not handle the same peak loads as CSMA/CA and S-MAC.


mobile adhoc and sensor systems | 2004

Link layer measurements in sensor networks

Niels Reijers; Gertjan P. Halkes; Koen Langendoen

Key issues in wireless sensor networks such as data aggregation, localisation, MAC protocols and routing, all have to do with communication at some level. At a low level, these are influenced by the link layer performance between two nodes. The lack of accurate sensor network specific radio models, and the limited experimental data on actual link behaviour warrant additional investigation in this area. We present the results from extensive experiments, exploring several factors that are relevant for the link layer performance. These include (i) the effect of interference from simultaneous transmissions, which has not been looked into before, (ii) the degree of symmetry in the links between nodes, and (iii) the use of calibrated RSSI measurements. Finally, we present some guidelines on how to use the results for effective protocol design.


mobility management and wireless access | 2004

Hybrid rate control for IEEE 802.11

Ivaylo Haratcherev; Koen Langendoen; Reginald L. Lagendijk; Henk J. Sips

Streaming multimedia content in real-time over a wireless link is a challenging task because of the rapid fluctuations in link conditions that can occur due to movement, interference, and so on. The popular IEEE 802.11 standard includes low-level tuning parameters like the transmission rate. Standard device drivers for todays wireless products are based on gathering statistics, and consequently, adapt rather slowly to changes in conditions. To meet the strict latency requirements of streaming applications, we designed and implemented an advanced control algorithm that uses signal-strength (SNR) information to achieve fast responses. Since SNR readings are quite noisy we do not use that information to directly control the rate setting, but rather as a safeguard limiting the range of feasible settings to choose from. We report on real-time experiments involving two laptops equipped with IEEE 802.11a wireless interface cards. The results show that using SNR information greatly enhances responsiveness in comparison to statistics-based rate controllers.

Collaboration


Dive into the Koen Langendoen's collaboration.

Top Co-Authors

Avatar

Henri E. Bal

VU University Amsterdam

View shared research outputs
Top Co-Authors

Avatar

Henk J. Sips

Delft University of Technology

View shared research outputs
Top Co-Authors

Avatar

Marco Zuniga

Delft University of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Matthias Woehrle

Delft University of Technology

View shared research outputs
Top Co-Authors

Avatar

Kay Uwe Römer

Graz University of Technology

View shared research outputs
Top Co-Authors

Avatar

Dick Grune

VU University Amsterdam

View shared research outputs
Top Co-Authors

Avatar

Gertjan P. Halkes

Delft University of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge