Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869338
Islam T. Almalkawi, J. Raed, Nawaf Alghaeb, Manel Guerrero Zapata
Most of the security algorithms proposed for the sensor networks such as secure routing, data encryption and authentication, and intrusion detection target protecting the content of the collected data from being exposed to different types of attacks. However, the context of the collected data, such as event occurrence, event time, and event location, is not addressed by these security mechanisms and can still be leaked to the adversaries. Therefore, we propose in this paper a novel and efficient unobservability scheme for source/sink location privacy for wireless multimedia sensor networks. The proposed privacy scheme is based on a cross-layer design between the application and routing layers in order to exploit the multimedia processing technique with multipath routing to hide the event occurrences and locations of important nodes without degrading the network performance. Simulation analysis shows that our proposed scheme satisfies the privacy requirements and has better performance compared to other existing techniques.
{"title":"An Efficient Location Privacy Scheme for Wireless Multimedia Sensor Networks","authors":"Islam T. Almalkawi, J. Raed, Nawaf Alghaeb, Manel Guerrero Zapata","doi":"10.1109/ETFA.2019.8869338","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869338","url":null,"abstract":"Most of the security algorithms proposed for the sensor networks such as secure routing, data encryption and authentication, and intrusion detection target protecting the content of the collected data from being exposed to different types of attacks. However, the context of the collected data, such as event occurrence, event time, and event location, is not addressed by these security mechanisms and can still be leaked to the adversaries. Therefore, we propose in this paper a novel and efficient unobservability scheme for source/sink location privacy for wireless multimedia sensor networks. The proposed privacy scheme is based on a cross-layer design between the application and routing layers in order to exploit the multimedia processing technique with multipath routing to hide the event occurrences and locations of important nodes without degrading the network performance. Simulation analysis shows that our proposed scheme satisfies the privacy requirements and has better performance compared to other existing techniques.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"56 1","pages":"1615-1618"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72795287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869075
Khaled Al-Gumaei, Arthur Müller, Jan Nicolas Weskamp, Claudio Santo Longo, Florian Pethig, Stefan Windmann
Manufacturing industry is facing major challenges to meet customer requirements, which are constantly changing. Therefore, products have to be manufactured with efficient processes, minimal interruptions, and low resource consumptions. To achieve this goal, huge amounts of data generated by industrial equipment needs to be managed and analyzed by modern technologies. Since the big data era in manufacturing industry is still at an early stage, there is a need for a reference architecture that incorporates big data and machine learning technologies and aligns with the Industrie 4.0 standards and requirements. In this paper, requirements for designing a scalable analytics platform for industrial data are derived from Industrie 4.0 standards and literature. Based on these requirements, a reference big data architecture for industrial machine learning applications is proposed and compared to related works. Finally, the proposed architecture has been implemented in the Lab Big Data at the SmartFactoryOWL and its scalability and performance have been evaluated on parallel computation of an industrial PCA model. The results show that the proposed architecture is linearly scalable and adaptable to machine learning use cases and will help to improve the industrial automation processes in production systems.
{"title":"Scalable Analytics Platform for Machine Learning in Smart Production Systems","authors":"Khaled Al-Gumaei, Arthur Müller, Jan Nicolas Weskamp, Claudio Santo Longo, Florian Pethig, Stefan Windmann","doi":"10.1109/ETFA.2019.8869075","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869075","url":null,"abstract":"Manufacturing industry is facing major challenges to meet customer requirements, which are constantly changing. Therefore, products have to be manufactured with efficient processes, minimal interruptions, and low resource consumptions. To achieve this goal, huge amounts of data generated by industrial equipment needs to be managed and analyzed by modern technologies. Since the big data era in manufacturing industry is still at an early stage, there is a need for a reference architecture that incorporates big data and machine learning technologies and aligns with the Industrie 4.0 standards and requirements. In this paper, requirements for designing a scalable analytics platform for industrial data are derived from Industrie 4.0 standards and literature. Based on these requirements, a reference big data architecture for industrial machine learning applications is proposed and compared to related works. Finally, the proposed architecture has been implemented in the Lab Big Data at the SmartFactoryOWL and its scalability and performance have been evaluated on parallel computation of an industrial PCA model. The results show that the proposed architecture is linearly scalable and adaptable to machine learning use cases and will help to improve the industrial automation processes in production systems.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"84 1","pages":"1155-1162"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83869469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869326
Simin Cai, B. Gallina, Dag Nyström, C. Seceleanu
Many industrial control systems manage critical data using Database Management Systems (DBMS). The correctness of transactions, especially their atomicity, isolation and temporal correctness, is essential for the dependability of the entire system. Existing methods and techniques, however, either lack the ability to analyze the interplay of these properties, or do not scale well for systems with large amounts of transactions and data, and complex transaction management mechanisms. In this paper, we propose to analyze large scale real-time database systems using statistical model checking. We propose a pattern-based framework, by extending our previous work, to model the real-time DBMS as a network of stochastic timed automata, which can be analyzed by UPPAAL Statistical Model Checker. We present an industrial case study, in which we design a collision avoidance system for multiple autonomous construction vehicles, via concurrency control of a real-time DBMS. The desired properties of the designed system are analyzed using our proposed framework.
{"title":"Statistical Model Checking for Real-Time Database Management Systems: A Case Study","authors":"Simin Cai, B. Gallina, Dag Nyström, C. Seceleanu","doi":"10.1109/ETFA.2019.8869326","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869326","url":null,"abstract":"Many industrial control systems manage critical data using Database Management Systems (DBMS). The correctness of transactions, especially their atomicity, isolation and temporal correctness, is essential for the dependability of the entire system. Existing methods and techniques, however, either lack the ability to analyze the interplay of these properties, or do not scale well for systems with large amounts of transactions and data, and complex transaction management mechanisms. In this paper, we propose to analyze large scale real-time database systems using statistical model checking. We propose a pattern-based framework, by extending our previous work, to model the real-time DBMS as a network of stochastic timed automata, which can be analyzed by UPPAAL Statistical Model Checker. We present an industrial case study, in which we design a collision avoidance system for multiple autonomous construction vehicles, via concurrency control of a real-time DBMS. The desired properties of the designed system are analyzed using our proposed framework.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"34 1","pages":"306-313"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82788320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8868995
Tarik Terzimehic, Andreas Bayha, K. Dorofeev
An asset administration shell (AAS), as a key concept of the Industry 4.0, provides a machine-accessible interface to any kind of asset. An application implementing the devices functionality should be able to interact with different AASs.In this work, we specify the function blocks (FBs) for accessing properties and invoking operations of AASs. We analyzed the nature and requirements of such FBs while focusing on REST/HTTP- and OPC UA-based AASs and provided IEC 61499-based implementation.The results obtained in this paper will ease interaction with the complex AAS structure from the low-level devices.
{"title":"Function Blocks for the Interaction with the Asset Administration Shell","authors":"Tarik Terzimehic, Andreas Bayha, K. Dorofeev","doi":"10.1109/ETFA.2019.8868995","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8868995","url":null,"abstract":"An asset administration shell (AAS), as a key concept of the Industry 4.0, provides a machine-accessible interface to any kind of asset. An application implementing the devices functionality should be able to interact with different AASs.In this work, we specify the function blocks (FBs) for accessing properties and invoking operations of AASs. We analyzed the nature and requirements of such FBs while focusing on REST/HTTP- and OPC UA-based AASs and provided IEC 61499-based implementation.The results obtained in this paper will ease interaction with the complex AAS structure from the low-level devices.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"44 50","pages":"1235-1238"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91468632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869071
Lukas Kathrein, Kristof Meixner, D. Winkler, A. Lüder, S. Biffl
In discrete manufacturing, basic and detail engineering workgroups need to collaborate to design highly automated cyber-physical production systems. Product/ion-awareness describes views and requirements coming from product and production process design, which are relevant to engineer production resources. These requirements imply strong dependencies between the product, the production process, and production resources (PPR). The Formal Process Description (FPD) provides basic concepts for modeling PPR knowledge, which support discrete manufacturing to some extent. In this paper, we introduce a meta-model that describes the structure of the FPD including a set of proposed extensions, focusing on expressing consistency dependencies on PPR relations, as a foundation for making design decisions traceable in the engineering process. In addition, the meta-model provides a clear description of how to model parallel or alternative process flows, a common use case in discrete manufacturing. The meta-model provides stakeholders with a clear description of the PPR modeling language (PPR-ML) and a rule set to check the validity of a model
{"title":"A Meta-Model for Representing Consistency as Extension to the Formal Process Description","authors":"Lukas Kathrein, Kristof Meixner, D. Winkler, A. Lüder, S. Biffl","doi":"10.1109/ETFA.2019.8869071","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869071","url":null,"abstract":"In discrete manufacturing, basic and detail engineering workgroups need to collaborate to design highly automated cyber-physical production systems. Product/ion-awareness describes views and requirements coming from product and production process design, which are relevant to engineer production resources. These requirements imply strong dependencies between the product, the production process, and production resources (PPR). The Formal Process Description (FPD) provides basic concepts for modeling PPR knowledge, which support discrete manufacturing to some extent. In this paper, we introduce a meta-model that describes the structure of the FPD including a set of proposed extensions, focusing on expressing consistency dependencies on PPR relations, as a foundation for making design decisions traceable in the engineering process. In addition, the meta-model provides a clear description of how to model parallel or alternative process flows, a common use case in discrete manufacturing. The meta-model provides stakeholders with a clear description of the PPR modeling language (PPR-ML) and a rule set to check the validity of a model","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"5 1","pages":"1653-1656"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90232245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869488
Xiaoling Zhang, Menghao Li, K. Mei, Lu Ding
The emergence of a large number of video data puts forward higher requirements on traditional video transmission technology. The new streaming media technology based on HTTP dynamic adaptive streaming DASH transmission protocol has become an important research direction of video services. How to overcome the unstable characteristics of wireless links in a limited bandwidth, achieve high-quality intelligent transmission of video, and obtain optimal user quality of experience (QoE), has become an urgent problem to be solved. This paper abandons the traditional streaming media adaptive transmission method, and combines neural network and particle swarm optimization algorithm to design a new intelligent transmission scheme. The particle swarm optimization algorithm obtains the optimal transmission parameters of QoE, and the model established by neural network predicts the optimal one. The system sets parameters to ensure video service quality under limited bandwidth and large network fluctuations in the wireless network.
{"title":"Adaptive Frame Rate Optimization Based on Particle Swarm and Neural Network for Industrial Video Stream","authors":"Xiaoling Zhang, Menghao Li, K. Mei, Lu Ding","doi":"10.1109/ETFA.2019.8869488","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869488","url":null,"abstract":"The emergence of a large number of video data puts forward higher requirements on traditional video transmission technology. The new streaming media technology based on HTTP dynamic adaptive streaming DASH transmission protocol has become an important research direction of video services. How to overcome the unstable characteristics of wireless links in a limited bandwidth, achieve high-quality intelligent transmission of video, and obtain optimal user quality of experience (QoE), has become an urgent problem to be solved. This paper abandons the traditional streaming media adaptive transmission method, and combines neural network and particle swarm optimization algorithm to design a new intelligent transmission scheme. The particle swarm optimization algorithm obtains the optimal transmission parameters of QoE, and the model established by neural network predicts the optimal one. The system sets parameters to ensure video service quality under limited bandwidth and large network fluctuations in the wireless network.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"12 1","pages":"1111-1118"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88864186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869114
V. Mironovich, M. Buzdalov, V. Vyatkin
Search-based software engineering aims to apply different search-based techniques to software engineering problems. Automation of software development is one such problem. In this paper we evaluate the permutation-based individual encoding for automatic reconstruction of measurement connections in a closed-loop control system using evolutionary algorithm and model checking. Using the permutation-based encoding greatly increases the difficulty of the considered problem, but makes it much closer to the real world scenarios. The results show that even the simple (1+1) evolutionary algorithm can successfully solve the realistic optimization problem with large search space size, although it struggles to find the optimal solution within reasonable time on the hardest problem instance.
{"title":"Permutation Encoding for Automatic Reconstruction of Connections in Closed-Loop Control System using Evolutionary Algorithm","authors":"V. Mironovich, M. Buzdalov, V. Vyatkin","doi":"10.1109/ETFA.2019.8869114","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869114","url":null,"abstract":"Search-based software engineering aims to apply different search-based techniques to software engineering problems. Automation of software development is one such problem. In this paper we evaluate the permutation-based individual encoding for automatic reconstruction of measurement connections in a closed-loop control system using evolutionary algorithm and model checking. Using the permutation-based encoding greatly increases the difficulty of the considered problem, but makes it much closer to the real world scenarios. The results show that even the simple (1+1) evolutionary algorithm can successfully solve the realistic optimization problem with large search space size, although it struggles to find the optimal solution within reasonable time on the hardest problem instance.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"5 1","pages":"1265-1268"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80696203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869449
B. Pfeiffer, M. Oppelt, C. Leingang
A digital twin is composed of many software elements that are already state of the art. New perspectives are opened by the integration of individual models and simulation tools to a holistic, semantically integrated system, integrated across different hierarchy levels of the plant, and integrated along all phases of plant lifecycle. The application example of a steam cracker shows which parts of this vision can be implemented now already.
{"title":"Evolution of a Digital Twin for a Steam Cracker","authors":"B. Pfeiffer, M. Oppelt, C. Leingang","doi":"10.1109/ETFA.2019.8869449","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869449","url":null,"abstract":"A digital twin is composed of many software elements that are already state of the art. New perspectives are opened by the integration of individual models and simulation tools to a holistic, semantically integrated system, integrated across different hierarchy levels of the plant, and integrated along all phases of plant lifecycle. The application example of a steam cracker shows which parts of this vision can be implemented now already.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"21 1","pages":"467-474"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88751262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/ETFA.2019.8869175
Luiz Fernando Puttow Southier, Muriel Mazzetto, Dalcimar Casanova, Marco A. C. Barbosa, L. Barbosa, Marcelo Teixeira
Although Finite-State Automata (FSA) have been successfully used in modeling and control of Discrete Event Systems (DESs), they are limited to represent complex and advanced features of DESs, such as context recognition and switching. The literature has suggested that a FSA can nevertheless be enriched with parameters properly collected from the modeled system, so that this favors design and control. A parameter can be embedded either on transitions or states. However, each approach is structured within a specific framework, so that their comparison and integration are not straightforward and they may lead to different control solutions, modeled, computed and implemented using distinct strategies. In this paper, we show how to combine advantages from parameters in modeling and control of DESs. Each approach is structured and their advantages are identified and exemplified. Then, we propose a conversion method that allows to translate a design-friendly model into a synthesis-efficient structure. Examples illustrate the approach.
{"title":"Combining Advantages from Parameters in Modeling and Control of Discrete Event Systems","authors":"Luiz Fernando Puttow Southier, Muriel Mazzetto, Dalcimar Casanova, Marco A. C. Barbosa, L. Barbosa, Marcelo Teixeira","doi":"10.1109/ETFA.2019.8869175","DOIUrl":"https://doi.org/10.1109/ETFA.2019.8869175","url":null,"abstract":"Although Finite-State Automata (FSA) have been successfully used in modeling and control of Discrete Event Systems (DESs), they are limited to represent complex and advanced features of DESs, such as context recognition and switching. The literature has suggested that a FSA can nevertheless be enriched with parameters properly collected from the modeled system, so that this favors design and control. A parameter can be embedded either on transitions or states. However, each approach is structured within a specific framework, so that their comparison and integration are not straightforward and they may lead to different control solutions, modeled, computed and implemented using distinct strategies. In this paper, we show how to combine advantages from parameters in modeling and control of DESs. Each approach is structured and their advantages are identified and exemplified. Then, we propose a conversion method that allows to translate a design-friendly model into a synthesis-efficient structure. Examples illustrate the approach.","PeriodicalId":6682,"journal":{"name":"2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"3 1","pages":"370-377"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80618352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：