Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Deterministic Worst-case Performance Analysis for Wireless Sensor Networks
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.ORCID iD: 0000-0003-0061-3475
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
Show others and affiliations
2008 (English)In: Proceedings of the International Wireless Communications and Mobile Computing Conference, 2008, 1081-1086 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-62076DOI: 10.1109/IWCMC.2008.18Scopus ID: 2-s2.0-52949154366ISBN: 978-142442202-9 (print)OAI: oai:DiVA.org:kth-62076DiVA: diva2:481115
Conference
International Wireless Communications and Mobile Computing Conference, IWCMC 2008. Crete. 6 August 2008 - 8 August 2008
Note
QC 20120123Available from: 2012-01-20 Created: 2012-01-18 Last updated: 2012-01-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://web.it.kth.se/~axel/papers/2008/IWCMC-HuiminShe.pdf

Authority records BETA

Lu, Zhonghai

Search in DiVA

By author/editor
She, HuiminLu, ZhonghaiJantsch, AxelZheng, Lirong
By organisation
Electronic, Computer and Software Systems, ECS
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 38 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf