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
A mathematical programming approach to deadline-constrained transmission scheduling in wireless HART networks
KTH, School of Electrical Engineering (EES), Automatic Control.
KTH, School of Electrical Engineering (EES), Automatic Control.
2008 (English)Conference paper, Published paper (Refereed)
Abstract [en]

This paper considers transmission scheduling of deadline-constrained data in a wirelessHART network. We develop a thematical programming formulation and discuss efficient scheduling heuristics. We use the framework to schedule transmissions in a non-trivial network, and show how our results can be used to study design trade-offs such the use of multiple channels and multiple access points.

Place, publisher, year, edition, pages
2008.
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-79742OAI: oai:DiVA.org:kth-79742DiVA: diva2:499911
Conference
Swedish National Control Conference. LuleƄ, Sweden. June 3-5 2008
Note
QC 20120514Available from: 2012-02-13 Created: 2012-02-09 Last updated: 2012-05-14Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Soldati, PabloJohansson, Mikael
By organisation
Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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