State machine based operating system architecture for wireless sensor networks

Authors:
Tae-Hyung Kim;Seongsoo Hong
Affiliations:
Department of Computer Science and Engineering, Hanyang University, Ansan, Kyunggi-Do, South Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, South Korea
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 3
Cited 1

Statecharts: A visual formalism for complex systems

Science of Computer Programming
System architecture directions for networked sensors

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Maté: a tiny virtual machine for sensor networks

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems

Deriving State Machines from TinyOS Programs Using Symbolic Execution

IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless sensor network is characterized as a massively distributed and deeply embedded system. Such a system requires concurrent and asynchronous event handling as a distributed system and resource-consciousness as an embedded system. State machine based software design techniques are capable of satisfying exactly these requirements. In this paper, we present how to design a compact and efficient operating system for wireless sensor nodes based on a finite state machine. We describe how this operating system can operate in an extremely resource constrained sensor node while providing the required concurrency, reactivity, and reconfigurability. We also show some important benefits implied by this architecture.