A Systematic Approach to Constructing Incremental Topology Control Algorithms Using Graph Transformation

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 constraint language, for developing incremental topology control algorithms that are guaranteed to fulfill a set of specified consistency and optimization constraints. More specifically, we model the possible modifications of a topology control algorithm and the environment using graph transformation rules, and we describe consistency and optimization properties using graph constraints. On this basis, we apply and extend a well-known constructive approach to derive refined graph transformation rules that preserve these graph constraints. We apply our methodology to re-engineer an established topology control algorithm, kTC, and evaluate it in a network simulation study to show the practical applicability of our approach