Kluge, Roland ; Stein, Michael ; Varró, Gergely ; Schürr, Andy ; Hollick, Matthias ; Mühlhäuser, Max
Hrsg.: Tichy, Matthias ; Bodden, Eric ; Kuhrmann, Marco ; Wagner, Stefan ; Steghöfer, Jan-Philipp (2018)
A systematic approach to constructing families of incremental topology control algorithms using graph transformation.
24. Tagung Software Engineering (SE) des Fachbereichs Softwaretechnik der Gesellschaft für Informatik. Ulm, Germany (05.03.2018-09.03.2018)
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
In this talk, we present results on integrating support for variability modeling into a correct-by-construction development methodology for topology control algorithms, as appeared online in the Software & Systems Modeling journal in 2017. A topology control algorithm reduces the size of the visible neighborhood of a node in a wireless communication network. At the same time, it must fulfill important consistency properties to ensure a high quality of service. In previous work, we proposed a constructive, model-driven methodology for designing individual topology control algorithms based on declarative graph constraints and graph transformation rules; the resulting algorithms are guaranteed to preserve the specified properties. Even though many topology control algorithms share substantial (structural) parts, few works leverage these commonalities at design time. In this work, we generalize our proposed construction methodology by modeling variability points to support the construction of families of algorithms. We show the applicability of our approach by reengineering six existing topology control algorithms and developing e-kTC, a novel energy-efficient variant of the topology control algorithm kTC. Finally, we evaluate a subset of the algorithms using a novel integration of a wireless network simulator and a graph transformation tool.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2018 |
| Herausgeber: | Tichy, Matthias ; Bodden, Eric ; Kuhrmann, Marco ; Wagner, Stefan ; Steghöfer, Jan-Philipp |
| Autor(en): | Kluge, Roland ; Stein, Michael ; Varró, Gergely ; Schürr, Andy ; Hollick, Matthias ; Mühlhäuser, Max |
| Art des Eintrags: | Bibliographie |
| Titel: | A systematic approach to constructing families of incremental topology control algorithms using graph transformation |
| Sprache: | Englisch |
| Publikationsjahr: | 2018 |
| Verlag: | Gesellschaft für Informatik e.V. |
| Buchtitel: | Software Engineering und Software Management 2018 |
| Reihe: | Lecture Notes in Informatics |
| Band einer Reihe: | 279 |
| Veranstaltungstitel: | 24. Tagung Software Engineering (SE) des Fachbereichs Softwaretechnik der Gesellschaft für Informatik |
| Veranstaltungsort: | Ulm, Germany |
| Veranstaltungsdatum: | 05.03.2018-09.03.2018 |
| URL / URN: | https://dl.gi.de/handle/20.500.12116/21183 |
| Kurzbeschreibung (Abstract): | In this talk, we present results on integrating support for variability modeling into a correct-by-construction development methodology for topology control algorithms, as appeared online in the Software & Systems Modeling journal in 2017. A topology control algorithm reduces the size of the visible neighborhood of a node in a wireless communication network. At the same time, it must fulfill important consistency properties to ensure a high quality of service. In previous work, we proposed a constructive, model-driven methodology for designing individual topology control algorithms based on declarative graph constraints and graph transformation rules; the resulting algorithms are guaranteed to preserve the specified properties. Even though many topology control algorithms share substantial (structural) parts, few works leverage these commonalities at design time. In this work, we generalize our proposed construction methodology by modeling variability points to support the construction of families of algorithms. We show the applicability of our approach by reengineering six existing topology control algorithms and developing e-kTC, a novel energy-efficient variant of the topology control algorithm kTC. Finally, we evaluate a subset of the algorithms using a novel integration of a wireless network simulator and a graph transformation tool. |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Echtzeitsysteme 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik 20 Fachbereich Informatik 20 Fachbereich Informatik > Sichere Mobile Netze 20 Fachbereich Informatik > Telekooperation DFG-Sonderforschungsbereiche (inkl. Transregio) DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > A: Konstruktionsmethodik DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > A: Konstruktionsmethodik > Teilprojekt A1: Modellierung DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > C: Kommunikationsmechanismen DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > C: Kommunikationsmechanismen > Teilprojekt C1 : Netzzentrische Sicht |
| Hinterlegungsdatum: | 06 Mär 2018 18:31 |
| Letzte Änderung: | 10 Jun 2021 06:11 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum