On the Handling Node Failure: Energy-Efficient Job Allocation Algorithm for Real-time Sensor Networks

被引:0
作者
Karimi, Hamid [1 ]
Kargahi, Mehdi [1 ]
Yazdani, Nasser [1 ]
机构
[1] Univ Tehran, Coll Engn, Sch Elect & Comp Engn, Tehran 14174, Iran
来源
PROCEEDINGS OF THE 2009 FOURTH INTERNATIONAL CONFERENCE ON EMBEDDED AND MULTIMEDIA COMPUTING | 2009年
关键词
Wireless sensor network; Real-time scheduling; Job allocation; Failure recovery; Quality of service; TASK ALLOCATION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Guaranteeing quality of real-time services in wireless sensor networks (WSN) requires efficient resource management, especially for energy resources. This is due to the fact that nodes in such networks usually use limited non-replaceable batteries. On the other hand, the nodes of WSNs often work in harsh environments, and therefore, susceptible to failure occurrences due to environmental affects or exhaustion of their battery. In this paper, we present a dynamic energy efficient real-time job allocation algorithm called ERTJA for handling node failures in a cluster. ERTJA tries to minimize the energy consumption of the cluster by minimum activation of sleeping nodes while guaranteeing the QoS of the application assigned to the cluster at the same previous level. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of active nodes to have a graceful QoS degradation of the cluster upon node failure. Simulation results show significant performance improvements of ERTJA in terms of energy consumption comparing to the N-EDF-Plus algorithm. According to the results, ERTJA can save up to 26.5% of the cluster's energy consumption with respect to N-EDF-Plus in the studied scenarios.
引用
收藏
页码:56 / 61
页数:6
相关论文
共 25 条
[1]  
ALSALIH W, 2005, P 19 IEEE C PAR DIST
[2]  
[Anonymous], P 24 BRAZ S COMP NET
[3]  
Baruah S., 1991, Proceedings 32nd Annual Symposium on Foundations of Computer Science (Cat. No.91CH3062-7), P100, DOI 10.1109/SFCS.1991.185354
[4]   Dynamic task-based anycasting in mobile ad hoc networks [J].
Basu, P ;
Ke, W ;
Little, TDC .
MOBILE NETWORKS & APPLICATIONS, 2003, 8 (05) :593-612
[5]   Instrumenting the World with wireless sensor networks [J].
Estrin, D ;
Girod, L ;
Pottie, G ;
Srivastava, M .
2001 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-VI, PROCEEDINGS: VOL I: SPEECH PROCESSING 1; VOL II: SPEECH PROCESSING 2 IND TECHNOL TRACK DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS NEURALNETWORKS FOR SIGNAL PROCESSING; VOL III: IMAGE & MULTIDIMENSIONAL SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING - VOL IV: SIGNAL PROCESSING FOR COMMUNICATIONS; VOL V: SIGNAL PROCESSING EDUCATION SENSOR ARRAY & MULTICHANNEL SIGNAL PROCESSING AUDIO & ELECTROACOUSTICS; VOL VI: SIGNAL PROCESSING THEORY & METHODS STUDENT FORUM, 2001, :2033-2036
[6]   Collaborative resource allocation in wireless sensor networks [J].
Giannecchini, S ;
Caccamo, M ;
Shih, CS .
16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, :35-44
[7]   Energy-aware communication and task scheduling for network-on-chip architectures under real-time constraints [J].
Hu, JC ;
Marculescu, R .
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2004, :234-239
[8]   Speed is as powerful as clairvoyance [J].
Kalyanasundaram, B ;
Pruhs, K .
JOURNAL OF THE ACM, 2000, 47 (04) :617-643
[9]   Extra processors versus future information in optimal deadline scheduling [J].
Koo, CY ;
Lam, TW ;
Ngan, TW ;
To, KK .
THEORY OF COMPUTING SYSTEMS, 2004, 37 (03) :323-341
[10]  
Kumar Rajnish., 2003, P 1 INT C EMBEDDED N, P114