Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Deadline-Aware Scheduling of Cooperative Relayers in TDMA-Based Wireless Industrial Networks
Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand.
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).ORCID iD: 0000-0001-6497-4099
2014 (English)In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 20, no 1, p. 73-88Article in journal (Refereed) Published
Abstract [en]

In this paper we consider a scenario in which a set of source nodes wishes to transmit real-time data packets periodically to a central controller over lossy wireless links, while using a TDMA-based medium access control protocol. Furthermore, a number of relay nodes are present which can help the source nodes with packet retransmissions. The key question we consider in this paper is how to schedule the TDMA slots for retransmissions while taking advantage of the relay nodes, so that the average number of packets missing their deadlines is minimized. We provide a problem formulation for the general deadline-aware TDMA relay scheduling problem. Since the design space of the general problem is large, we also present one particular class of restricted TDMA relay scheduling problems. We suggest and numerically investigate a range of algorithms and heuristics, both optimal and suboptimal, of the restricted scheduling problem, which represent different trade-offs between achievable performance and computational complexity. Specifically, we introduce two different Markov Decision Process (MDP) based formulations for schedule computation of the restricted TDMA relay scheduling problem. One MDP formulation gives an optimal schedule, another (approximate) formulation gives a sub-optimal schedule which, however, comes very close to the optimal performance at much more modest computational and memory costs. © 2013 Springer Science+Business Media New York.

Place, publisher, year, edition, pages
New York: Springer-Verlag New York, 2014. Vol. 20, no 1, p. 73-88
Keywords [en]
TDMA packet scheduling, Relaying, Markov decision processes
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:hh:diva-23293DOI: 10.1007/s11276-013-0593-xISI: 000329321200006Scopus ID: 2-s2.0-84891850919OAI: oai:DiVA.org:hh-23293DiVA, id: diva2:638314
Funder
VINNOVA, Vinnmer R2D2Available from: 2013-07-29 Created: 2013-07-29 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Uhlemann, Elisabeth
By organisation
Embedded Systems (CERES)
In the same journal
Wireless networks
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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