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

• Author(s): Jurcik, Petr ; Severino, Ricardo ; Koubâa, Anis ; Alves, Mário ; Tovar, Eduardo
• Date: 2010
• Persistent ID: http://hdl.handle.net/10400.22/3845
• Origin: Repositório Científico do Instituto Politécnico do Porto
• Document Type: Article
• Language: English

Description

Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions and to make the appropriate design choices. This is particular relevant for time-sensitive WSN applications, where the timing behavior of the network protocols (message transmission must respect deadlines) impacts on the correct operation of these applications. In that direction this paper 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 propose closed-form recurrent expressions for computing the worst-case end-to-end delays, buffering and bandwidth requirements across any source-destination path in a cluster-tree WSN. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study using commercially available technology, namely TelosB motes running TinyOS.