{"title":"Key management infrastructure design and novel techniques to establish secure communications in critical infrastructures","authors":"C. PramodT., N. Sunitha","doi":"10.1504/IJCCBS.2017.10005916","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10005916","url":null,"abstract":"The industrial automation and control systems (IACS) play a vital role in critical infrastructures to optimise the processes and control the activities remotely. As the proliferation of deliberate security attacks on these systems is increasing, ensuring reliable operations of these systems with safety and security is prominent. The key management infrastructure (KMI) ensures the proper management of secret keys and cryptographic keying materials which are used to secure the system. From IACS perspective, this paper addresses the security issues, challenges and parameters that need to be considered for designing an effective KMI for IACS. Also, by considering the constraints and required key management features, an efficient KMI is proposed for supervisory control and data acquisition (SCADA) systems using the polynomial key establishment scheme. The objective of the proposed KMI for SCADA systems is to support broadcasting, multicasting, join and leave, key update and pairwise communications between the SCADA devices. Comparison of the proposed scheme with existing schemes is reported.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"32 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131750995","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}
Moustapha Bikienga, Annie Choquet-Geniet, D. Geniet
{"title":"Validation of the actual behaviour of a real-time application","authors":"Moustapha Bikienga, Annie Choquet-Geniet, D. Geniet","doi":"10.1504/IJCCBS.2017.10005917","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10005917","url":null,"abstract":"Classically, the temporal validation of a hard real-time application is performed using the WCET's, for instance by means of simulation. But since the actual behaviour of the application uses the ACET's which may be shorter than the WCET's, the simulated and the effective behaviours may be different. Verifying whether an application behaves in accordance to a given scheduling strategy requires to precisely specify how the application is expected to behave in the case of ACET's shorter than the WCET's. For that aim, we define two notions of compliance. The non-flexible compliance imposes the strict respect of the start times given by the simulated schedule, whereas the flexible one tolerates a higher level of conservatism. We then discuss the advantages of each, and show that using any of them preserves the validity of the behaviour of the application.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128301999","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}
{"title":"A layered Petri net model to formally analyse time critical web service composition","authors":"F. Latreche, F. Belala","doi":"10.1504/IJCCBS.2017.10005898","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.10005898","url":null,"abstract":"Analysing flexible, open and time constrained systems like web services is of critical importance. In this work, we propose Timed Mop-ECATNets, a layered Petri net model that makes possible analysis of flexible web services while taking time and data type aspects into account. The proposed model is defined in term of the concurrent semantics of real time rewrite theories. Analysis of the model is carried out using the real time Maude TCTL model checker, instantaneous rewrite rules axiomatise instantaneous behaviour and timed rewrite rules axiomatise the timed behaviour.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125537988","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}
{"title":"Analysing reward measures of LARES performability models by discontinuous Markov chains","authors":"A. Gouberman, Martin Riedl, M. Siegle","doi":"10.1504/IJCCBS.2017.084062","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.084062","url":null,"abstract":"This paper presents a new method for specifying and analysing Markovian performability models. An extension of the LARES modelling language is considered which offers both delayed and immediate transitions, as well as rate and impulse rewards on whose basis different types of reward measures can be defined. The paper describes the evaluation path, starting from the modular and hierarchical LARES description and leading via a flat labelled transition system to the underlying stochastic model. The latter is a continuous-time Markov chain with fast transitions which, by taking the limit of the fast transition rates, can be interpreted as a CTMC with stochastic discontinuities. Finally, by continuisation of impulse rewards and an aggregation process, a standard Markov reward model is obtained.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922107","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}
{"title":"Modelling and performance analysis of video and voice streams in the IEEE 802.11e-EDCA WLANs with TXOP bursting under fading channel","authors":"M. Yazid, L. Bouallouche-Medjkoune, D. Aïssani","doi":"10.1504/IJCCBS.2017.084064","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.084064","url":null,"abstract":"Performance evaluation of the IEEE 802.11e network has been the subject of several research papers. Especially, the transmission opportunity limit (TXOPLimit) has been proven efficient for achieving differentiated quality of service (QoS) and improving the wireless bandwidth utilisation. However, most existing analytical models have been developed under unrealistic assumption that the wireless channel is error-free. Hence, the efficiency and the performance level of the TXOPLimit in an error-prone channel are questionable. In this paper, we aim at proposing a new Markov chain model of the IEEE 802.11e network including the TXOPLimit and the packet error rate (PER). Then, we derive the saturation throughput of the IEEE 802.11e network in cases of aggregated and non-aggregated packets. The obtained results show that, the TXOPLimit efficiency is highly degraded under the effect of bit error rate (BER) and packet length.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129033032","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}
{"title":"Formal approach based on petri nets using agent paradigm for m-maintenance","authors":"Khadija Abid, L. Mouss, O. Kazar, L. Kahloul","doi":"10.1504/IJCCBS.2017.084066","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.084066","url":null,"abstract":"The long use of a system in a manufacturing environment causes its degradation, thus the maintenance activity is required in this environment to keep and to improve the efficiency of the system. The new development in networking technologies enhances maintenance strategies and gives birth to remote maintenance (tele-maintenance, e-maintenance, m-maintenance). This maintenance makes information available anywhere/anytime and provides maintenance-personnel with the necessary information at the suitable time. This new type of maintenance reduces the maintenance costs and solves the problem of the unavailability of experts. Mobile agent as a rich design concept brings many facilities in the development of m-maintenance, however few works are elaborated in this stage. The objective of this work is both: 1) the proposition of a based mobile multi-agent architecture dedicated for m-maintenance in manufacturing systems; 2) the exploitation of high level petri nets in the specification, simulation and verification phases of the architecture development.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125636058","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}
{"title":"On the dependability evaluation of a virtual multiple input multiple output link","authors":"M. Escheikh, Kamel Barkaoui","doi":"10.1504/IJCCBS.2017.084063","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.084063","url":null,"abstract":"Cooperative diversity or virtual antenna arrays (VAA) enables transmission range extension and provides robustness enhancements in wireless multi-hop relay networks, when compared with relaying non-cooperative diversity-based schemes. Moreover redundant spare nodes willing to cooperate when used in a virtual multiple input multiple output (VMIMO) scheme allow better dependability and lead to a more efficient transmission that is of particular interest in mobile environment. This talk addresses a model-based probabilistic approach for dependability assessment of a VMIMO link. More precisely, we show how through Markov models, we can evaluate availability and survivability measures of a VMIMO link. We show through extensive numerical computations how instantaneous availability (A(t)) decreases for different failure rates and how the steady state availability (As) behaves with respect to the number of redundant spare nodes. Also we illustrate how node failure rates affect VMIMO link survivability metrics, i.e., excess loss due to failure (ELF) and excess delay due to failure (EDF). Finally we highlight reliability metrics related to VMIMO link [i.e., reliability (R(t)), mean time to failure (MTTF) and mean time to repair (MTTR)] and we show how they behave with respect to node failure and repair rates.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"10 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130482982","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}
{"title":"Modelling and analysis data fragmentation in IEEE 802.15.4 slotted CSMA/CA protocol without ACK mode","authors":"Mouloud Atmani, D. Aïssani, Y. H. Aoul","doi":"10.1504/IJCCBS.2017.084061","DOIUrl":"https://doi.org/10.1504/IJCCBS.2017.084061","url":null,"abstract":"The low-rate wireless personal area networks (WPANs), as wireless sensor networks (WSNs), suffer from many constraints. The IEEE 802.15.4 standard proposes the slotted CSMA/CA as a communication channel access mechanism with collision avoidance that take into account the constraints of WPANs. In this paper, we propose to introduce a data fragmentation mechanism into slotted CSMA/CA to improve a bandwidth utilisation. The novelty, in this paper, is the use of the fragmentation mechanism to replace an acknowledgement frame after the transmission of the fragment and the remaining frame. The beacon frame is used to confirme the success transmission of a data fragment. To evaluate the performances of our proposition, we have developped a three dimension Markov chain which modelises the behaviour of the node using IEEE 802.15.4 with data fragmentation mechanism without using an ACK frame. The analytical results of the network throughput and the transmission success delay demonstrate the improvement of the bandwidth occupation.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611517","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}
{"title":"On trustworthy measurements when testing dependable systems: a discussion and experiences","authors":"A. Ceccarelli, A. Bondavalli","doi":"10.1504/IJCCBS.2015.073543","DOIUrl":"https://doi.org/10.1504/IJCCBS.2015.073543","url":null,"abstract":"The scientific literature and the industrial practice agree since many years on the fundamental role of experimental evaluation testing of critical systems for the assessment of the dependability attributes, and consequently on the relevance of achieving trustworthy measurements. This paper discusses and motivates with the support of three case studies, the possible role of the body of knowledge offered by measurement theory metrology to quantitatively assess the quality of measuring instruments, i.e., the tools, and the results collected. The paper first introduces notions of metrology and contextualises them for the dependability evaluation of systems. Successively it presents three case studies developed by the authors where attention to principles from measurement theory and the metrological assessment of tools and results are carried out. The paper ultimately reviews the main guidelines identified discussing their application in the case studies.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133379621","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}
{"title":"An energy efficient management scheme for wireless sensor networks","authors":"M. Asim, H. Mokhtar, Muhammad Zahid Khan","doi":"10.1504/IJCCBS.2015.073541","DOIUrl":"https://doi.org/10.1504/IJCCBS.2015.073541","url":null,"abstract":"Since nodes in a sensor network have limited energy, prolonging the network life time and improve its scalability become important. Hierarchical clustering models are known to be a promising solution to tackle scalability issues in an energy efficient way. However, existing hierarchical clustering schemes offer various limitations. For example, existing clustering schemes consume large amounts of energy in cluster formation and re-formation. To address this issue, we present a cellular architecture to create a control hierarchical structure for wireless sensor networks. In the proposed architecture, nodes cooperate to form clusters by grouping cells at each level of network hierarchy, ensuring maximal energy coverage and minimal energy expenditure with relatively uniform distribution of load within the network. We evaluate the performance by simulation. The results obtained from the simulation show that our clustering architecture is more energy efficient and achieves better energy consumption distribution than existing methods.","PeriodicalId":210749,"journal":{"name":"Int. J. Crit. Comput. Based Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128834321","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}