Y-Threads: supporting concurrency in wireless sensor networks

  • Authors:
  • Christopher Nitta;Raju Pandey;Yann Ramin

  • Affiliations:
  • Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA

  • Venue:
  • DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Resource constrained systems often are programmed using an event-based model. Many applications do not lend themselves well to an event-based approach, but preemptive multithreading pre-allocates resources that cannot be used even while not in use by the owning thread. In this paper, we propose a hybrid approach called Y-Threads. Y-Threads provide separate small stacks for blocking portions of applications, while allowing for shared stacks for non-blocking computations. We have implemented Y-Threads on Mica and Telos wireless sensor network platforms. The results show that Y-Threads provide a preemptive multithreaded programming model with resource utilization closer to an event-based approach. In addition, relatively large memory buffers can be allocated for temporary use with less overhead than conventional dynamic memory allocation methods.