Home > Research > Publications & Outputs > Worst case dimensioning of wireless sensor netw...

Research

Associated organisational units

Electronic data

View graph of relations

Worst case dimensioning of wireless sensor networks under uncertain topologies

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Worst case dimensioning of wireless sensor networks under uncertain topologies. / Schmitt, Jens; Roedig, Utz.
Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy. IEEE Computer Society Press, 2005.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Schmitt, J & Roedig, U 2005, Worst case dimensioning of wireless sensor networks under uncertain topologies. in Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy. IEEE Computer Society Press.

APA

Schmitt, J., & Roedig, U. (2005). Worst case dimensioning of wireless sensor networks under uncertain topologies. In Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy IEEE Computer Society Press.

Vancouver

Schmitt J, Roedig U. Worst case dimensioning of wireless sensor networks under uncertain topologies. In Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy. IEEE Computer Society Press. 2005

Author

Schmitt, Jens ; Roedig, Utz. / Worst case dimensioning of wireless sensor networks under uncertain topologies. Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy. IEEE Computer Society Press, 2005.

Bibtex

@inproceedings{bc78be4da6ae41bfb8881c2e8109d7c6,
title = "Worst case dimensioning of wireless sensor networks under uncertain topologies",
abstract = "Many applications in wireless sensor networks require an absolute predictable network behaviour under all possible traffic and routing conditions. This requires network dimensioning with respect to crucial parameters such as energy usage, message delay and buffer requirements. Network calculus provides a method set that can be used to prove that all possible traffic conditions under a given routing-implied topology can be supported. As it is often impossible to fix the routing topology before or even during the operation of a sensor network, an uncertainty arises with which network calculus cannot deal directly. In this paper, we make two contributions: 1) We demonstrate how to apply network calculus in a fixed sensor network topology. 2) We show how to incorporate topology uncertainty into these calculations.",
author = "Jens Schmitt and Utz Roedig",
year = "2005",
month = apr,
day = "1",
language = "English",
booktitle = "Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy",
publisher = "IEEE Computer Society Press",

}

RIS

TY - GEN

T1 - Worst case dimensioning of wireless sensor networks under uncertain topologies

AU - Schmitt, Jens

AU - Roedig, Utz

PY - 2005/4/1

Y1 - 2005/4/1

N2 - Many applications in wireless sensor networks require an absolute predictable network behaviour under all possible traffic and routing conditions. This requires network dimensioning with respect to crucial parameters such as energy usage, message delay and buffer requirements. Network calculus provides a method set that can be used to prove that all possible traffic conditions under a given routing-implied topology can be supported. As it is often impossible to fix the routing topology before or even during the operation of a sensor network, an uncertainty arises with which network calculus cannot deal directly. In this paper, we make two contributions: 1) We demonstrate how to apply network calculus in a fixed sensor network topology. 2) We show how to incorporate topology uncertainty into these calculations.

AB - Many applications in wireless sensor networks require an absolute predictable network behaviour under all possible traffic and routing conditions. This requires network dimensioning with respect to crucial parameters such as energy usage, message delay and buffer requirements. Network calculus provides a method set that can be used to prove that all possible traffic conditions under a given routing-implied topology can be supported. As it is often impossible to fix the routing topology before or even during the operation of a sensor network, an uncertainty arises with which network calculus cannot deal directly. In this paper, we make two contributions: 1) We demonstrate how to apply network calculus in a fixed sensor network topology. 2) We show how to incorporate topology uncertainty into these calculations.

M3 - Conference contribution/Paper

BT - Proceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy

PB - IEEE Computer Society Press

ER -