A Systematic Approach to Constructing Incremental Topology Control Algorithms Using Graph Transformation
Roland Kluge, Michael Stein, Gergely Varr\'o, Andy Sch\"urr, Matthias, Hollick, Max M\"uhlh\"auser

TL;DR
This paper introduces a visual graph transformation-based methodology for developing incremental topology control algorithms that ensure network properties like connectivity while adapting to dynamic changes.
Contribution
It presents a novel approach combining graph transformation and constraints to systematically design topology control algorithms with guaranteed properties.
Findings
Successfully re-engineered the kTC algorithm using the proposed method.
Demonstrated the approach's effectiveness through network simulation.
Ensured the algorithms meet specified consistency and optimization constraints.
Abstract
Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors). Real-world topologies are dynamic (e.g., because nodes join, leave, or move within the network), which requires topology control algorithms to operate in an incremental way, i.e., based on the recently introduced modifications of a topology. Visual programming and specification languages are a proven means for specifying the structure as well as consistency and optimization properties of topologies. In this paper, we present a novel methodology, based on a visual graph transformation and graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
