Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

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)
  • Published : 2009.09.30
Download PDF
⟨ Previous Next ⟩

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

References

  1. MantisOS [EB/OL]. http://mantis.cs.colorado.edu. 2007 -6-1
  2. 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 https://doi.org/10.1007/s11036-005-1567-8
  3. SOS[EB/OL]. http://nesl.ee.ucla.edu/projects/sos/. 2007 -6-1
  4. 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 https://doi.org/10.1145/1067170.1067188
  5. 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 https://doi.org/10.1109/LCN.2004.38
  6. TinyOS[EB/OL], http:// www.tinyos.net, 2007-6-1
  7. 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 https://doi.org/10.1109/CNE.2005.1419714
  8. Hill J, Szewczyk R, Woo A, et al. System architecture directions for networked sensors[J], Operating Systems Review, 2000, 34(5): 93-104 https://doi.org/10.1145/356989.356998
  9. 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
  10. Kargahi Mehdi, Movaghar Ali. A method for performance analysis of earliest-deadline-first scheduling policy[J], Journal of Supercomputing, 2006, 37(2), 197-222 https://doi.org/10.1109/DSN.2004.1311953
  11. 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 https://doi.org/10.1109/WORDS.2002.1000064
  12. Lopez J, Garcia M, Diaz J, et al. Utilization bounds for multiprocessor rate-monotonic scheduling[J] , Real-Time Systems, 2003, 24(1): 5-28 https://doi.org/10.1023/A:1021749005009
  13. Baruah S K, Haritsa J R. Scheduling for Overload in Realtime Systems[J], IEEE Transactions on Computers, 1997, 46(9): 1014-1018 https://doi.org/10.1109/12.620484
  14. 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 https://doi.org/10.1016/S1383-7621(00)00004-7
  15. 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 https://doi.org/10.1145/958491.958506

Cited by

  1. Design and Implementation of Preemptive EDF Scheduling Algorithm in TinyOS vol.18A, pp.6, 2011, https://doi.org/10.3745/KIPSTA.2011.18A.6.255