Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/3851
Título: Energy efficient scheduling for cluster-tree wireless sensor networks with time-bounded data flows: application to IEEE 802.15.4/ZigBee
Autor: Hanzalek, Zdenek
Jurcik, Petr
Palavras-chave: Cluster-tree
IEEE 802.15.4
Cyclic scheduling
Collision avoidance
Energy efficiency
Data: 2010
Editora: IEEE
Relatório da Série N.º: IEEE Transactions on Industrial Informatics; Vol. 6, Issue 3
Resumo: Cluster scheduling and collision avoidance are crucial issues in large-scale cluster-tree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the cyclic extension of RCPS/TC (Resource Constrained Project Scheduling with Temporal Constraints) 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. Sinceeach 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 beaconenabled cluster-tree WSNs in the network design time. The performance evaluation of thescheduling tool shows that the problems with dozens of nodes can be solved while using optimal solvers.
Peer review: yes
URI: http://hdl.handle.net/10400.22/3851
ISSN: 1551-3203
Versão do Editor: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5475355
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_ZdenekHanzalek_2010_CISTER.pdf711,63 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.