Home > Research > Publications & Outputs > Sensor Network Calculus - A Framework for Worst...
View graph of relations

Sensor Network Calculus - A Framework for Worst Case Analysis.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Sensor Network Calculus - A Framework for Worst Case Analysis. / Roedig, Utz; Schmitt, Jens.
Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 – July 1, 2005. Proceedings. ed. / Viktor K. Prasanna; Sitharama S. Iyengar; Paul G. Spirakis; Matt Welsh. Berlin: Springer Verlag, 2005. p. 141-154 (Lecture Notes in Computer Science; Vol. 3560).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Roedig, U & Schmitt, J 2005, Sensor Network Calculus - A Framework for Worst Case Analysis. in VK Prasanna, SS Iyengar, PG Spirakis & M Welsh (eds), Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 – July 1, 2005. Proceedings. Lecture Notes in Computer Science, vol. 3560, Springer Verlag, Berlin, pp. 141-154, International Conference on Distributed Computing in Sensor Systems (DCOSS 2005), 1/01/00. https://doi.org/10.1007/11502593_13

APA

Roedig, U., & Schmitt, J. (2005). Sensor Network Calculus - A Framework for Worst Case Analysis. In V. K. Prasanna, S. S. Iyengar, P. G. Spirakis, & M. Welsh (Eds.), Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 – July 1, 2005. Proceedings (pp. 141-154). (Lecture Notes in Computer Science; Vol. 3560). Springer Verlag. https://doi.org/10.1007/11502593_13

Vancouver

Roedig U, Schmitt J. Sensor Network Calculus - A Framework for Worst Case Analysis. In Prasanna VK, Iyengar SS, Spirakis PG, Welsh M, editors, Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 – July 1, 2005. Proceedings. Berlin: Springer Verlag. 2005. p. 141-154. (Lecture Notes in Computer Science). doi: 10.1007/11502593_13

Author

Roedig, Utz ; Schmitt, Jens. / Sensor Network Calculus - A Framework for Worst Case Analysis. Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 – July 1, 2005. Proceedings. editor / Viktor K. Prasanna ; Sitharama S. Iyengar ; Paul G. Spirakis ; Matt Welsh. Berlin : Springer Verlag, 2005. pp. 141-154 (Lecture Notes in Computer Science).

Bibtex

@inproceedings{2949379ac3884744b589a96ec364ede3,
title = "Sensor Network Calculus - A Framework for Worst Case Analysis.",
abstract = "To our knowledge, at the time of writing no methodology exists to dimension a sensor network so that a worst case traffic scenario can be definitely supported. In this paper, the well known network calculus is tailored so that it can be used as a tool for worst case traffic analysis in sensor networks. To illustrate the usage of the resulting sensor network calculus, typical example scenarios are analyzed by this new methodology. Sensor network calculus provides the ability to derive deterministic statements about supportable operation modes of sensor networks and the design of sensor nodes.",
author = "Utz Roedig and Jens Schmitt",
note = "DCOSS is a well known conference on sensor networks which shares PC membership with the leading ACM SenSys and EWSN conferences. The paper describes a methodology that can be used to dimension a sensor network so that worst case traffic scenarios can be definitely supported. The well known network calculus is tailored for use as a tool for worst case traffic analysis in sensor networks. This is the first work that provides a dimensioning tool for sensor networks, and significant for deployment of sensor networks in critical application environments (e.g. traffic control, medical applications or production control) where it must be guaranteed that the required traffic patterns can be supported.; International Conference on Distributed Computing in Sensor Systems (DCOSS 2005) ; Conference date: 01-01-1900",
year = "2005",
month = jun,
day = "30",
doi = "10.1007/11502593_13",
language = "English",
isbn = "978-3-540-26422-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "141--154",
editor = "Prasanna, {Viktor K.} and Iyengar, {Sitharama S.} and Spirakis, {Paul G.} and Matt Welsh",
booktitle = "Distributed Computing in Sensor Systems",

}

RIS

TY - GEN

T1 - Sensor Network Calculus - A Framework for Worst Case Analysis.

AU - Roedig, Utz

AU - Schmitt, Jens

N1 - DCOSS is a well known conference on sensor networks which shares PC membership with the leading ACM SenSys and EWSN conferences. The paper describes a methodology that can be used to dimension a sensor network so that worst case traffic scenarios can be definitely supported. The well known network calculus is tailored for use as a tool for worst case traffic analysis in sensor networks. This is the first work that provides a dimensioning tool for sensor networks, and significant for deployment of sensor networks in critical application environments (e.g. traffic control, medical applications or production control) where it must be guaranteed that the required traffic patterns can be supported.

PY - 2005/6/30

Y1 - 2005/6/30

N2 - To our knowledge, at the time of writing no methodology exists to dimension a sensor network so that a worst case traffic scenario can be definitely supported. In this paper, the well known network calculus is tailored so that it can be used as a tool for worst case traffic analysis in sensor networks. To illustrate the usage of the resulting sensor network calculus, typical example scenarios are analyzed by this new methodology. Sensor network calculus provides the ability to derive deterministic statements about supportable operation modes of sensor networks and the design of sensor nodes.

AB - To our knowledge, at the time of writing no methodology exists to dimension a sensor network so that a worst case traffic scenario can be definitely supported. In this paper, the well known network calculus is tailored so that it can be used as a tool for worst case traffic analysis in sensor networks. To illustrate the usage of the resulting sensor network calculus, typical example scenarios are analyzed by this new methodology. Sensor network calculus provides the ability to derive deterministic statements about supportable operation modes of sensor networks and the design of sensor nodes.

U2 - 10.1007/11502593_13

DO - 10.1007/11502593_13

M3 - Conference contribution/Paper

SN - 978-3-540-26422-4

T3 - Lecture Notes in Computer Science

SP - 141

EP - 154

BT - Distributed Computing in Sensor Systems

A2 - Prasanna, Viktor K.

A2 - Iyengar, Sitharama S.

A2 - Spirakis, Paul G.

A2 - Welsh, Matt

PB - Springer Verlag

CY - Berlin

T2 - International Conference on Distributed Computing in Sensor Systems (DCOSS 2005)

Y2 - 1 January 1900

ER -