Deterministic Worst-case Performance Analysis for Wireless Sensor Networks
2008 (English)In: Proceedings of the International Wireless Communications and Mobile Computing Conference, 2008, 1081-1086 p.Conference paper (Refereed)
Dimensioning wireless sensor networks requires formal methods to guarantee network performance and cost in any conditions. Based on network calculus, this paper presents a deterministic analysis method for evaluating the worst-case performance and buffer cost of sensor networks. To this end, we introduce three general traffic flow operators and derive their delay and buffer bounds. These operators are general because they can be used in combination to model any complex traffic flowing scenarios in sensor networks. Furthermore, our method integrates variable duty cycle to allow the sensor nodes to operate at lower rates thus saving power. Moreover, it incorporates traffic splitting mechanisms in order to balance network workload and nodes' buffers. To show how our method applies to real applications, we conduct a case study on a fresh food tracking application, which monitors the food freshness in realtime. The experimental results demonstrate that our method can be either used to perform network planning before deployment, or to conduct network reconfiguration after deployment.
Place, publisher, year, edition, pages
2008. 1081-1086 p.
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-62076DOI: 10.1109/IWCMC.2008.18ScopusID: 2-s2.0-52949154366ISBN: 978-142442202-9OAI: oai:DiVA.org:kth-62076DiVA: diva2:481115
International Wireless Communications and Mobile Computing Conference, IWCMC 2008. Crete. 6 August 2008 - 8 August 2008
QC 201201232012-01-202012-01-182012-01-23Bibliographically approved