Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks


ZHAO Zhi-bin, GAO Fuxiang, Journal of Information Processing Systems Vol. 5, No. 3, pp. 135-144, Jun. 2009  

10.3745/JIPS.2009.5.3.135
Keywords: Real-time Schedule, Wireless Sensor Networks, Two-level Priority, TinyOS, Dynamic Schedule
Fulltext:

Abstract

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-timeway. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy(RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities.RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicatethat RTS has a good performance both in communication throughput and over-load.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
ZHAO Zhi-bin and GAO Fuxiang (2009). Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks. Journal of Information Processing Systems, 5(3), 135-144. DOI: 10.3745/JIPS.2009.5.3.135.

[IEEE Style]
Z. Zhi-bin and G. Fuxiang, "Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks," Journal of Information Processing Systems, vol. 5, no. 3, pp. 135-144, 2009. DOI: 10.3745/JIPS.2009.5.3.135.

[ACM Style]
ZHAO Zhi-bin and GAO Fuxiang. 2009. Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks. Journal of Information Processing Systems, 5, 3, (2009), 135-144. DOI: 10.3745/JIPS.2009.5.3.135.