Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee

被引:86
作者
Hanzalek, Zdenek [1 ]
Jurcik, Petr [1 ,2 ]
机构
[1] Czech Tech Univ, Fac Elect Engn, Dept Control Engn, CR-16635 Prague 6, Czech Republic
[2] Polytech Inst Porto, CISTER ISEP, P-4200072 Oporto, Portugal
关键词
Cluster-tree; collision avoidance; cyclic scheduling; energy efficiency; IEEE; 802.15.4; real-time; time-division multiple access (TDMA); ZigBee; PROTOCOL;
D O I
10.1109/TII.2010.2050144
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cluster scheduling and collision avoidance are crucial issues in large-scale cluster-tree Wireless Sensor Networks (WSNs). This paper presents a methodology that provides a Time-Division Cluster Scheduling (TDCS) mechanism based on the cyclic extension of Resource Constrained Project Scheduling with Temporal Constraints (RCPS/TC) problem for a cluster-tree WSN, assuming bounded communication errors. The objective is to meet all end-to-end deadlines of a predefined set of time-bounded data flows while minimizing the energy consumption of the nodes by setting the TDCS period as long as possible. Since each cluster is active only once during the period, the end-to-end delay of a given flow may span over several periods when there are the flows with opposite direction. The scheduling tool enables system designers to efficiently configure all required parameters of the IEEE 802.15.4/ZigBee beacon-enabled cluster-tree WSNs in the network design time. The performance evaluation of the scheduling tool shows that the problems with dozens of nodes can be solved while using optimal solvers.
引用
收藏
页码:438 / 450
页数:13
相关论文
共 32 条
[1]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[2]  
Bai Haowei, 2003, IEEE Communications Surveys & Tutorials, V5, P2, DOI 10.1109/COMST.2003.5341334
[3]   Resource-constrained project scheduling: Notation, classification, models, and methods [J].
Brucker, P ;
Drexl, A ;
Mohring, R ;
Neumann, K ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :3-41
[4]   Real-time power-aware routing in sensor networks [J].
Chipara, Octav ;
He, Zhimin ;
Xing, Guoliang ;
Chen, Qin ;
Wang, Xiaorui ;
Lu, Chenyang ;
Stankovic, John ;
Abdelzaher, Tarek .
2006 14TH IEEE INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, PROCEEDINGS, 2006, :83-+
[5]   Wireless Line Sensor Network for Distributed Visual Surveillance [J].
Chitnis, Mangesh ;
Liang, Yao ;
Zheng, Jiang Yu ;
Pagano, Paolo ;
Lipari, Giuseppe .
PE-WASUN09: PROCEEDINGS OF THE SIXTH ACM INTERNATIONAL SYMPOSIUM ON PERFORMANCE EVALUATION OF WIRELESS AD-HOC, SENSOR, AND UBIQUITOUS NETWORKS, 2009, :71-78
[6]  
*CROSSB TECHN INC, 2009, TELOSB MOT DAT
[7]  
De Morais Cordeiro C., 2006, AD HOC SENSOR NETWOR
[8]  
DEDINECHIN BD, 1994, P INT C PAR ARCH COM, P327
[9]  
Diestel R., 2005, GRAPH THEORY, VThird
[10]   A STUDY OF THE CYCLIC SCHEDULING PROBLEM ON PARALLEL PROCESSORS [J].
HANEN, C ;
MUNIER, A .
DISCRETE APPLIED MATHEMATICS, 1995, 57 (2-3) :167-192