A systematic approach to constructing families of incremental topology control algorithms using graph transformation

Kluge, Roland; Stein, Michael; Varró, Gergely; Schürr, Andy; Hollick, Matthias; Mühlhäuser, Max

doi:10.1007/s10270-017-0587-8

Cited by 12 publications

(3 citation statements)

References 78 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results obtained allow us to consider this set of factors M1-M9 as a system. In the context of this, further analysis by Markov methods is of interest, which has already been done in a number of other works [22, 23], [24], [26, 27], [28,29], and to visualize the results obtained similarly to the "system landscape" proposed in [30], which clearly demonstrates how the most "influencing" factors considered system, and experiencing the greatest influence from the whole system as a whole. Below is a screenshot of the first order adjacency matrix for the graph shown in Fig.…”

Section: Resultsmentioning

confidence: 99%

Elaboration of a Markov Model of Project Success

Olekh,

Prokopovych,

Olekh

et al. 2020

AAIT

View full text Add to dashboard Cite

The development of software and the creation on its basis of models that reflect the main features of project management systems is an important task of project management.Despite the significant differences between the types of projects and the variety of conditions for their implementation, assessments of the effectiveness / success of projects should be carried out in a certain way uniformly, on the basis of common justified principles. This article discusses the construction of a matrix of "strong connectivity" for the methodological principles of assessing the effectiveness / success of projects based on a directed graph. Methodological, the most general principles that ensure, when applied, the rational behavior of stakeholders regardless of the nature and objectives of the project. All of the above principles for evaluating the effectiveness / success of projects are interconnected. In order to show the topology and directions of the interconnections of methodological principles, it is necessary to draw up a matrix diagram. With its help, it can determine the relationship between methodological principles. The matrix diagram often called the matrix of connections, shows the degree of dependence of the criteria of one on another, how strong are the connections between them. The resulting matrix illustrates the relationship between all methodological principles and indicates that relying on only one of the methodological principles for evaluating the effectiveness / success of projects, we can conclude that the mission / project is effective / successful.Presentation of modeling data based on the analysis of the structure of relations between elements allows also to determine the areas of greatest attention from the project manager. In particular, we can make an assumption, by analogy with the Pareto rule, that the maximum managerial effect can be expected from the control of some factors. The developed model allows to evaluate the effectiveness of project activities on the basis of only one from all indicators of the methodological principles of project evaluation.

show abstract

Section: Resultsmentioning

confidence: 99%

Elaboration of a Markov Model of Project Success

Olekh,

Prokopovych,

Olekh

et al. 2020

AAIT

View full text Add to dashboard Cite

show abstract

“…Links with status unclassified (u) require status revision. The dpo rules shown in Figures 1a-1c represent topology control (tc) operations [11]: p e and p u reduce link redundancy either conservatively by eliminating u-edges from active triangles (p e ), or through unclassifying edges with active neighbors (p u ), whereas p a is a stability counter-measure, activating unclassified edges. We use the rules in Fig.…”

Section: An Illustrative Example: Wsn Topology Controlmentioning

confidence: 99%

Equivalence and Independence in Controlled Graph-Rewriting Processes

Kulcsár

Corradini

Lochau

2018

Graph Transformation

View full text Add to dashboard Cite

Graph transformation systems (GTS) are often defined as sets of rules that can be applied repeatedly and non-deterministically to model the evolution of a system. Several semantics proposed for GTSs are relevant in this case, providing means for analysing the system's behaviour in terms of dependencies, conflicts and potential parallelism among the relevant events. Several other approaches equip GTSs with an additional control layer useful for specifying rule application strategies, for example to describe graph manipulation algorithms. Almost invariably, the latter approaches consider only an input-output semantics, for which the above mentioned semantics are irrelevant. We propose an original approach to controlled graph transformation, where we aim at bridging the gap between these two complementary classes of approaches. The control is represented by terms of a simple process calculus. Expressiveness is addressed by encoding in the calculus the Graph Processes defined by Habel and Plump, and some initial results are presented relating parallel independence with process algebraic notions like bisimilarity.

show abstract

“…Topology control (TC) mechanisms aim to adapt the topology of a network to optimize performance metrics such as energy consumption while maintaining connectivity requirements throughout the network [13,14]. TC schemes were initially designed for Wireless Sensor Networks (WSNs), Mobile Ad Hoc Networks (MANETs), and Wireless Mesh Networks (WMNs) to improve overall performance [15][16][17].…”

Section: Introductionmentioning

confidence: 99%

A Spectral Gap-Based Topology Control Algorithm for Wireless Backhaul Networks

González-Ambriz,

Menchaca-Méndez,

Pinacho-Castellanos

et al. 2024

Future Internet

View full text Add to dashboard Cite

This paper presents the spectral gap-based topology control algorithm (SGTC) for wireless backhaul networks, a novel approach that employs the Laplacian Spectral Gap (LSG) to find expander-like graphs that optimize the topology of the network in terms of robustness, diameter, energy cost, and network entropy. The latter measures the network’s ability to promote seamless traffic offloading from the Macro Base Stations to smaller cells by providing a high diversity of shortest paths connecting all the stations. Given the practical constraints imposed by cellular technologies, the proposed algorithm uses simulated annealing to search for feasible network topologies with a large LSG. Then, it computes the Pareto front of the set of feasible solutions found during the annealing process when considering robustness, diameter, and entropy as objective functions. The algorithm’s result is the Pareto efficient solution that minimizes energy cost. A set of experimental results shows that by optimizing the LSG, the proposed algorithm simultaneously optimizes the set of desirable topological properties mentioned above. The results also revealed that generating networks with good spectral expansion is possible even under the restrictions imposed by current wireless technologies. This is a desirable feature because these networks have strong connectivity properties even if they do not have a large number of links.

show abstract

A systematic approach to constructing families of incremental topology control algorithms using graph transformation

Cited by 12 publications

References 78 publications

Elaboration of a Markov Model of Project Success

Elaboration of a Markov Model of Project Success

Equivalence and Independence in Controlled Graph-Rewriting Processes

A Spectral Gap-Based Topology Control Algorithm for Wireless Backhaul Networks

Contact Info

Product

Resources

About