Digitala Vetenskapliga Arkivet

Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Deadline-constrained transmission scheduling and data evacuation in wireless HART networks
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.ORCID-id: 0000-0002-2237-2580
2009 (engelsk)Inngår i: Proceedings of ECC, 2009, s. 4320-4325Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Real-time data delivery is a critical issue in wirelessHART networks. This paper develops a novel mathematical programming framework for joint routing and link scheduling of deadline-constrained traffic in wirelessHART networks. The general framework explores dynamic network flows on a time-expanded graph model and can provide flexible solutions for a variety of real-time data delivery problems. Data evacuation, an important communication paradigm in wirelessHART networks, is a special case of this general framework. We establish the lower bound on evacuation time for line, multi-line and binary tree networks. Moreover, we design a novel scheduling algorithm for data evacuation in binary tree networks, and prove that this scheduling algorithm can always achieve the lower bound on evacuation time. We evaluate our scheduling algorithm through numerical simulations, and results show that our algorithm can always minimize the evacuation time with the least number of channels.

sted, utgiver, år, opplag, sider
2009. s. 4320-4325
Emneord [en]
Algorithms, Binary trees, Flow graphs, Mathematical programming, Scheduling algorithms, Trees (mathematics), Communication paradigm, Critical issues, Dynamic network flow, Evacuation time, Link scheduling, Novel scheduling algorithms, Real-time data, Transmission scheduling, Scheduling
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-79722DOI: 10.23919/ecc.2009.7075079Scopus ID: 2-s2.0-84955180748ISBN: 9783952417393 (tryckt)OAI: oai:DiVA.org:kth-79722DiVA, id: diva2:499858
Konferanse
European Control Conference, ECC'09. Budapest, Hungary. 23-26 August 2009
Merknad

QC 20120502

Tilgjengelig fra: 2012-02-13 Laget: 2012-02-09 Sist oppdatert: 2022-09-06bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopushttps://eeweb01.ee.kth.se/upload/publications/reports/2008/TRITA-EE_2008_060.pdf

Søk i DiVA

Av forfatter/redaktør
Soldati, PabloZhang, HaiboJohansson, Mikael
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 84 treff
RefereraExporteraLink to record
Permanent link

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