Browse > Article
http://dx.doi.org/10.3745/JIPS.2009.5.3.135

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

Zhi-bin, Zhao (College of Information Science and Engineering, Northeastern University)
Fuxiang, Gao (College of Information Science and Engineering, Northeastern University)
Publication Information
Journal of Information Processing Systems / v.5, no.3, 2009 , pp. 135-144 More about this Journal
Abstract
Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. 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 indicate that RTS has a good performance both in communication throughput and over-load.
Keywords
real-time schedule; wireless sensor networks; two-level priority; TinyOS; dynamic schedule;
Citations & Related Records
연도 인용수 순위
  • Reference
1 MantisOS [EB/OL]. http://mantis.cs.colorado.edu. 2007 -6-1
2 SOS[EB/OL]. http://nesl.ee.ucla.edu/projects/sos/. 2007 -6-1
3 Han C, Kumar R, Shea R, et al. A dynamic operating system for sensor networks[A], Proceedings of the 3ed International Conference on Mobile Systems, Applications and Servives[C], 2005: 163-176   DOI
4 A. Dunkels, B Gronvall, T Voigt. Contiki--a lightweight and flexible operating system for tiny networked sensor[A], Proceedings of The 29th Annual IEEE International Conference on Local Computer Networks[C], 2004: 455-462   DOI
5 TinyOS[EB/OL], http:// www.tinyos.net, 2007-6-1
6 Hill J, Szewczyk R, Woo A, et al. System architecture directions for networked sensors[J], Operating Systems Review, 2000, 34(5): 93-104   DOI
7 Venkita Subramonian, Huang-Ming Huang, Seema Datar, et al. Priority scheduling in TinyOS – A case study[R], Technical Report WUCSE, Washington University in St. Louis, 2002, Dec
8 Kargahi Mehdi, Movaghar Ali. A method for performance analysis of earliest-deadline-first scheduling policy[J], Journal of Supercomputing, 2006, 37(2), 197-222   DOI   ScienceOn
9 Naghibzadeh, M. A modified version of ratemonotonic scheduling algorithm and its' efficiency assessment[A], Proceedings of the Seventh IEEE International Workshop on Object-Oriented Real- Time Dependable Systems[C], 2002, 289-294   DOI
10 Baruah S K, Haritsa J R. Scheduling for Overload in Realtime Systems[J], IEEE Transactions on Computers, 1997, 46(9): 1014-1018   DOI   ScienceOn
11 Silva de Oliveira, da Silva Fraga, J. Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems[J], Journal of Systems Architecture, 46(11), Sept. 2000, 991-1004   DOI   ScienceOn
12 Philip Levis, Nelson Lee, Matt Welsh, et al. TOSSIM: Accurate and Scalable Simulation of Entire TinyOS Applications[A], Proceedings of the first international conference on embedded networked sensor systems [C], 2003, 126-137   DOI
13 S. Bhatti, J. Carlson, H.Dai, et al. MANTIS OS: an embedded multithreaded operating system for wireless micro sensor platforms[J], Mobile Networks and Applications, 2005, 10(4): 563-579   DOI
14 Farshchi S, Nuyujukian P, Pesterev A, et al. A tinyOS-based wireless neural sensing, archiving, and hosting system[A], Proceedings of 2nd international IEEE/ EMBS conference on neural engineering [C], 2005, 671-674   DOI
15 Lopez J, Garcia M, Diaz J, et al. Utilization bounds for multiprocessor rate-monotonic scheduling[J] , Real-Time Systems, 2003, 24(1): 5-28   DOI