About: A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Cluster scheduling is a crucial issue in clustertree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the shortest path problem. The objective is to meet all the flows’ deadlines defined by the maximum number of crossed periods for each flow to reach its destination assuming one collision domain. Formulating the problem as the shortest path problem gives us a light exact algorithm suitable to the scarce properties of WSNs especially related to memory, power consumption and processors. Our polynomial algorithm leads to the minimization of the energy consumption and, consequently, the lifetime of the network is maximized by setting the TDCS period as long as possible. Since each cluster is active only once during the period, the given flow may span over several periods when there are flows with an opposite direction. The scheduling tool enables the system designers to efficiently configure all the required parameters of the IEEE 802.15.4/ZigBee beacon-enabled cluster-tree WSNs in the network configuration time. Cluster scheduling is a crucial issue in clustertree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the shortest path problem. The objective is to meet all the flows’ deadlines defined by the maximum number of crossed periods for each flow to reach its destination assuming one collision domain. Formulating the problem as the shortest path problem gives us a light exact algorithm suitable to the scarce properties of WSNs especially related to memory, power consumption and processors. Our polynomial algorithm leads to the minimization of the energy consumption and, consequently, the lifetime of the network is maximized by setting the TDCS period as long as possible. Since each cluster is active only once during the period, the given flow may span over several periods when there are flows with an opposite direction. The scheduling tool enables the system designers to efficiently configure all the required parameters of the IEEE 802.15.4/ZigBee beacon-enabled cluster-tree WSNs in the network configuration time. (en)
Title	A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint (en)
skos:prefLabel	A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint (en)
skos:notation	RIV/68407700:21230/14:00221734!RIV15-GA0-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP103/12/1994)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Hanzálek, Zdeněk Ahmad, Aasem
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	1045
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00221734
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	cluster-tree; TDCS; IEEE 802.15.4; ZigBee; cyclic scheduling; energy efficiency; shortest path (en)
http://linked.open.../riv/klicoveSlovo	shortest path energy efficiency ZigBee IEEE 802.15.4 TDCS cluster-tree cyclic scheduling
http://linked.open...ontrolniKodProRIV	[AF48C2D764BE]
http://linked.open...v/mistoKonaniAkce	Barcelona
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	Proceedings of the 19th IEEE International Conference on Emerging Technologies and Factory Automation
http://linked.open...in/vavai/riv/obor	BC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Hanzálek, Zdeněk Hanen, C. Ahmad, Aasem
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-09-16 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4799-4845-1
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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