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


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2017-03-08

AUTHORS

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

ABSTRACT

In the communication system domain, constructing and maintaining network topologies via topology control algorithms is an important crosscutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of topology control algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of topology control algorithms. Furthermore, even though many topology control algorithms share substantial parts (such as structural patterns or tie-breaking strategies), few works constructively leverage these commonalities and differences of topology control algorithms systematically. In previous work, we addressed the constructive integration of consistency properties into the development process. We outlined a constructive, model-driven methodology for designing individual topology control algorithms. Valid and high-quality topologies are characterized using declarative graph constraints; topology control algorithms are specified using programmed graph transformation. We applied a well-known static analysis technique to refine a given topology control algorithm in a way that the resulting algorithm preserves the specified graph constraints. In this paper, we extend our constructive methodology by generalizing it to support the specification of families of topology control algorithms. To show the feasibility of our approach, we reengineering six existing topology control algorithms and develop e-kTC, a novel energy-efficient variant of the topology control algorithm kTC. Finally, we evaluate a subset of the specified topology control algorithms using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework. More... »

PAGES

1-41

References to SciGraph publications

  • 2015-07-17. Energy Consumption Analysis and Design of Energy-Aware WSN Agents in fUML in MODELLING FOUNDATIONS AND APPLICATIONS
  • 2009. Variabilities of Wireless and Actuators Sensor Network Middleware for Ambient Assisted Living in DISTRIBUTED COMPUTING, ARTIFICIAL INTELLIGENCE, BIOINFORMATICS, SOFT COMPUTING, AND AMBIENT ASSISTED LIVING
  • 2016. RuleMerger: Automatic Construction of Variability-Based Model Transformation Rules in FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING
  • 2013. On an Automated Translation of Satellite Procedures Using Triple Graph Grammars in THEORY AND PRACTICE OF MODEL TRANSFORMATIONS
  • 2011. Gossip in SELF-ORGANISING SOFTWARE
  • 2015-07-16. A Methodology for Designing Dynamic Topology Control Algorithms via Graph Transformation in THEORY AND PRACTICE OF MODEL TRANSFORMATIONS
  • 2014. Developing eMoflon with eMoflon in THEORY AND PRACTICE OF MODEL TRANSFORMATIONS
  • 2015. A Variability-Based Approach to Reusable and Efficient Model Transformations in FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING
  • 2009. A Middleware Family for VANETs in AD-HOC, MOBILE AND WIRELESS NETWORKS
  • 2005. Model-Driven Software Development in NONE
  • 2016. Mind the Gap! Automated Anomaly Detection for Potentially Unbounded Cardinality-Based Feature Models in FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING
  • 2004. Model Checking Graph Transformations: A Comparison of Two Approaches in GRAPH TRANSFORMATIONS
  • 2008. Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking in FORMAL METHODS FOR OPEN OBJECT-BASED DISTRIBUTED SYSTEMS
  • 2000. Dynamic Change Management by Distributed Graph Transformation: Towards Configurable Distributed Systems in THEORY AND APPLICATION OF GRAPH TRANSFORMATIONS
  • 2016-06-22. A Tool Environment for Managing Families of Model Transformation Rules in GRAPH TRANSFORMATION
  • 2008. Understanding SIP through Model-Checking in PRINCIPLES, SYSTEMS AND APPLICATIONS OF IP TELECOMMUNICATIONS. SERVICES AND SECURITY FOR NEXT GENERATION NETWORKS
  • 2014. Reference Architecture for Self-adaptive Management in Wireless Sensor Networks in ADAPTIVE AND INTELLIGENT SYSTEMS
  • 2007. Software Product Lines in Action, The Best Industrial Practice in Product Line Engineering in NONE
  • 2000. Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java in THEORY AND APPLICATION OF GRAPH TRANSFORMATIONS
  • 2005. Software Product Line Engineering, Foundations, Principles, and Techniques in NONE
  • 2006. Fundamentals of Algebraic Graph Transformation in NONE
  • 2008. Topology Control for Wireless Sensor Networks in WIRELESS SENSOR NETWORKS AND APPLICATIONS
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10270-017-0587-8

    DOI

    http://dx.doi.org/10.1007/s10270-017-0587-8

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1084024233


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Real-Time Systems Lab, TU Darmstadt, Merckstra\u00dfe 25, 64283, Darmstadt, Germany", 
              "id": "http://www.grid.ac/institutes/grid.6546.1", 
              "name": [
                "Real-Time Systems Lab, TU Darmstadt, Merckstra\u00dfe 25, 64283, Darmstadt, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Kluge", 
            "givenName": "Roland", 
            "id": "sg:person.013446667357.79", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013446667357.79"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Telecooperation Group, TU Darmstadt, Hochschulstra\u00dfe 10, 64289, Darmstadt, Germany", 
              "id": "http://www.grid.ac/institutes/grid.6546.1", 
              "name": [
                "Telecooperation Group, TU Darmstadt, Hochschulstra\u00dfe 10, 64289, Darmstadt, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Stein", 
            "givenName": "Michael", 
            "id": "sg:person.010357422301.78", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010357422301.78"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Real-Time Systems Lab, TU Darmstadt, Merckstra\u00dfe 25, 64283, Darmstadt, Germany", 
              "id": "http://www.grid.ac/institutes/grid.6546.1", 
              "name": [
                "Real-Time Systems Lab, TU Darmstadt, Merckstra\u00dfe 25, 64283, Darmstadt, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Varr\u00f3", 
            "givenName": "Gergely", 
            "id": "sg:person.014177044353.54", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014177044353.54"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Real-Time Systems Lab, TU Darmstadt, Merckstra\u00dfe 25, 64283, Darmstadt, Germany", 
              "id": "http://www.grid.ac/institutes/grid.6546.1", 
              "name": [
                "Real-Time Systems Lab, TU Darmstadt, Merckstra\u00dfe 25, 64283, Darmstadt, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Sch\u00fcrr", 
            "givenName": "Andy", 
            "id": "sg:person.015407133147.88", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015407133147.88"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Secure Mobile Networking Lab, TU Darmstadt, Mornewegstr. 32, 64293, Darmstadt, Germany", 
              "id": "http://www.grid.ac/institutes/grid.6546.1", 
              "name": [
                "Secure Mobile Networking Lab, TU Darmstadt, Mornewegstr. 32, 64293, Darmstadt, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Hollick", 
            "givenName": "Matthias", 
            "id": "sg:person.010143067443.79", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010143067443.79"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Telecooperation Group, TU Darmstadt, Hochschulstra\u00dfe 10, 64289, Darmstadt, Germany", 
              "id": "http://www.grid.ac/institutes/grid.6546.1", 
              "name": [
                "Telecooperation Group, TU Darmstadt, Hochschulstra\u00dfe 10, 64289, Darmstadt, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "M\u00fchlh\u00e4user", 
            "givenName": "Max", 
            "id": "sg:person.013372352505.84", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013372352505.84"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-28901-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027406291", 
              "https://doi.org/10.1007/3-540-28901-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-08789-4_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004406051", 
              "https://doi.org/10.1007/978-3-319-08789-4_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-04383-3_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039794724", 
              "https://doi.org/10.1007/978-3-642-04383-3_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-17348-6_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017983501", 
              "https://doi.org/10.1007/978-3-642-17348-6_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-49665-7_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012876397", 
              "https://doi.org/10.1007/978-3-662-49665-7_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-21155-8_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007385721", 
              "https://doi.org/10.1007/978-3-319-21155-8_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-21151-0_1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009933729", 
              "https://doi.org/10.1007/978-3-319-21151-0_1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-71437-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036088357", 
              "https://doi.org/10.1007/978-3-540-71437-8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-46464-8_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020494879", 
              "https://doi.org/10.1007/978-3-540-46464-8_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-02481-8_129", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013883513", 
              "https://doi.org/10.1007/978-3-642-02481-8_129"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-68863-1_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017076820", 
              "https://doi.org/10.1007/978-3-540-68863-1_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-38883-5_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008774725", 
              "https://doi.org/10.1007/978-3-642-38883-5_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-30203-2_17", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044168033", 
              "https://doi.org/10.1007/978-3-540-30203-2_17"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-11298-5_12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026316976", 
              "https://doi.org/10.1007/978-3-319-11298-5_12"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-0-387-49592-7_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032495676", 
              "https://doi.org/10.1007/978-0-387-49592-7_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-28554-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020780482", 
              "https://doi.org/10.1007/3-540-28554-7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-40530-8_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1037731194", 
              "https://doi.org/10.1007/978-3-319-40530-8_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-89054-6_13", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034995218", 
              "https://doi.org/10.1007/978-3-540-89054-6_13"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-46675-9_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021352946", 
              "https://doi.org/10.1007/978-3-662-46675-9_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-46464-8_21", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036377338", 
              "https://doi.org/10.1007/978-3-540-46464-8_21"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-49665-7_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013763844", 
              "https://doi.org/10.1007/978-3-662-49665-7_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-31188-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007844579", 
              "https://doi.org/10.1007/3-540-31188-2"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2017-03-08", 
        "datePublishedReg": "2017-03-08", 
        "description": "In the communication system domain, constructing and maintaining network topologies via topology control algorithms is an important crosscutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of topology control algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of topology control algorithms. Furthermore, even though many topology control algorithms share substantial parts (such as structural patterns or tie-breaking strategies), few works constructively leverage these commonalities and differences of topology control algorithms systematically. In previous work, we addressed the constructive integration of consistency properties into the development process. We outlined a constructive, model-driven methodology for designing individual topology control algorithms. Valid and high-quality topologies are characterized using declarative graph constraints; topology control algorithms are specified using programmed graph transformation. We applied a well-known static analysis technique to refine a given topology control algorithm in a way that the resulting algorithm preserves the specified graph constraints. In this paper, we extend our constructive methodology by generalizing it to support the specification of families of topology control algorithms. To show the feasibility of our approach, we reengineering six existing topology control algorithms and develop e-kTC, a novel energy-efficient variant of the topology control algorithm kTC. Finally, we evaluate a subset of the specified topology control algorithms using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s10270-017-0587-8", 
        "inLanguage": "en", 
        "isAccessibleForFree": true, 
        "isPartOf": [
          {
            "id": "sg:journal.1136228", 
            "issn": [
              "1619-1366", 
              "1619-1374"
            ], 
            "name": "Software and Systems Modeling", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "18"
          }
        ], 
        "keywords": [
          "topology control algorithm", 
          "control algorithm", 
          "graph transformation", 
          "graph constraints", 
          "network topology", 
          "model-driven methodology", 
          "high-quality topologies", 
          "network simulation framework", 
          "static analysis techniques", 
          "development process", 
          "tool integration", 
          "algorithm preserves", 
          "system domain", 
          "network nodes", 
          "simulation framework", 
          "algorithm", 
          "optimization properties", 
          "key requirement", 
          "research area", 
          "constructive methodology", 
          "energy-efficient variants", 
          "consistency properties", 
          "nodes", 
          "topology", 
          "previous work", 
          "analysis techniques", 
          "high quality", 
          "constraints", 
          "systematic approach", 
          "eMoflon", 
          "integration", 
          "graph", 
          "specification", 
          "methodology", 
          "services", 
          "constructing", 
          "framework", 
          "requirements", 
          "work", 
          "domain", 
          "technique", 
          "feasibility", 
          "certain consistency", 
          "process", 
          "quality", 
          "link", 
          "way", 
          "consistency", 
          "edge", 
          "transformation", 
          "commonalities", 
          "constructive integration", 
          "subset", 
          "preserves", 
          "KTC", 
          "part", 
          "variants", 
          "substantial part", 
          "area", 
          "attempt", 
          "properties", 
          "family", 
          "approach", 
          "differences", 
          "paper", 
          "communication system domain", 
          "important crosscutting research area", 
          "crosscutting research area", 
          "individual topology control algorithms", 
          "declarative graph constraints", 
          "specification of families", 
          "novel energy-efficient variant", 
          "topology control algorithm kTC", 
          "control algorithm kTC", 
          "algorithm kTC", 
          "new tool integration", 
          "graph transformation tool eMoflon", 
          "transformation tool eMoflon", 
          "tool eMoflon", 
          "Simonstrator network simulation framework", 
          "incremental topology control algorithms"
        ], 
        "name": "A systematic approach to constructing families of incremental topology control algorithms using graph transformation", 
        "pagination": "1-41", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1084024233"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10270-017-0587-8"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10270-017-0587-8", 
          "https://app.dimensions.ai/details/publication/pub.1084024233"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2021-12-01T19:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/article/article_730.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s10270-017-0587-8"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10270-017-0587-8'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10270-017-0587-8'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10270-017-0587-8'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10270-017-0587-8'


     

    This table displays all metadata directly associated to this object as RDF triples.

    266 TRIPLES      22 PREDICATES      128 URIs      98 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10270-017-0587-8 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N224181783d414d6398cda17dd73e1940
    4 schema:citation sg:pub.10.1007/3-540-28554-7
    5 sg:pub.10.1007/3-540-28901-1
    6 sg:pub.10.1007/3-540-31188-2
    7 sg:pub.10.1007/978-0-387-49592-7_5
    8 sg:pub.10.1007/978-3-319-08789-4_10
    9 sg:pub.10.1007/978-3-319-11298-5_12
    10 sg:pub.10.1007/978-3-319-21151-0_1
    11 sg:pub.10.1007/978-3-319-21155-8_15
    12 sg:pub.10.1007/978-3-319-40530-8_6
    13 sg:pub.10.1007/978-3-540-30203-2_17
    14 sg:pub.10.1007/978-3-540-46464-8_13
    15 sg:pub.10.1007/978-3-540-46464-8_21
    16 sg:pub.10.1007/978-3-540-68863-1_10
    17 sg:pub.10.1007/978-3-540-71437-8
    18 sg:pub.10.1007/978-3-540-89054-6_13
    19 sg:pub.10.1007/978-3-642-02481-8_129
    20 sg:pub.10.1007/978-3-642-04383-3_31
    21 sg:pub.10.1007/978-3-642-17348-6_7
    22 sg:pub.10.1007/978-3-642-38883-5_4
    23 sg:pub.10.1007/978-3-662-46675-9_19
    24 sg:pub.10.1007/978-3-662-49665-7_10
    25 sg:pub.10.1007/978-3-662-49665-7_8
    26 schema:datePublished 2017-03-08
    27 schema:datePublishedReg 2017-03-08
    28 schema:description In the communication system domain, constructing and maintaining network topologies via topology control algorithms is an important crosscutting research area. Network topologies are usually modeled using attributed graphs whose nodes and edges represent the network nodes and their interconnecting links. A key requirement of topology control algorithms is to fulfill certain consistency and optimization properties to ensure a high quality of service. Still, few attempts have been made to constructively integrate these properties into the development process of topology control algorithms. Furthermore, even though many topology control algorithms share substantial parts (such as structural patterns or tie-breaking strategies), few works constructively leverage these commonalities and differences of topology control algorithms systematically. In previous work, we addressed the constructive integration of consistency properties into the development process. We outlined a constructive, model-driven methodology for designing individual topology control algorithms. Valid and high-quality topologies are characterized using declarative graph constraints; topology control algorithms are specified using programmed graph transformation. We applied a well-known static analysis technique to refine a given topology control algorithm in a way that the resulting algorithm preserves the specified graph constraints. In this paper, we extend our constructive methodology by generalizing it to support the specification of families of topology control algorithms. To show the feasibility of our approach, we reengineering six existing topology control algorithms and develop e-kTC, a novel energy-efficient variant of the topology control algorithm kTC. Finally, we evaluate a subset of the specified topology control algorithms using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework.
    29 schema:genre article
    30 schema:inLanguage en
    31 schema:isAccessibleForFree true
    32 schema:isPartOf Na5ce0a190e234be7bc2db5b647a6ce57
    33 Nc999a31c0712473fa07605d9e65889c7
    34 sg:journal.1136228
    35 schema:keywords KTC
    36 Simonstrator network simulation framework
    37 algorithm
    38 algorithm kTC
    39 algorithm preserves
    40 analysis techniques
    41 approach
    42 area
    43 attempt
    44 certain consistency
    45 commonalities
    46 communication system domain
    47 consistency
    48 consistency properties
    49 constraints
    50 constructing
    51 constructive integration
    52 constructive methodology
    53 control algorithm
    54 control algorithm kTC
    55 crosscutting research area
    56 declarative graph constraints
    57 development process
    58 differences
    59 domain
    60 eMoflon
    61 edge
    62 energy-efficient variants
    63 family
    64 feasibility
    65 framework
    66 graph
    67 graph constraints
    68 graph transformation
    69 graph transformation tool eMoflon
    70 high quality
    71 high-quality topologies
    72 important crosscutting research area
    73 incremental topology control algorithms
    74 individual topology control algorithms
    75 integration
    76 key requirement
    77 link
    78 methodology
    79 model-driven methodology
    80 network nodes
    81 network simulation framework
    82 network topology
    83 new tool integration
    84 nodes
    85 novel energy-efficient variant
    86 optimization properties
    87 paper
    88 part
    89 preserves
    90 previous work
    91 process
    92 properties
    93 quality
    94 requirements
    95 research area
    96 services
    97 simulation framework
    98 specification
    99 specification of families
    100 static analysis techniques
    101 subset
    102 substantial part
    103 system domain
    104 systematic approach
    105 technique
    106 tool eMoflon
    107 tool integration
    108 topology
    109 topology control algorithm
    110 topology control algorithm kTC
    111 transformation
    112 transformation tool eMoflon
    113 variants
    114 way
    115 work
    116 schema:name A systematic approach to constructing families of incremental topology control algorithms using graph transformation
    117 schema:pagination 1-41
    118 schema:productId Naf4d0b0701294f6ba70f0717235f7fb0
    119 Nb363eaa3cb7e42789b4103ce7c4840cb
    120 schema:sameAs https://app.dimensions.ai/details/publication/pub.1084024233
    121 https://doi.org/10.1007/s10270-017-0587-8
    122 schema:sdDatePublished 2021-12-01T19:38
    123 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    124 schema:sdPublisher N9ed8cb32330247529d623d21d2a372a1
    125 schema:url https://doi.org/10.1007/s10270-017-0587-8
    126 sgo:license sg:explorer/license/
    127 sgo:sdDataset articles
    128 rdf:type schema:ScholarlyArticle
    129 N224181783d414d6398cda17dd73e1940 rdf:first sg:person.013446667357.79
    130 rdf:rest Nda9030272e5641c4a927d06dceef53d4
    131 N40ac780793a74650bf05e835ef6cf2be rdf:first sg:person.014177044353.54
    132 rdf:rest Ncaaaa504c82a4e158143d2aaa04f0277
    133 N4fd5c43f6485424e98ffc62bd6c25fd3 rdf:first sg:person.010143067443.79
    134 rdf:rest N592fd968a30545d5a758c50f659c01d7
    135 N592fd968a30545d5a758c50f659c01d7 rdf:first sg:person.013372352505.84
    136 rdf:rest rdf:nil
    137 N9ed8cb32330247529d623d21d2a372a1 schema:name Springer Nature - SN SciGraph project
    138 rdf:type schema:Organization
    139 Na5ce0a190e234be7bc2db5b647a6ce57 schema:volumeNumber 18
    140 rdf:type schema:PublicationVolume
    141 Naf4d0b0701294f6ba70f0717235f7fb0 schema:name doi
    142 schema:value 10.1007/s10270-017-0587-8
    143 rdf:type schema:PropertyValue
    144 Nb363eaa3cb7e42789b4103ce7c4840cb schema:name dimensions_id
    145 schema:value pub.1084024233
    146 rdf:type schema:PropertyValue
    147 Nc999a31c0712473fa07605d9e65889c7 schema:issueNumber 1
    148 rdf:type schema:PublicationIssue
    149 Ncaaaa504c82a4e158143d2aaa04f0277 rdf:first sg:person.015407133147.88
    150 rdf:rest N4fd5c43f6485424e98ffc62bd6c25fd3
    151 Nda9030272e5641c4a927d06dceef53d4 rdf:first sg:person.010357422301.78
    152 rdf:rest N40ac780793a74650bf05e835ef6cf2be
    153 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    154 schema:name Information and Computing Sciences
    155 rdf:type schema:DefinedTerm
    156 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    157 schema:name Computation Theory and Mathematics
    158 rdf:type schema:DefinedTerm
    159 sg:journal.1136228 schema:issn 1619-1366
    160 1619-1374
    161 schema:name Software and Systems Modeling
    162 schema:publisher Springer Nature
    163 rdf:type schema:Periodical
    164 sg:person.010143067443.79 schema:affiliation grid-institutes:grid.6546.1
    165 schema:familyName Hollick
    166 schema:givenName Matthias
    167 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010143067443.79
    168 rdf:type schema:Person
    169 sg:person.010357422301.78 schema:affiliation grid-institutes:grid.6546.1
    170 schema:familyName Stein
    171 schema:givenName Michael
    172 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010357422301.78
    173 rdf:type schema:Person
    174 sg:person.013372352505.84 schema:affiliation grid-institutes:grid.6546.1
    175 schema:familyName Mühlhäuser
    176 schema:givenName Max
    177 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013372352505.84
    178 rdf:type schema:Person
    179 sg:person.013446667357.79 schema:affiliation grid-institutes:grid.6546.1
    180 schema:familyName Kluge
    181 schema:givenName Roland
    182 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013446667357.79
    183 rdf:type schema:Person
    184 sg:person.014177044353.54 schema:affiliation grid-institutes:grid.6546.1
    185 schema:familyName Varró
    186 schema:givenName Gergely
    187 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014177044353.54
    188 rdf:type schema:Person
    189 sg:person.015407133147.88 schema:affiliation grid-institutes:grid.6546.1
    190 schema:familyName Schürr
    191 schema:givenName Andy
    192 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015407133147.88
    193 rdf:type schema:Person
    194 sg:pub.10.1007/3-540-28554-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020780482
    195 https://doi.org/10.1007/3-540-28554-7
    196 rdf:type schema:CreativeWork
    197 sg:pub.10.1007/3-540-28901-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027406291
    198 https://doi.org/10.1007/3-540-28901-1
    199 rdf:type schema:CreativeWork
    200 sg:pub.10.1007/3-540-31188-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007844579
    201 https://doi.org/10.1007/3-540-31188-2
    202 rdf:type schema:CreativeWork
    203 sg:pub.10.1007/978-0-387-49592-7_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032495676
    204 https://doi.org/10.1007/978-0-387-49592-7_5
    205 rdf:type schema:CreativeWork
    206 sg:pub.10.1007/978-3-319-08789-4_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004406051
    207 https://doi.org/10.1007/978-3-319-08789-4_10
    208 rdf:type schema:CreativeWork
    209 sg:pub.10.1007/978-3-319-11298-5_12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026316976
    210 https://doi.org/10.1007/978-3-319-11298-5_12
    211 rdf:type schema:CreativeWork
    212 sg:pub.10.1007/978-3-319-21151-0_1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009933729
    213 https://doi.org/10.1007/978-3-319-21151-0_1
    214 rdf:type schema:CreativeWork
    215 sg:pub.10.1007/978-3-319-21155-8_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007385721
    216 https://doi.org/10.1007/978-3-319-21155-8_15
    217 rdf:type schema:CreativeWork
    218 sg:pub.10.1007/978-3-319-40530-8_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037731194
    219 https://doi.org/10.1007/978-3-319-40530-8_6
    220 rdf:type schema:CreativeWork
    221 sg:pub.10.1007/978-3-540-30203-2_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044168033
    222 https://doi.org/10.1007/978-3-540-30203-2_17
    223 rdf:type schema:CreativeWork
    224 sg:pub.10.1007/978-3-540-46464-8_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020494879
    225 https://doi.org/10.1007/978-3-540-46464-8_13
    226 rdf:type schema:CreativeWork
    227 sg:pub.10.1007/978-3-540-46464-8_21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036377338
    228 https://doi.org/10.1007/978-3-540-46464-8_21
    229 rdf:type schema:CreativeWork
    230 sg:pub.10.1007/978-3-540-68863-1_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017076820
    231 https://doi.org/10.1007/978-3-540-68863-1_10
    232 rdf:type schema:CreativeWork
    233 sg:pub.10.1007/978-3-540-71437-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036088357
    234 https://doi.org/10.1007/978-3-540-71437-8
    235 rdf:type schema:CreativeWork
    236 sg:pub.10.1007/978-3-540-89054-6_13 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034995218
    237 https://doi.org/10.1007/978-3-540-89054-6_13
    238 rdf:type schema:CreativeWork
    239 sg:pub.10.1007/978-3-642-02481-8_129 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013883513
    240 https://doi.org/10.1007/978-3-642-02481-8_129
    241 rdf:type schema:CreativeWork
    242 sg:pub.10.1007/978-3-642-04383-3_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039794724
    243 https://doi.org/10.1007/978-3-642-04383-3_31
    244 rdf:type schema:CreativeWork
    245 sg:pub.10.1007/978-3-642-17348-6_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017983501
    246 https://doi.org/10.1007/978-3-642-17348-6_7
    247 rdf:type schema:CreativeWork
    248 sg:pub.10.1007/978-3-642-38883-5_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008774725
    249 https://doi.org/10.1007/978-3-642-38883-5_4
    250 rdf:type schema:CreativeWork
    251 sg:pub.10.1007/978-3-662-46675-9_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021352946
    252 https://doi.org/10.1007/978-3-662-46675-9_19
    253 rdf:type schema:CreativeWork
    254 sg:pub.10.1007/978-3-662-49665-7_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012876397
    255 https://doi.org/10.1007/978-3-662-49665-7_10
    256 rdf:type schema:CreativeWork
    257 sg:pub.10.1007/978-3-662-49665-7_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013763844
    258 https://doi.org/10.1007/978-3-662-49665-7_8
    259 rdf:type schema:CreativeWork
    260 grid-institutes:grid.6546.1 schema:alternateName Real-Time Systems Lab, TU Darmstadt, Merckstraße 25, 64283, Darmstadt, Germany
    261 Secure Mobile Networking Lab, TU Darmstadt, Mornewegstr. 32, 64293, Darmstadt, Germany
    262 Telecooperation Group, TU Darmstadt, Hochschulstraße 10, 64289, Darmstadt, Germany
    263 schema:name Real-Time Systems Lab, TU Darmstadt, Merckstraße 25, 64283, Darmstadt, Germany
    264 Secure Mobile Networking Lab, TU Darmstadt, Mornewegstr. 32, 64293, Darmstadt, Germany
    265 Telecooperation Group, TU Darmstadt, Hochschulstraße 10, 64289, Darmstadt, Germany
    266 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...