Telemaco: a language oriented tool for graph-based models layout optimization

• Autorzy: Iacono M. , Marrone S.
• Języki publikacji: EN

Abstrakty

EN

Progress of ICT is shifting the paradigm of systems organization towards a distributed approach, in which physical deployment of components influences the evaluation of systems properties. This contribution can be considered as a problem of graph layout optimization, well-known in literature where several approaches have been exploited in different application fields with different solving techniques. Then again, complex systems can be only studied by means of different formalisms which codification is the aim of language engineering. Telemaco is a tool that supports a novel approach for the application of graph layout optimizations to heterogeneous models, based on the OsMoSys framework and on the language engineering principles. It can cope with different graph-based formalisms by exploiting either their core graph nature or their different specialized features by means of language hierarchies. In this paper Telemaco is introduced together with its foundations and an example of application to Wireless Sensor Networks (WSN) deployment.

Słowa kluczowe

EN

graph optimization; modelling language; wireless sensor networks; WSN deployment

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2013
• Tom: nr 4
• Strony: 41--50
• Opis fizyczny: Bibliogr. 35 poz., rys.

Twórcy

autor

Iacono M.

• Dipartimento di Scienze Politiche, Seconda Universit`a degli Studi di Napoli, Viale Ellittico, 31, 81100 Caserta, Italy

autor

Marrone S.

• Dipartimento di Scienze Politiche, Seconda Universit`a degli Studi di Napoli, Viale Ellittico, 31, 81100 Caserta, Italy

Bibliografia

• [1] P. A. Eades, “A heuristic for graph drawing”, Congres. Numeran., vol. 42, pp. 149–160, 1984.
• [2] T. Kamada and S. Kawai, “An algorithm for drawing general undirected graphs”, Inform. Proces. Lett., vol. 31, pp. 7–15, 1989.
• [3] T. M. J. Fruchterman and E. M. Reingold, “Graph drawing by forcedirected placement”, Software – Pract. and Exper., vol. 21, no. 11 , pp. 1129–1164, 1991.
• [4] A. Kumar and R. H. Fowler, “A spring modelling algorithm to position nodes of an undirected graph in three dimensions”, Tech. rep., Department of Computer Science, University of Texas, 1994.
• [5] R. Davidson and D. Harel, “Drawing graphs nicely using simulated annealing”, ACM Trans. Graph., vol. 15, no. 4, pp. 301–331, 1996.
• [6] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing”, Science, vol. 220, no. 4598, pp. 671–680, 1983.
• [7] M. K. Coleman and D. Stott Parker, “Aesthetics-based graph layout for human consumption”, Softw. Pract. Exper., vol. 26, no. 12, pp. 1415–1438, 1996.
• [8] T. Eloranta and E. Makinen, “TimGA – A genetic algorithm for drawing undirected graphs”, Tech. rep., Department of Computer Science, University of Tampere, Finland, 1996.
• [9] J. Branke, F. Bucher, and H. Schmeck, “A genetic algorithm for drawing undirected graphs”, in Proc. 3rd Nordic Worksh. Genet. Algorith. Appl. 3NWGA, Helsinki, Finland, 1997, pp. 193–206.
• [10] D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA, USA: Addison-Wesley, 1989.
• [11] J. R. Koza, “Survey of genetic algorithms and genetic programming”, in Proc. Western Electron. Show Convent. Conf. WESCON 1995, San Francisco, CA, USA, 1995, pp. 589–594.
• [12] M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA, USA: MIT Press, 1996.
• [13] S. Kent, “Model driven engineering”, in Proceedings of IFM 2002 – Third International Conference on Integrated Formal Methods, M. Butler, L. Petre, and K. Sere, Eds. LNCS, vol. 2335. Springer, 2002.
• [14] S. J. Mellor, K. Scott, A. Uhl, and D. Weise, MDA Distilled. Prin- ciples of Model Driven Architecture. Boston, MA, USA: Addison- Wesley, 2004.
• [15] J. B´ezivin, F. Jouault, and D. Touzet, “Principles, standards and tools for model engineering”, in Proc. 10th Int. Conf. Engin. Complex Comp. Syst. ICECCS 2005, Shanghai, China, 2005, pp. 28–29.
• [16] S. Sendall, R. Hauser, J. Koehler, J. K¨uster, and M. Wahler, “Understanding model transformation by classification and formalization”, in Proc. 3rd Int. Conf. Gener. Program. Component Engin. GPCE’04, Vancouver, Canada, 2004.
• [17] E. Visser, “A survey of rewriting strategies in program transformation systems”, Electr. Notes in Theor. Comp. Sci., vol. 57, pp. 109–143, 2001.
• [18] K. Czarnecki and S. Helsen, “Classification of model transformation approaches”, in Proc. 2nd Worksh. Generat. Techniq. Context of Model-Driven Architec. OOPSLA 2003, Anaheim, CA, USA, 2003, pp. 1–17.
• [19] D. Akehurst and S. Kent, “A relational approach to defining transformations in a metamodel”, in Proc. 5th Int. Conf. Unif. Model. Lang. UML’02, Dresden, Germany, 2002, pp. 243–258.
• [20] F. Jouault and I. Kurtev, “On the architectural alignment of ATL and QVT”, in Proc. ACM Symp. Appl. Comput. SAC’06, Dijon, France, 2006, pp. 1188–1195.
• [21] G. Csertan et al., “VIATRA – visual automated transformations for formal verification and validation of uml models”, in Proc. 17th IEEE Int. Conf. Automa. Softw. Engin. ASE 2002, Edinburgh, Scotland, UK, 2002, pp. 267–270.
• [22] A. Agrawal, “Great: A metamodel based model transformation language”, in Proc. 18th IEEE Int. Conf. Autom. Softw. Engin., Montreal, Canada, 2003.
• [23] I. Kurtev, J. Bezivin, and M. Aksit, “Technological spaces: An initial appraisal”, in Proc. CoopIS, DOA’2002 Federated Conferences, Industrial track, Irvine, CA, USA, 2002, pp. 1–6.
• [24] E. Barbierato, M. Gribaudo, and M. Iacono, Defining Formalisms for Performance Evaluation With SIMTHESys. Electr. Notes Theor. Comput. Sci., vol. 275, pp. 37–51, 2011.
• [25] E. Barbierato et al., “Exploiting product form solution techniques in multiformalism modeling”, Electr. Notes Theor. Comput. Sci., vol. 296, pp. 61–77, 2012.
• [26] M. Iacono, E. Barbierato, and M. Gribaudo, “The SIMTHESys multiformalism modeling framework”, Comp. and Mathem. with Appl., vol. 64, no. 12, pp. 3828–3839, 2012.
• [27] G. Di Lorenzo et al., “The software architecture of the OsMoSys multisolution framework”, in Proc 2nd Int. Conf. Perform. Eval. Methodol. Tools ValueTools 2007, Nantes, France, 2007, p. 51.
• [28] G. Franceschinis, M. Iacono, N. Mazzocca, and V. Vittorini, “The OsMoSys approach to multi-formalism modeling of systems”, J. Softw. Syst. Model. , vol. 3, no. 1, pp. 68–81, 2004.
• [29] A. Sobeih, W. P. Chen, J. C. Hou, L. C. Kung, N. Li, H. Lim, H. Y. Tyan, and H. Zhang, “J-Sim: A simulation and emulation environment for wireless sensor networks”, IEEE Wirel. Commun., vol. 13, no. 4, pp. 104–119, 2006.
• [30] M. Li and B. Yang, “A survey on topology issues in wireless sensor network”, in Proc. Int. Conf. Wirel. Netw. ICWN 2006, Las Vegas, NE, USA, 2006, pp. 503–509.
• [31] M. Iacono, S. Marrone, and E. Romano, “Adaptive monitoring of marine disasters with intelligent mobile sensor networks”, in Proc. IEEE Worksh. Environm. Energy, Struct. Monit. Syst. Taranto, Italy, 2010, pp. 38–45.
• [32] M. D’Arienzo, M. Iacono, S. Marrone, and R. Nardone, “Estimation of the energy consumption of mobile sensors in WSN environmental monitoring applications”, in Proc. 27th Int. Conf. Adva. Inform. Netw. Appl. Worksh. WAINA ’13, Barcelona, Spain, 2013, pp. 1588–1593.
• [33] M. D’Arienzo, M. Iacono, S. Marrone, and R. Nardone, “Petri net based evaluation of energy consumption in wireless sensor nodes”, J. High Speed Netw. (to appear).
• [34] E. Battista et al., “An integrated lifetime and network quality model of large WSNS”, in Proc. 2nd IEEE Int. Worksh. Measur. Netw., Naples, Italy, 2013.
• [35] D. B. Jourdan and O. L. de Weck, “Multi-objective genetic algorithm for the automated planning of a wireless sensor network to monitor a critical facility”, in Proc. SPIE Defense Secur. Symp., Orlando, FL, USA, 2004, vol. 5403, pp. 565–575.