A mathematical programming approach to deadline-constrained transmission scheduling in wireless HART networks
2008 (English)Conference paper (Refereed)
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
IdentifiersURN: urn:nbn:se:kth:diva-79742OAI: oai:DiVA.org:kth-79742DiVA: diva2:499911
Swedish National Control Conference. Luleå, Sweden. June 3-5 2008
QC 201205142012-02-132012-02-092012-05-14Bibliographically approved