Becker, Benjamin ; Oberli, Christian ; Meuser, Tobias ; Steinmetz, Ralf (2024)
On Maximizing the Probability of Achieving Deadlines in Communication Networks.
In: Journal of Sensor and Actuator Networks, 13 (1)
doi: 10.3390/jsan13010009
Artikel, Bibliographie
Dies ist die neueste Version dieses Eintrags.
Kurzbeschreibung (Abstract)
We consider the problem of meeting deadline constraints in wireless communication networks. Fulfilling deadlines depends heavily on the routing algorithm used. We study this dependence generically for a broad class of routing algorithms. For analyzing the impact of routing decisions on deadline fulfillment, we adopt a stochastic model from operations research to capture the source-to-destination delay distribution and the corresponding probability of successfully delivering data before a given deadline. Based on this model, we propose a decentralized algorithm that operates locally at each node and exchanges information solely with direct neighbors in order to determine the probabilities of achieving deadlines. A modified version of the algorithm also improves routing tables iteratively to progressively increase the deadline achievement probabilities. This modified algorithm is shown to deliver routing tables that maximize the deadline achievement probabilities for all nodes in a given network. We tested the approach by simulation and compared it with routing strategies based on established metrics, specifically the average delay, minimum hop count, and expected transmission count. Our evaluations encompass different channel quality and small-scale fading conditions, as well as various traffic load scenarios. Notably, our solution consistently outperforms the other approaches in all tested scenarios.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2024 |
| Autor(en): | Becker, Benjamin ; Oberli, Christian ; Meuser, Tobias ; Steinmetz, Ralf |
| Art des Eintrags: | Bibliographie |
| Titel: | On Maximizing the Probability of Achieving Deadlines in Communication Networks |
| Sprache: | Englisch |
| Publikationsjahr: | 18 Januar 2024 |
| Verlag: | MDPI |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Journal of Sensor and Actuator Networks |
| Jahrgang/Volume einer Zeitschrift: | 13 |
| (Heft-)Nummer: | 1 |
| DOI: | 10.3390/jsan13010009 |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | We consider the problem of meeting deadline constraints in wireless communication networks. Fulfilling deadlines depends heavily on the routing algorithm used. We study this dependence generically for a broad class of routing algorithms. For analyzing the impact of routing decisions on deadline fulfillment, we adopt a stochastic model from operations research to capture the source-to-destination delay distribution and the corresponding probability of successfully delivering data before a given deadline. Based on this model, we propose a decentralized algorithm that operates locally at each node and exchanges information solely with direct neighbors in order to determine the probabilities of achieving deadlines. A modified version of the algorithm also improves routing tables iteratively to progressively increase the deadline achievement probabilities. This modified algorithm is shown to deliver routing tables that maximize the deadline achievement probabilities for all nodes in a given network. We tested the approach by simulation and compared it with routing strategies based on established metrics, specifically the average delay, minimum hop count, and expected transmission count. Our evaluations encompass different channel quality and small-scale fading conditions, as well as various traffic load scenarios. Notably, our solution consistently outperforms the other approaches in all tested scenarios. |
| ID-Nummer: | Artikel-ID: 9 |
| Zusätzliche Informationen: | This article belongs to the Topic Electronic Communications, IOT and Big Data |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Multimedia Kommunikation |
| Hinterlegungsdatum: | 23 Apr 2024 10:12 |
| Letzte Änderung: | 12 Aug 2024 14:30 |
| PPN: | 520598318 |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
Verfügbare Versionen dieses Eintrags
-
On Maximizing the Probability of Achieving Deadlines in Communication Networks. (deposited 07 Mai 2024 09:40)
- On Maximizing the Probability of Achieving Deadlines in Communication Networks. (deposited 23 Apr 2024 10:12) [Gegenwärtig angezeigt]
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum