Abstract
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 algorithms as graph transformation systems. Afterwards, a well-known static analysis technique is used to enrich graph transformation rules with application conditions derived from the graph constraints to ensure that this improved approach always produces topologies that (i) are optimized wrt. to a domain-specific criterion, and (ii) additionally fulfill all the graph constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Such events occur, e.g., when nodes move and join or leave the network.
- 2.
The inactivation rule \(\mathsf{\small R}_{\mathsf{inact}}\) is deliberately unreachable and only shown for completeness.
- 3.
The example in Sect. 3 contains a discussion why certain preconditions may be violated.
- 4.
If both links are active, the claim follows trivially. If both links are inactive, the argument applies for each link individually.
- 5.
References
Beydeda, S., Book, M., Gruhn, V.: Model-Driven Software Development, 15th edn. Springer, Heidelberg (2005)
Deckwerth, F., Varró, G.: Generating preconditions from graph constraints by higher order graph transformation. ECEASST 67, 1–14 (2014)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006)
Fischer, T., Niere, J., Torunski, L., Zündorf, A.: Story diagrams: a new graph rewrite language based on the unified modeling language and java. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 296–309. Springer, Heidelberg (2000)
Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3/4), 287–313 (1996)
Hausmann, J.H., Heckel, R., Sauer, S.: Extended model relations with graphical consistency conditions. In: Proceedings of the UML 2002 Workshop on Consistency Problems in UML-based Software Development, pp. 61–74 (2002)
Heckel, R., Wagner, A.: Ensuring consistency of conditional graph rewriting - a constructive approach. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop. ENTCS, vol. 2, pp. 118–126. Elsevier (1995)
Jacob, R., Richa, A., Scheideler, C., Schmid, S., Täubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, pp. 131–140. ACM (2009)
Katelman, M., Meseguer, J., Hou, J.: Redesign of the LMST wireless sensor protocol through formal modeling and statistical model checking. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol. 5051, pp. 150–169. Springer, Heidelberg (2008)
Koch, M., Mancini, L.V., Parisi-Presicce, F.: A graph-based formalism for RBAC. ACM Trans. Inf. Syst. Secur. 5(3), 332–365 (2002)
Kulcsár, G., Stein, M., Schweizer, I., Varró, G., Mühlhäuser, M., Schürr, A.: Rapid prototyping of topology control algorithms by graph transformation. In: Proceedings of the 8th International Workshop on Graph-Based Tools. ECEASST, vol. 68 (2014)
Rensink, A., Schmidt, A., Varró, D.: Model checking graph transformations: a comparison of two approaches. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 226–241. Springer, Heidelberg (2004)
Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, River Edge (1997)
Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Comput. Surv. (CSUR) 37(2), 164–194 (2005)
Schweizer, I., Wagner, M., Bradler, D., Mühlhäuser, M., Strufe, T.: kTC - Robust and adaptive wireless ad-hoc topology control. In: Proceedings of the 21st International Conference on Computer Communications and Networks (2012)
Taentzer, G., Goedicke, M., Meyer, T.: Dynamic change management by distributed graph transformation: towards configurable distributed systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 179–193. Springer, Heidelberg (2000)
Völter, M., Stahl, T., Bettin, J., Haase, A., Helsen, S.: Model-Driven Software Development: Technology, Engineering, Management. John Wiley & Sons, Hoboken (2013)
Zave, P.: Using lightweight modeling to understand chord. SIGCOMM Comput. Commun. Rev. 42(2), 49–57 (2012)
Acknowledgment
This work has been funded by the German Research Foundation (DFG) within the Collaborative Research Center (CRC) 1053 – MAKI. The authors would like to thank Matthias Hollick (subprojects A03 and C01) for his valuable input.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kluge, R., Varró, G., Schürr, A. (2015). A Methodology for Designing Dynamic Topology Control Algorithms via Graph Transformation. In: Kolovos, D., Wimmer, M. (eds) Theory and Practice of Model Transformations. ICMT 2015. Lecture Notes in Computer Science(), vol 9152. Springer, Cham. https://doi.org/10.1007/978-3-319-21155-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-21155-8_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21154-1
Online ISBN: 978-3-319-21155-8
eBook Packages: Computer ScienceComputer Science (R0)