More Web Proxy on the site http://driver.im/

research-article

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

Authors:

Matthias Hollick,

Max MhlhuserAuthors Info & Claims

Journal of Visual Languages and Computing, Volume 38, Issue C

Pages 47 - 83

https://doi.org/10.1016/j.jvlc.2016.10.003

Published: 01 February 2017 Publication History

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.

References

[1]

P. Santi, Topology control in wireless ad hoc and sensor networks, ACM Comput. Surv., 37 (2005) 164-194.

Digital Library

[2]

J. Yick, B. Mukherjee, D. Ghosal, Wireless sensor network survey, Comput. Netw., 52 (2008) 2292-2330.

Digital Library

[3]

Y. Wang, Topology Control for Wireless Sensor Networks, in: Wireless Sensor Networks and Applications, Springer, 113147, 2008

[4]

R. Sun, J. Yuan, I. You, X. Shan, Y. Ren, Energy-aware weighted graph based dynamic topology control algorithm, Simul. Model. Pract. Theory, 19 (2011) 1773-1781.

[5]

M. Li, Z. Li, A.V. Vasilakos, A survey on topology control in wireless sensor networks:taxonomy, comparative study, and open issues, Proc. IEEE, 101 (2013) 2538-2557.

[6]

I. Schweizer, M. Wagner, D. Bradler, M. Mhlhauser, T. Strufe, kTC - Robust and Adaptive Wireless Ad-Hoc Topology Control, in: Proc. of the Intl. Conf. on Computer Communications and Networks, 19., 2012

[7]

R. Wattenhofer, A. Zollinger, XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks, in: Proc. of Parallel and Distributed Processing Symposium, 2004., 216223., 2004a

[8]

N. Li, J. Hou, L. Sha, Design and analysis of an MST-based topology control algorithm, IEEE Trans. Wirel. Commun., 4 (2005) 1195-1206.

Digital Library

[9]

R. Machado, S. Tekinay, A survey of game-theoretic approaches in wireless sensor networks, Comput. Netw., 52 (2008) 3047-3061.

Digital Library

[10]

H.-Y. Shi, W.-L. Wang, N.-M. Kwok, S.-Y. Chen, Game theory for wireless sensor networks:a survey, Sensors, 12 (2012) 9055-9097.

[11]

G.Z. Papadopoulos, K. Kritsis, A. Gallais, P. Chatzimisios, T. Noel, Performance evaluation methods in ad hoc and wireless sensor networks:a literature study, IEEE Commun. Mag., 54 (2016) 122-128.

[12]

X. Chu, H. Sethu, Cooperative Topology Control with Adaptation for Improved Lifetime in Wireless Ad-Hoc Networks, in: Proc. of INFOCOM 2012, 262270., 2012

[13]

D. Monderer, L.S. Shapley, Potential games, Games Econ. Behav., 14 (1996) 124-143.

[14]

P. Zave, Understanding SIP through Model-Checking, in: Principles, Systems and Applications of IP Telecommunications. Services and Security for Next Generation Networks, vol. 5310, Springer, 256279., 2008

[15]

P. Zave, Using lightweight modeling to understand chord, SIGCOMM Comput. Commun. Rev., 42 (2012) 49-57.

Digital Library

[16]

J. Qadir, O. Hasan, Applying formal methods to networking:theory, techniques, and applications, IEEE Commun. Surv. Tutor., 17 (2015) 256-291.

[17]

M. Vlter, T. Stahl, J. Bettin, A. Haase, S. Helsen, Model-Driven Software Development: Technology, Engineering, Management, John Wiley & Sons, Chichester, 2013.

[18]

J. Blendin, J. Rckert, T. Volk, D. Hausheer, Adaptive Software Defined Multicast, in: Proc. of Network Softwarization (NetSoft 2015), 19., 2015

[19]

R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Tubig, A Distributed Polylogarithmic Time Algorithm for Self-stabilizing Skip Graphs, in: Proc. of the ACM Symposium on Principles of Distributed Computing, ACM, 131140., 2009

[20]

S. Kniesburges, A. Koutsopoulos, C. Scheideler, Re-chord:a self-stabilizing chord overlay network, Theory Comput. Syst., 55 (2014) 591-612.

Digital Library

[21]

G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations, World Scientific., 1997

[22]

H. Ehrig, K. Ehrig, U. Prange, G. Taentzer, Fundamentals of Algebraic Graph Transformation, Springer, Berlin, Heidelberg, 2006.

[23]

E. Leblebici, A. Anjorin, A. Schrr, Developing eMoflon with eMoflon, in: Proc. of ICMT 2014, 138145., 2014

[24]

A. Rensink, The GROOVE Simulator: A Tool for State Space Generation, in: Applications of Graph Transformations with Industrial Relevance, vol. 3062, Springer, 479485., 2004

[25]

T. Arendt, E. Biermann, S. Jurack, C. Krause, G. Taentzer, Henshin: Advanced Concepts and Tools for In-Place EMF Model Transformations, in: Model Driven Engineering Languages and Systems, vol. 6394, Springer, 121135., 2010

[26]

R. Gei, V. Batz, D. Grund, S. Hack, A.M. Szalkowski, GrGen: A Fast SPO-Based Graph Rewriting Tool, in: Proc. Intl. Conference on Graph Transformation, vol. 4178, Springer, 383397., 2006

[27]

G. Taentzer, AGG: A Tool Environment for Algebraic Graph Transformation, in: Proc. of AGTIVE'99, vol. 1779, Springer, 481490, URL http://10.1007/3-540-45104-8_41, 2000.

[28]

U. Nickel, J. Niere, A. Zndorf, The FUJABA Environment, in: Proc. of ICSE, ACM, 742745., 2000

[29]

O.M. Group, UML Specification, Version 2.0, OMG, URL http://www.omg.org/spec/UML/, 2005.

[30]

H. Gomaa, Designing Concurrent, Distributed, and Real-time Applications with UML, in: Proc. of the 23rd Intl. Conference on Software Engineering, IEEE, 737738, URL http://dl.acm.org/citation.cfm?id=381473.381619, 2001.

[31]

N. de Wet, P. Kritzinger, Using UML models for the performance analysis of network systems, Comput. Netw., 49 (2005) 627-642.

Digital Library

[32]

H. Wada, P. Boonma, J. Suzuki, K. Oba, Modeling and Executing Adaptive Sensor Network Applications with the Matilda UML Virtual Machine, in: Proc. of the IASTED ICSE and Applications, ACTA Press, 2007, pp. 216225.

[33]

W. Schfer, H. Wehrheim, Model-Driven Development with Mechatronic UML, in: Graph Transformations and Model-Driven Engineering, vol. 5765, Springer, 533554., 2010

[34]

T.-C. Chen, Y. Deng, S.-K. Chang, A simulator for distributed systems using g-nets, Model. Simul., 23 (1993).

[35]

K. Ng, J. Kramer, J. Magee, N. Dulay, A Visual Approach to Distributed Programming, in: Tools and Environments for Parallel and Distributed Systems, vol. 2, Springer, 731., 1996

[36]

K. Zhang, Visual Languages and Applications, Springer, US, 2007.

[37]

K. Marriott, B. Meyer, Visual Language Theory, Springer, New York, 1998.

[38]

S.-K. K. Chang, E. Glinert, J.G. Bonar, M. Graf, A.T. Berztiss, Principles of Visual Programming Systems, Prentice Hall Professional Technical Reference, 1990.

[39]

F. Bauer, B. Moller, H. Partsch, P. Pepper, Formal program construction by transformations-computer-aided, intuition-guided programming, IEEE Trans.Softw. Eng., 15 (1989) 165-180.

Digital Library

[40]

R. France, B. Rumpe, Model-driven development of complex software: a research roadmap, in: Future of Software Engineering, IEEE, 2007, pp. 3754.

[41]

A. Habel, K.-H. Pennemann, Nested Constraints and Application Conditions for High-Level Structures, in: Formal Methods in Software and Systems Modeling, vol. 3393, Springer, 2005, pp. 293308.

[42]

R. Heckel, A. Wagner, Ensuring Consistency of Conditional Graph Rewriting A Constructive Approach, in: Proc. of Joint COMPUGRAPH/SEMAGRAPH Workshop, vol. 2, Elsevier, 1995, pp. 118126.

[43]

F. Deckwerth, G. Varr, Generating preconditions from graph constraints by higher order graph transformation, ECEASST, 67 (2014) 1-14.

[44]

C.-L. Fok, G.-C. Roman, C. Lu, Agilla:a mobile agent middleware for self-adaptive wireless sensor networks, ACM Trans.Auton. Adapt. Syst., 4 (2009) 16:1-16:26.

Digital Library

[45]

T. Rodrigues, F. Delicato, T. Batista, P. Pires, L. Pirmez, An approach based on the domain perspective to develop WSAN applications, Softw. Syst. Model. (2015) 1-29.

[46]

K. Tei, R. Shimizu, Y. Fukazawa, S. Honiden, Model-driven-development-based stepwise software development process for wireless sensor networks, IEEE Trans.Syst. Man Cybern., 45 (2015) 675-687.

[47]

P. Baldwin, S. Kohli, E.A. Lee, X. Liu, Y. Zhao, Modeling of Sensor Nets in Ptolemy II, in: Proc. of the Intl. Symposium on Information Processing in Sensor Networks, ACM, 359368., 2004

[48]

R. Kluge, G. Varr, A. Schrr, A Methodology for Designing Dynamic Topology Control Algorithms via Graph Transformation, in: Theory and Practice of Model Transformations, vol. 9152, Springer Intl. Publishing, 2015, pp. 199213.

[49]

B. Karp, H.T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, in: Proceedings of the 6th Annual Intl. Conference on Mobile Computing and Networking, ACM, 2000, pp. 243254.

[50]

M. Stein, A. Frmmgen, R. Kluge, F. Lffler, A. Schrr, A. Buchmann, M. Mhlhuser, TARL: Modeling Topology Adaptations for Networking Applications, in: Proc. of the 11th Intl. Symposium on Software Engineering for Adaptive and Self-Managing Systems, ACM, 2016, pp. 5763.

[51]

M. Naor, L. Stockmeyer, What can be computed locally?, SIAM J. Comput., 24 (1995) 1259-1277.

Digital Library

[52]

N. Linial, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992) 193-201.

Digital Library

[53]

M. Stein, T. Petry, I. Schweizer, M. Bachmann, M. Mhlhuser, Topology Control in Wireless Sensor Networks: What Blocks the Breakthrough?, in: Proc. of LCN 2016, 19, to appear, 2016b.

[54]

R. Wattenhofer, A. Zollinger, XTC: a practical topology control algorithm for ad-hoc networks, in: Proc. of the 18th Intl. Parallel and Distributed Processing Symposium, 216223., 2004b

[55]

G.T. Toussaint, The relative neighbourhood graph of a finite planar set, Pattern Recognit., 12 (1980) 261-268.

[56]

X.-Y. Li, P.-J. Wan, Y. Wang, O. Frieder, Sparse power efficient topology for wireless networks, in: Proc. of the 35th Annual Hawaii Intl. Conference on System Sciences (HICSS), 38393848., 2002

[57]

V. Rodoplu, T.H. Meng, Minimum energy mobile wireless networks, IEEE J. Sel. Areas Commun., 17 (1999) 1333-1344.

Digital Library

[58]

N.E. Flick, On Correctness of Graph Programs Relative to Recursively Nested Conditions, in: Proc. of the Intl. Workshop on Graph Computation Models, 97112, URL http://ceur-ws.org/Vol-1403/paper8.pdf, 2015.

[59]

T. Fischer, J. Niere, L. Torunski, A. Zndorf, Story Diagrams: A New Graph Rewrite Language based on the Unified Modeling Language, in: Proc. of the Intl. Workshop on Theory and Application of Graph Transformation, Springer, 296309., 1998

[60]

E.W. Dijkstra, E.W. Dijkstra, E.W. Dijkstra, E.W. Dijkstra, A discipline of programming, vol. 1, Prentice- Hall, Englewood Cliffs, 1976.

[61]

B. Richerzhagen, D. Stingl, J. Rckert, R. Steinmetz, Simonstrator: Simulation and Prototyping Platform for Distributed Mobile Applications, in: Proc. of the Intl. Conf. on Simulation Tools and Techniques, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 99108., 2015

Digital Library

[62]

S. Kurkowski, T. Camp, M. Colagrosso, MANET simulation studies:the incredibles, SIGMOBILE Mob. Comput. Commun. Rev., 9 (2005) 50-61.

[63]

D. Hiranandani, K. Obraczka, J.J. Garcia-Luna-Aceves, MANET protocol simulations considered harmful:the case for benchmarking, IEEE Wirel. Commun., 20 (2013) 82-90.

[64]

D. Stingl, C. Gross, J. Rckert, L. Nobach, A. Kovacevic, R. Steinmetz, PeerfactSim.KOM: A simulation framework for peer-to-peer systems, in: Proceedings of the2011 Intl. Conf. on High Performance Computing and Simulation (HPCS),IEEE, 577584., 2011

[65]

D. Steinberg, F. Budinsky, E. Merks, M. Paternostro, EMF: Eclipse Modeling Framework, Addison-Wesley, Boston, 2008.

Digital Library

[66]

H. Zimmermann, OSI reference model-the ISO model of architecture for open systems interconnection, IEEE Trans. Commun., 28 (1980) 425-432.

[67]

T. Camp, J. Boleng, V. Davies, A survey of mobility models for ad hoc network research, Wirel. Commun. Mob. Comput., 2 (2002) 483-502.

[68]

G. Kulcsr, M. Stein, I. Schweizer, G. Varr, M. Mhlhuser, A. Schrr, Rapid Prototyping of Topology Control Algorithms by Graph Transformation, in: Proc. of the Intl. Workshop on Graph-Based Tools (GraBaTs), vol. 68, 115., 2014

[69]

J. Yick, B. Mukherjee, D. Ghosal, Wireless sensor network survey, Comput. Netw., 52 (2008) 2292-2330.

Digital Library

[70]

P.V. Gorp, S. Mazanek, SHARE: a web portal for creating and sharing executable research papers, Procedia Computer Science 4 (2011) 589597., in: Proc. of the Intl. Conf. on Computational Science

[71]

I. Schweizer, R. Zimmermann, M. Stein, a-kTC: Integrating Topology Control Into the Stack, in: Proc. of LCN 2015, 414417, 2015.

Digital Library

[72]

G. Ramalingam, T. Reps, A Categorized Bibliography on Incremental Computation, in: Proc. of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1993, pp. 502510.

[73]

M. Stein, G. Kulcsr, I. Schweizer, G. Varr, A. Schrr, M. Mhlhuser, Topology Control with Application Constraints, in: Proceedings of the Local Computer Networks Conf. (LCN), 438441., 2015

[74]

A. Habel, H. Radke, Expressiveness of graph conditions with variables, ECEASST 30.

[75]

H. Radke, Weakest Liberal Preconditions relative to HR Graph Conditions, in: Proc. of the Workshop on Graph Computation Models, ISSN 0929-0672, 165178, 2010.

[76]

G. Taentzer, A. Rensink, Ensuring Structural Constraints in Graph-Based Models with Type Inheritance, in: Fundamental Approaches to Software Engineering, vol. 3442, Springer, 2005, pp. 6479.

[77]

L. Jia, R. Rajaraman, C. Scheideler, On Local Algorithms for Topology Control and Routing in Ad Hoc Networks, in: Proc. of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, 220229., 2003

[78]

F. Hermann, S. Gottmann, N. Nachtigall, B. Braatz, G. Morelli, A. Pierre, T. Engel, On an Automated Translation of Satellite Procedures Using Triple Graph Grammars, in: Proc. of the Intl. Conference on Model Transformation 2013, Springer, 2013, pp. 5051.

[79]

J. Warmer, A. Kleppe, The Object Constraint Language: Precise Modeling with UML, Addison-Wesley,1999.

[80]

T.D. Cook, D.T. Campbell, A. Day, Houghton Mifflin, Boston, US, 1979.

[81]

A. Rensink, A. Schmidt, D. Varr, Model Checking Graph Transformations: A Comparison of Two Approaches, in: Graph Transformations, vol. 3256, Springer, 2004, pp. 226241.

[82]

K. McMillan, Symbolic Model Checking, in: Verification of Digital and Hybrid Systems, vol. 170, Springer,2000, pp. 117137.

[83]

A. Basu, B. Bensalem, M. Bozga, J. Combaz, M. Jaber, T.-H. Nguyen, J. Sifakis, Rigorous component-based system design using the BIP framework, IEEE Softw., 28 (2011) 41-48.

Digital Library

[84]

D. Potop-Butucaru, B. Caillaud, Correct-by-Construction Asynchronous Implementation of Modular SynchronousSpecifications, Proc. of the Intl. Conf. on Application of Concurrency to System Design (2005) 4857, URL:10.1109/ACSD.2005.10.

[85]

M. Baleani, A. Ferrari, L. Mangeruca, A. Sangiovanni-Vincentelli, U. Freund, E. Schlenker, H.-J. Wolff, Correct-by-construction transformations across design environments for model-based embedded software development, in: Proc. of the Design, Automation and Test in Europe, 2005, vol. 2, 10441049., 2005

[86]

H. Radke, HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas, ECEASST 61.

[87]

J.H. Hausmann, R. Heckel, S. Sauer, Extended Model Relations with Graphical Consistency Conditions, in: Proc. of the UML 2002 Workshop on Consistency Problems in UML-based Software Development, 6174, 2002.

[88]

J. Warmer, A. Kleppe, The Object Constraint Language: Getting Your Models Ready for MDA, Addison-Wesley Longman Publishing Co., Inc., 2 edn., Boston, US, 2003.

[89]

P. Bottoni, M. Koch, F. Parisi-Presicce, G. Taentzer, A Visualization of OCL Using Collaborations, in: UML 2001 The Unified Modeling Language. Modeling Languages, Concepts, and Tools, Springer, 2001, pp. 257271.

[90]

H. Radke, T. Arendt, J.S. Becker, A. Habel, G. Taentzer, Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations, in: Proc. of the Intl. Conference on Graph Transformation, vol. 9151, Springer, 2015, pp. 155170.

[91]

G. Bergmann, Translating OCL to Graph Patterns, in: Proc. of the MODELS 2014, Springer, 670686., 2014

[92]

F. Klein, H. Giese, Joint Structural and Temporal Property Specification Using Timed Story Scenario Diagrams, in: Proc. of the 10th Intl. Conference of Fundamental Approaches to Software Engineering (FASE), Springer, 2007, pp. 185199.

[93]

G. Bochmann, C.A. Sunshine, Formal methods in communication protocol design, IEEE Trans. Commun., 28 (1980) 624-631.

[94]

T. Lu, S. Merz, C. Weidenbach, Towards Verification of the Pastry Protocol Using TLA+, in: Proc. of the Intl. Conf. on Formal Techniques for Distributed Systems, Springer, 244258., 2011

[95]

P. Hfner, A. McIver, Statistical Model Checking of Wireless Mesh Routing Protocols, in: NASA Formal Methods, vol. 7871, Springer, 322336., 2013

[96]

G.J. Holzmann, Addison-Wesley Reading, Boston, US, 2004.

[97]

D. Jackson, Alloy:a lightweight object modelling notation, ACM Trans. Softw. Eng. Methodol., 11 (2002) 256-290.

Digital Library

[98]

I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, in: Proc. of the 2001 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, ACM, 149160., 2001

Digital Library

[99]

M. Katelman, J. Meseguer, J. Hou, Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking, in: Formal Methods for Open Object-Based Distributed Systems, vol. 5051, Springer, 150169., 2008

[100]

A. Nareyek, Ensuring the Satisfaction of Structural Constraints, in: Constraint-Based Agents, vol. 2062, Springer, 2001, pp. 151163.

[101]

G. Taentzer, M. Goedicke, T. Meyer, Dynamic change management by distributed graph transformation: Towards configurable distributed systems, in: Theory and Application of Graph Transformations, Springer, 179193., 2000

[102]

B. Genest, A. Muscholl, D. Peled, Message Sequence Charts, in: Lectures on Concurrency and Petri Nets, vol. 3098, Springer, 537558., 2004

[103]

B. Selic, G. Gullekson, P. Ward, Real-time Object Oriented Modeling and Design, J. Wiley & Sons, New York, 1994.

[104]

P. Cox, F. Giles, T. Pietrzykowski, Prograph: a step towards liberating programming from textual conditioning, in: Proc. of the IEEE Workshop on Visual Languages, 150156., 1989

[105]

K. Miyamoto, Y. Harada, DVispatch: a visual language with distributed rewriting, in: Proc. of the IEEE Symposium of Visual Languages, 152159., 1998

[106]

R. David, H. Alla, Petri nets for modeling of dynamic systems, Automatica, 30 (1994) 175-202.

[107]

H. Kastenberg, A. Kleppe, A. Rensink, Defining Object-Oriented Execution Semantics Using Graph Transformations, in: Formal Methods for Open Object-Based Distributed Systems, vol. 4037, Springer, 186201., 2006

[108]

L. Berardinelli, A. Di Marco, S. Pace, L. Pomante, W. Tiberti, Energy Consumption Analysis and Design of Energy-Aware WSN Agents in fUML, in: Modelling Foundations and Applications, vol. 9153, Springer, 2015, pp. 117.

[109]

J. Eker, J. Janneck, E. Lee, J. Liu, X. Liu, J. Ludvig, S. Neuendorffer, S. Sachs, Y. Xiong, Taming heterogeneity - the ptolemy approach, Proc.IEEE, 91 (2003) 127-144.

[110]

M. Al Saad, E. Fehr, N. Kamenzky, J. Schiller, ScatterClipse: A Model-Driven Tool-Chain for Developing, Testing, and Prototyping Wireless Sensor Networks, in: Proc. of the Intl. Symposium on Parallel and Distributed Processing with Applications., 871885., 2008

Digital Library

[111]

J. Schiller, A. Liers, H. Ritter, R. Winter, T. Voigt, ScatterWeb Low Power Sensor Nodes and Energy Aware Routing, in: Proc. of the Intl. Conf. on System Sciences, 2005., 286294., 2005

[112]

O.M. Group, Model Driven Architecture (MDA): The MDA Guide Rev 2.0, OMG, URL http://www.omg.org/cgi-bin/doc?ormsc/14-06-01, 2014.

[113]

P. Levis, D. Culler, Mat: A Tiny Virtual Machine for Sensor Networks, in: Proc. of the 10th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, ACM, 8595., 2002

[114]

S. Burmester, H. Giese, M. Hirsch, D. Schilling, M. Tichy, The Fujaba Real-time Tool Suite: Model-driven Development of Safety-critical, Real-time Systems, in: Proc. of the ICSE, ACM, 670671., 2005

[115]

B. Becker, D. Beyer, H. Giese, F. Klein, D. Schilling, Symbolic Invariant Verification for Systems with Dynamic Structural Adaptation, in: Proc. of ICSE, ACM, 7281., 2006

[116]

A. Richa, C. Scheideler, P. Stevens, Self-Stabilizing De Bruijn Networks, in: Stabilization, Safety, and Security of Distributed Systems, vol. 6976, Springer, 2011, pp. 416430.

[117]

C. Avin, B. Haeupler, Z. Lotker, C. Scheideler, S. Schmid, Locally Self-Adjusting Tree Networks, in: Proc. of the Int. Symposium on Parallel Distributed Processing (IPDPS 2013), 395406., 2013

[118]

R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Tubig, SKIP+:a self-stabilizing skip graph, J. ACM, 61 (2014) 36:1-36:26.

Digital Library

[119]

A. Dunkels, B. Gronvall, T. Voigt, Contiki A Lightweight and Flexible Operating System for Tiny Networked Sensors, in: Proc. of the Int. Conf. on Local Computer Network, 455462., 2004

Cited By

Tomaszek SSpeith RSchürr A(2021)Virtual network embedding: ensuring correctness and optimality by construction using model transformation and integer linear programming techniquesSoftware and Systems Modeling (SoSyM)10.1007/s10270-020-00852-z20:4(1299-1332)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10270-020-00852-z
Kluge RStein MVarró GSchürr AHollick MMühlhäuser M(2019)A systematic approach to constructing families of incremental topology control algorithms using graph transformationSoftware and Systems Modeling (SoSyM)10.1007/s10270-017-0587-818:1(279-319)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10270-017-0587-8
Weckesser MKluge RPfannemüller MMatthé MSchürr ABecker C(2018)Optimal reconfiguration of dynamic software product lines based on performance-influence modelsProceedings of the 22nd International Systems and Software Product Line Conference - Volume 110.1145/3233027.3233030(98-109)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3233027.3233030
Show More Cited By

Recommendations

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

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 ...
A Methodology for Designing Dynamic Topology Control Algorithms via Graph Transformation
Proceedings of the 8th International Conference on Theory and Practice of Model Transformations - Volume 9152

This paper presents a constructive, model-driven methodology for designing dynamic topology control algorithms. The proposed methodology characterizes valid and high quality topologies with declarative graph constraints and formulates topology control ...
Topology Control for Time-Evolving and Predictable Delay-Tolerant Networks
MASS '11: Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems

In delay tolerant networks (DTNs), the lack of continuous connectivity, network partitioning, and long delays make design of network protocols very challenging. Previous DTN research mainly focuses on routing and information propagation. However, with ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Visual Languages and Computing

Journal of Visual Languages and Computing Volume 38, Issue C

February 2017

106 pages

ISSN:1045-926X

Issue’s Table of Contents

Copyright © Elsevier Ltd.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 February 2017

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tomaszek SSpeith RSchürr A(2021)Virtual network embedding: ensuring correctness and optimality by construction using model transformation and integer linear programming techniquesSoftware and Systems Modeling (SoSyM)10.1007/s10270-020-00852-z20:4(1299-1332)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10270-020-00852-z
Kluge RStein MVarró GSchürr AHollick MMühlhäuser M(2019)A systematic approach to constructing families of incremental topology control algorithms using graph transformationSoftware and Systems Modeling (SoSyM)10.1007/s10270-017-0587-818:1(279-319)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10270-017-0587-8
Weckesser MKluge RPfannemüller MMatthé MSchürr ABecker C(2018)Optimal reconfiguration of dynamic software product lines based on performance-influence modelsProceedings of the 22nd International Systems and Software Product Line Conference - Volume 110.1145/3233027.3233030(98-109)Online publication date: 10-Sep-2018
https://dl.acm.org/doi/10.1145/3233027.3233030
Kulcsár GCorradini ALochau M(2018)Equivalence and Independence in Controlled Graph-Rewriting ProcessesGraph Transformation10.1007/978-3-319-92991-0_9(134-151)Online publication date: 25-Jun-2018
https://dl.acm.org/doi/10.1007/978-3-319-92991-0_9

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents