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

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/ISSNConference contribution/Paperpeer-review

Publication date1/04/2005
Host publicationProceedings of the 1st workshop on Resource Allocation in Wireless NETworks (RAWNET2005), Trento, Italy
PublisherIEEE Computer Society Press
<mark>Original language</mark>English


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.