DocumentCode :
128413
Title :
A partitioning scheme to guarantee minimum execution time for multiple applications in sensor network nodes
Author :
Daehoon Kim ; BeomSeok Kim ; Jinsung Cho
Author_Institution :
Dept. of Comput. Eng., Kyung Hee Univ., Yongin, South Korea
fYear :
2014
fDate :
10-12 Feb. 2014
Firstpage :
126
Lastpage :
130
Abstract :
Due to rapid development of embedded system technologies, miniaturization of low-power sensor nodes becomes possible. Based on these improvements of sensor nodes, several sensor applications can run on a single sensor hardware and all of the applications in sensor network should be guaranteed the real-time requirements and independence. To satisfy these requirements, the virtualization concept was proposed. However, the virtualization cannot be applied to sensor nodes because it requires powerful computing resources. To solve this problem, the partitioning scheme which is categorized into temporal partitioning and spatial partitioning has been proposed. In this paper, we design and implement temporal partitioning scheme for sensor nodes and validate that our implementation guarantees minimum execution time of each partition.
Keywords :
computerised instrumentation; embedded systems; sensors; virtual machines; virtualisation; embedded system technologies; low-power sensor network nodes; spatial partitioning; temporal partitioning scheme; virtualization concept; Aerospace electronics; Educational institutions; Embedded systems; Hardware; Instruction sets; Real-time systems; Virtualization; Partitioning; Scheduling; Sensor network; Threads; Virtualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Networking (ICOIN), 2014 International Conference on
Conference_Location :
Phuket
Type :
conf
DOI :
10.1109/ICOIN.2014.6799678
Filename :
6799678
Link To Document :
بازگشت