About: Dimensioning and worst-case analysis of cluster-tree sensor networks

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

About: Dimensioning and worst-case analysis of cluster-tree sensor networks 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	Modeling the performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions. In that direction this article contributes with a methodology based on Network Calculus, which enables quick and efficient worst-case dimensioning of static or even dynamically changing cluster-tree WSNs where the data sink can either be static or mobile. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity of our methodology through an experimental study using commercially available technology, namely TelosB motes running TinyOS. Modeling the performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions. In that direction this article contributes with a methodology based on Network Calculus, which enables quick and efficient worst-case dimensioning of static or even dynamically changing cluster-tree WSNs where the data sink can either be static or mobile. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity of our methodology through an experimental study using commercially available technology, namely TelosB motes running TinyOS. (en)
Title	Dimensioning and worst-case analysis of cluster-tree sensor networks Dimensioning and worst-case analysis of cluster-tree sensor networks (en)
skos:prefLabel	Dimensioning and worst-case analysis of cluster-tree sensor networks Dimensioning and worst-case analysis of cluster-tree sensor networks (en)
skos:notation	RIV/68407700:21230/10:00169639!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita	P R
http://linked.open...avai/riv/aktivity	P(ME10039), R
http://linked.open...iv/cisloPeriodika	2
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Jurčík, Petr
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	254496
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00169639
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Cluster-tree; IEEE 802.15.4; network calculus; network dimensioning; sensor networks; worst-case analysis; ZigBee (en)
http://linked.open.../riv/klicoveSlovo	ZigBee worst-case analysis IEEE 802.15.4 sensor networks Cluster-tree network calculus network dimensioning
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[30788F584011]
http://linked.open...i/riv/nazevZdroje	ACM Transactions on Sensor Networks (TOSN)
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Energy Efficient Scheduling in Data Processing and Communication
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	7
http://linked.open...iv/tvurceVysledku	Jurčík, Petr Alves, M. Koubaa, A. Severino, R. Tovar, E.
http://linked.open...ain/vavai/riv/wos	000285695700004
issn	1550-4859
number of pages	47 (xsd:int)
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Dimensioning and worst-case analysis of cluster-tree sensor networks Dimensioning and worst-case analysis of cluster-tree sensor networks Dimensioning and worst-case analysis of cluster-tree sensor networks

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, 118 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software