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

被引:3
作者
Karimi, Hamid [1 ]
Kargahi, Mehdi [1 ,2 ]
Yazdani, Nasser [1 ]
机构
[1] Univ Tehran, Coll Engn, Sch Elect & Comp Engn, Tehran, Iran
[2] Inst Res Fundamental Sci, Sch Comp Sci, Tehran, Iran
来源
JOURNAL OF INFORMATION PROCESSING SYSTEMS | 2010年 / 6卷 / 03期
关键词
Failure Recovery; Job Allocation; Quality of Service; Real-Time Scheduling; Wireless Sensor Network;
D O I
10.3745/JIPS.2010.6.3.413
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks ( WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.
引用
收藏
页码:413 / 434
页数:22
相关论文
共 26 条
[1]  
Alghamdi M., 2005, P 1 ACM WORKSH WIR M, P86
[2]  
Alsalih W., 2005, P 19 IEEE INT C PAR, P51
[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 R, 2003, P 1 INT C EMB NETW S, P114