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

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 Wireless Sensor Networks(WSNs),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.
  • 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 Wireless Sensor Networks(WSNs),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. (en)
Title
  • Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee
  • Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee (en)
skos:prefLabel
  • Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee
  • Energy Efficient Scheduling for Cluster-Tree Wireless Sensor Networks With Time-Bounded Data Flows: Application to IEEE 802.15.4/ZigBee (en)
skos:notation
  • RIV/68407700:21230/10:00169642!RIV11-GA0-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP103/10/0850), P(ME10039), Z(MSM6840770038)
http://linked.open...iv/cisloPeriodika
  • 3
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 257185
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/10:00169642
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Cluster-tree; collision avoidance; cyclic scheduling; energy efficiency; IEEE 802.15.4; real-time; time-division; multiple access (TDMA); ZigBee (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [0E0E5B7B61C9]
http://linked.open...i/riv/nazevZdroje
  • Industrial Informatics, IEEE Transactions on
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 6
http://linked.open...iv/tvurceVysledku
  • Hanzálek, Zdeněk
  • Jurčík, Petr
http://linked.open...ain/vavai/riv/wos
  • 000284008200018
http://linked.open...n/vavai/riv/zamer
issn
  • 1551-3203
number of pages
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software