{"title":"基于马尔可夫的嵌入式系统异常校正","authors":"Roghayeh Mojarad, H. Zarandi","doi":"10.7763/IJCTE.2016.V8.1057","DOIUrl":null,"url":null,"abstract":"In this paper, an anomaly correction method is proposed which is based on Markov anomaly detection method. The proposed method employs the probability of transitions between events to evaluate the behavior of a system. This method consists of three steps: 1) Construction of transition matrix by probability of transitions between events and list of known events are generated in training phase; 2) Detection of anomaly based on Markov detection method will be done. In test data when the probability of transition previous event to current event does not reach a predefined threshold, an anomaly is detected. Threshold is determined based on constructed transition matrix in step 1; 3) Check the defined constraints for each anomalous event to find source of anomaly and the suitable way to correct the anomalous event. Next, an event with the highest compliance with the constraints is selected. Evaluation of the proposed method is done using a total of 7000 data sets. The operational scope of corrector and the number of injected anomalies varied between 3 and 5, 1 and 7, respectively. The simulation experiments have been done to measure the correction coverage rate which is between 53.5% and 97.2% with average of 77.66%. For evaluation of hardware consumptions of the proposed method, this method is implemented by VHDL. Power, area and time consumptions are on average 87.43 w, 415.48 m, and 4.12ns, respectively.","PeriodicalId":306280,"journal":{"name":"International Journal of Computer Theory and Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Markov-Based Anomaly Correction in Embedded Systems\",\"authors\":\"Roghayeh Mojarad, H. Zarandi\",\"doi\":\"10.7763/IJCTE.2016.V8.1057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an anomaly correction method is proposed which is based on Markov anomaly detection method. The proposed method employs the probability of transitions between events to evaluate the behavior of a system. This method consists of three steps: 1) Construction of transition matrix by probability of transitions between events and list of known events are generated in training phase; 2) Detection of anomaly based on Markov detection method will be done. In test data when the probability of transition previous event to current event does not reach a predefined threshold, an anomaly is detected. Threshold is determined based on constructed transition matrix in step 1; 3) Check the defined constraints for each anomalous event to find source of anomaly and the suitable way to correct the anomalous event. Next, an event with the highest compliance with the constraints is selected. Evaluation of the proposed method is done using a total of 7000 data sets. The operational scope of corrector and the number of injected anomalies varied between 3 and 5, 1 and 7, respectively. The simulation experiments have been done to measure the correction coverage rate which is between 53.5% and 97.2% with average of 77.66%. For evaluation of hardware consumptions of the proposed method, this method is implemented by VHDL. Power, area and time consumptions are on average 87.43 w, 415.48 m, and 4.12ns, respectively.\",\"PeriodicalId\":306280,\"journal\":{\"name\":\"International Journal of Computer Theory and Engineering\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Theory and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7763/IJCTE.2016.V8.1057\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Theory and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7763/IJCTE.2016.V8.1057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Markov-Based Anomaly Correction in Embedded Systems
In this paper, an anomaly correction method is proposed which is based on Markov anomaly detection method. The proposed method employs the probability of transitions between events to evaluate the behavior of a system. This method consists of three steps: 1) Construction of transition matrix by probability of transitions between events and list of known events are generated in training phase; 2) Detection of anomaly based on Markov detection method will be done. In test data when the probability of transition previous event to current event does not reach a predefined threshold, an anomaly is detected. Threshold is determined based on constructed transition matrix in step 1; 3) Check the defined constraints for each anomalous event to find source of anomaly and the suitable way to correct the anomalous event. Next, an event with the highest compliance with the constraints is selected. Evaluation of the proposed method is done using a total of 7000 data sets. The operational scope of corrector and the number of injected anomalies varied between 3 and 5, 1 and 7, respectively. The simulation experiments have been done to measure the correction coverage rate which is between 53.5% and 97.2% with average of 77.66%. For evaluation of hardware consumptions of the proposed method, this method is implemented by VHDL. Power, area and time consumptions are on average 87.43 w, 415.48 m, and 4.12ns, respectively.