Study on Preemptive Real-Time Scheduling Strategy for Wireless Sensor Networks
1
조회
0
다운로드
2
인용
0
참고문헌
초록
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.
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.
참고문헌 (15)
- (2007)[URL]
- "Mobile Networks and Applications", 2005, 563~579
- (2007)[URL]
- "2005"
- "2004"
- (2007)[URL]
- "2005"
- "Operating Systems Review", 2000, 93~104
- "Venkita Subramonian", WUCSE, ~ (2002)
- "Journal of Supercomputing", 2006, 197~222
- "2002"
- "Real-Time Systems", 2003, 5~28
- "IEEE Transactions on Computers", 1997, 1014~1018
- "Journal of Systems Architecture", 2000, 991~1004
- "2003"
