Name
Abstract | ||
|---|---|---|
In general, two different types of low-end sensor node platforms are currently considered: event driven and multi-tasking operating systems. It is commonly assumed that event driven operating systems are more suited to WSN (Wireless Sensor Networks) as they use less memory and resources. Hence one of event driven operating systems, TinyOS incorporating a non-preemptive scheduling policy, is quickly deployed for WSN today. While the TinyOS can keep the memory overhead down, it has been shown that scheduling periodic and aperiodic non-preemptive tasks on the TinyOS is NP-hard. In this paper, we present a technique that makes it possible to guarantee the real-time scheduling of periodic tasks and minimize the average response time of aperiodic tasks for low-end sensor node platforms. This paper considers the following two perspectives. First, sensor node platforms available in the literature have not addressed the concept of scheduling for hybrid task sets where both types of periodic and aperiodic tasks exist. Second, each system service in sensor node platforms is decomposed to either a periodic or an aperiodic task in order to provide fully optimal real-time scheduling for given real-time requirements of WSN applications. A case study shows that the proposed technique yields efficient performance in terms of guaranteeing the completion of all the periodic tasks within their deadlines and aiming to provide aperiodic tasks with good average response time. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1774088.1774242 | SAC |
Keywords | Field | DocType |
real-time scheduling,sensor node platform,aperiodic task,non-preemptive scheduling policy,aperiodic non-preemptive task,real-time hybrid task scheduling,optimal real-time scheduling,periodic task,wsn application,low-end sensor node platform,multi-tasking operating system,preemptive scheduling,wireless sensor network,real time,operating system,scheduling | Sensor node,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tae-Hoon Kim | 1 | 459 | 53.02 |
| Bora Kang | 2 | 0 | 0.68 |
| Eun Kyo Park | 3 | 144 | 19.56 |
| Sung Woo Tak | 4 | 23 | 14.34 |