English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In the communication systems domain, constructing and maintaining networktopologies via topology control (TC) algorithms is an important cross-cuttingresearch area. Network topologies are usually modeled using attributed graphswhose nodes and edges represent the network nodes and their interconnectinglinks. A key requirement of TC algorithms is to fulfill certain consistency andoptimization properties to ensure a high quality of service. Still, fewattempts have been made to constructively integrate these properties into thedevelopment process of TC algorithms. Furthermore, even though many TCalgorithms share substantial parts (such as structural patterns or tie-breakingstrategies), few works constructively leverage these commonalities anddifferences of TC algorithms systematically. In previous work, we addressed theconstructive integration of consistency properties into the developmentprocess. We outlined a constructive, model-driven methodology for designingindividual TC algorithms. Valid and high-quality topologies are characterizedusing declarative graph constraints; TC algorithms are specified usingprogrammed graph transformation. We applied a well-known static analysistechnique to refine a given TC algorithm in a way that the resulting algorithmpreserves the specified graph constraints.  In this paper, we extend our constructive methodology by generalizing it tosupport the specification of families of TC algorithms. To show the feasibilityof our approach, we reneging six existing TC algorithms and develop e-kTC, anovel energy-efficient variant of the TC algorithm kTC. Finally, we evaluate asubset of the specified TC algorithms using a new tool integration of the graphtransformation tool eMoflon and the Simonstrator network simulation framework.

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