Preemptive two-level priority real-time scheduling strategy for node system in wireless sensor network

Authors:
Zhao Zhibin;Li Zhuoyue;Liu Shurong
Affiliations:
Northeastern University;Northeastern University;Hebei Normal University of Science & Technology
Venue:
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Year:
2008

Citing 3
Cited 0

System architecture directions for networked sensors

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Reinventing the Travois: Encryption/MAC in 30 ROM Bytes

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Emerging applications such as forest fire monitoring have increasing demands on WSN to transmit data in real-time. In order to ensure real-time data transmission, it requires that the operating system of a node should schedule tasks in real-time. TinyOS is one of the most popular operation systems that support multifarious applications. However, its FIFO scheduling strategy does not guarantee requirements for hard real-time applications. A Preemptive Two-Level Priority (PTLP) Real-time Scheduling Strategy is proposed in this paper. Two tier priorities, static and dynamic, are designed and integrated in TinyOS task queue to guarantee the real-time task scheduling. We demonstrate this approach by a real-world case study: a WSN hardware node embedded with our task scheduling strategy is designed and implemented. The result demonstrates that our PTLP real-time scheduling strategy performs efficiently in terms of packet throughput and task scheduling time.