Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Performance of in-network processing for visual analysis in wireless sensor networks
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.ORCID-id: 0000-0002-0150-2489
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.ORCID-id: 0000-0002-4876-0223
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.ORCID-id: 0000-0002-2764-8099
2015 (Engelska)Ingår i: Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015, IEEE conference proceedings, 2015Konferensbidrag, Publicerat paper (Refereegranskat)
Resurstyp
Text
Abstract [en]

Nodes in a sensor network are traditionally used for sensing and data forwarding. However, with the increase of their computational capability, they can be used for in-network data processing, leading to a potential increase of the quality of the networked applications as well as the network lifetime. Visual analysis in sensor networks is a prominent example where the processing power of the network nodes needs to be leveraged to meet the frame rate and the processing delay requirements of common visual analysis applications. The modeling of the end-to-end performance for such networks is, however, challenging, because in-network processing violates the flow conservation law, which is the basis for most queuing analysis. In this work we propose to solve this methodological challenge through appropriately scaling the arrival and the service processes, and we develop probabilistic performance bounds using stochastic network calculus. We use the developed model to determine the main performance bottlenecks of networked visual processing. Our numerical results show that an end-to-end delay of 2-3 frame length is obtained with violation probability in the order of 10-6. Simulation shows that the obtained bounds overestimates the end-to-end delay by no more than 10%.

Ort, förlag, år, upplaga, sidor
IEEE conference proceedings, 2015.
Nyckelord [en]
Calculations, Data handling, Mobile telecommunication systems, Sensor nodes, Stochastic systems, Computational capability, End-to-end performance, In-network data processing, Networked applications, Performance bottlenecks, Probabilistic performance, Stochastic network calculus, Violation probability, Wireless sensor networks
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:kth:diva-181562DOI: 10.1109/IFIPNetworking.2015.7145292Scopus ID: 2-s2.0-84942683891ISBN: 9783901882685 (tryckt)OAI: oai:DiVA.org:kth-181562DiVA, id: diva2:899862
Konferens
2015 14th IFIP Networking Conference, IFIP Networking 2015, 20 May 2015 through 22 May 2015
Anmärkning

QC 20160202

Tillgänglig från: 2016-02-02 Skapad: 2016-02-02 Senast uppdaterad: 2016-02-02Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Al-Zubaidy, Hussein MohammedDán, GyörgyFodor, Viktoria

Sök vidare i DiVA

Av författaren/redaktören
Al-Zubaidy, Hussein MohammedDán, GyörgyFodor, Viktoria
Av organisationen
KommunikationsteoriKommunikationsnät
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 585 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf