Pub Date : 2018-12-01DOI: 10.1109/ICSEE.2018.8646107
E. Manor, S. Greenberg
This paper presents a novel model-based hardware/software co-design methodology applied to heterogeneous embedded platforms. A time-predictable hardware and software co-design architecture design is proposed. The proposed technique is based on floating point operations analysis and is intended to be applied for real-time applications at an early stage of the design, to assist the designer taking the right considerations in choosing the most effective Hardware/Software partitioning. The design analysis is carried out on the MATLAB model of the application, and is demonstrated for a specific voice activation algorithm. A Data Flow Graph (DFG) representation is used to represent the various operational blocks of the chosen algorithm. An efficient decomposition of the design operational blocks into a fixed software processor and alternative extensible hardware components is carefully carried out to find the correct balance between flexibility and performance with respect to power consumption and size, and the demands related to time predictability. Experimental results demonstrate that the proposed algorithm performs a significant area saving factor of 39% and power consumption reduction of 19%, while applied to voice activation module within the same system constraints.
{"title":"Efficient Hardware/Software partitioning for Heterogeneous Embedded Systems","authors":"E. Manor, S. Greenberg","doi":"10.1109/ICSEE.2018.8646107","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646107","url":null,"abstract":"This paper presents a novel model-based hardware/software co-design methodology applied to heterogeneous embedded platforms. A time-predictable hardware and software co-design architecture design is proposed. The proposed technique is based on floating point operations analysis and is intended to be applied for real-time applications at an early stage of the design, to assist the designer taking the right considerations in choosing the most effective Hardware/Software partitioning. The design analysis is carried out on the MATLAB model of the application, and is demonstrated for a specific voice activation algorithm. A Data Flow Graph (DFG) representation is used to represent the various operational blocks of the chosen algorithm. An efficient decomposition of the design operational blocks into a fixed software processor and alternative extensible hardware components is carefully carried out to find the correct balance between flexibility and performance with respect to power consumption and size, and the demands related to time predictability. Experimental results demonstrate that the proposed algorithm performs a significant area saving factor of 39% and power consumption reduction of 19%, while applied to voice activation module within the same system constraints.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522762","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646189
Yaron Laufer, S. Gannot
In this paper, the problem of speech dereverberation in a noiseless scenario is addressed in a hierarchical Bayesian framework. Our probabilistic approach relies on a Gaussian model for the early speech signal combined with a multichannel Gaussian model for the relative early transfer function (RETF). The late reverberation is modelled as a Gaussian additive interference, and the speech and reverberation precisions are modelled with Gamma distribution. We derive a variational Expectation-Maximization (VEM) algorithm which uses a variant of the multichannel Wiener filter (MCWF) to infer the early speech component while suppressing the late reverberation. The proposed algorithm was evaluated using real room impulse responses (RIRs) recorded in our acoustic lab with a reverberation time set to 0.36 s and 0.61 s. It is shown that a significant improvement is obtained with respect to the reverberant signal, and that the proposed algorithm outperforms a baseline algorithm. In terms of channel alignment, a superior channel estimate is demonstrated.
{"title":"A Bayesian Hierarchical Model for Speech Dereverberation","authors":"Yaron Laufer, S. Gannot","doi":"10.1109/ICSEE.2018.8646189","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646189","url":null,"abstract":"In this paper, the problem of speech dereverberation in a noiseless scenario is addressed in a hierarchical Bayesian framework. Our probabilistic approach relies on a Gaussian model for the early speech signal combined with a multichannel Gaussian model for the relative early transfer function (RETF). The late reverberation is modelled as a Gaussian additive interference, and the speech and reverberation precisions are modelled with Gamma distribution. We derive a variational Expectation-Maximization (VEM) algorithm which uses a variant of the multichannel Wiener filter (MCWF) to infer the early speech component while suppressing the late reverberation. The proposed algorithm was evaluated using real room impulse responses (RIRs) recorded in our acoustic lab with a reverberation time set to 0.36 s and 0.61 s. It is shown that a significant improvement is obtained with respect to the reverberant signal, and that the proposed algorithm outperforms a baseline algorithm. In terms of channel alignment, a superior channel estimate is demonstrated.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131405115","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646302
Oded Yechiel, G. Israeli, H. Guterman
Developing a control system, that brings a plant to a desired state in finite time, can be a tedious task. In traditional control theory, one must first analytically analyze the plant, take into consideration the uncertainties and finally construct a controller that keeps the plant stable and meet certain design requirements. For many plants, designing a controller is extremely challenging, and existing control theory and practice are unable to cope with the uncertainty and complexity of the plant. Modern control systems are increasingly trying to address the problem of designing controllers using adaptive methods and machine learning techniques, and in fact, classical adaptive control theory has shown marvelous strength when applied to uncertain plants. Indeed, adaptive machine learning techniques such as, adaptive fuzzy logic control, neural networks, reinforcement learning, and, evolutionary algorithms have been an asset in the control system community when applied in practice. These machine learning techniques are able to cope with the uncertainties and nonlinearities of plants. In this paper, a method for developing a direct adaptive control system to tune the gains of a PID controller to control a vehicle’s speed is investigated. This method does not use any a-priori knowledge about the plant. The control system is a two stage process: identification and controller generation. The identification is performed using a neural network, that learns the behavior of the plant and, once trained, allows to run virtual simulation on different controllers. After the neural network is trained, an evolutionary algorithm is used to generate a wide population of controllers, and evaluate the performance of each controller. The evolutionary algorithm runs several generations to achieve good performing controllers. Preliminary results of this approach are shown as a method to generate a speed control for a vehicle in a physics simulation.
{"title":"Direct Adaptive Control Using a Neuro-evolutionary Algorithm for Vehicle Speed Control","authors":"Oded Yechiel, G. Israeli, H. Guterman","doi":"10.1109/ICSEE.2018.8646302","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646302","url":null,"abstract":"Developing a control system, that brings a plant to a desired state in finite time, can be a tedious task. In traditional control theory, one must first analytically analyze the plant, take into consideration the uncertainties and finally construct a controller that keeps the plant stable and meet certain design requirements. For many plants, designing a controller is extremely challenging, and existing control theory and practice are unable to cope with the uncertainty and complexity of the plant. Modern control systems are increasingly trying to address the problem of designing controllers using adaptive methods and machine learning techniques, and in fact, classical adaptive control theory has shown marvelous strength when applied to uncertain plants. Indeed, adaptive machine learning techniques such as, adaptive fuzzy logic control, neural networks, reinforcement learning, and, evolutionary algorithms have been an asset in the control system community when applied in practice. These machine learning techniques are able to cope with the uncertainties and nonlinearities of plants. In this paper, a method for developing a direct adaptive control system to tune the gains of a PID controller to control a vehicle’s speed is investigated. This method does not use any a-priori knowledge about the plant. The control system is a two stage process: identification and controller generation. The identification is performed using a neural network, that learns the behavior of the plant and, once trained, allows to run virtual simulation on different controllers. After the neural network is trained, an evolutionary algorithm is used to generate a wide population of controllers, and evaluate the performance of each controller. The evolutionary algorithm runs several generations to achieve good performing controllers. Preliminary results of this approach are shown as a method to generate a speed control for a vehicle in a physics simulation.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132705950","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646196
Refael Avez, S. Weiss
With the significant increase of wireless standards in recent years, reconfigurable programmable architectures have started to attract more attention and interest. One of the solutions that has gained more industry-popularity is the Application Specific Instruction-Set (ASIP) Processor, which provides an innovative approach for obtaining flexibility with relatively small increases in area and power. In this article we will present the development of an optimized ASIP that is tailored to the needs of detecting packets based on the 802.11 standard, and uses a retargetable compilation flow. We will present several optimizations that can be used to optimize both the algorithm and the processor model. These enhancements increase the performance by a factor of 20 and decrease significantly the power consumption relative to a 16bit general purpose processor model. While the proposed configurable ASIP was applied to multiple packet detection standards based on OFDM or DSSS modulations such as 802.11a/g/n and 802.11b/1997 respectively, it was verified on an ODFM 802.11a/g/n system. Most of our analysis focuses on OFDM systems, however, it also applies to DSSS systems. In addition, we present a comparison between the proposed ASIP and a dedicated hardware solution over ASIC in terms of performance power and area.
近年来，随着无线标准的显著增加，可重构可编程架构开始引起越来越多的关注和兴趣。应用特定指令集(Application Specific Instruction-Set, ASIP)处理器是在业界获得更多知名度的解决方案之一，它提供了一种创新的方法，可以在相对较小的面积和功耗增加的情况下获得灵活性。在本文中，我们将介绍一个优化的ASIP的开发，该ASIP是针对基于802.11标准检测数据包的需求量身定制的，并使用可重新定位的编译流。我们将介绍几个可用于优化算法和处理器模型的优化。与16位通用处理器模型相比，这些增强功能将性能提高了20倍，并显著降低了功耗。提出的可配置ASIP分别应用于基于OFDM或DSSS调制的多种分组检测标准，如802.11a/g/n和802.11b/1997，并在ODFM 802.11a/g/n系统上进行了验证。我们的大部分分析都集中在OFDM系统上，然而，它也适用于DSSS系统。此外，我们在性能、功耗和面积方面比较了所提出的ASIP和专用硬件解决方案。
{"title":"A Reconfigurable ASIP for 802.11 Packet Detection Algorithm","authors":"Refael Avez, S. Weiss","doi":"10.1109/ICSEE.2018.8646196","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646196","url":null,"abstract":"With the significant increase of wireless standards in recent years, reconfigurable programmable architectures have started to attract more attention and interest. One of the solutions that has gained more industry-popularity is the Application Specific Instruction-Set (ASIP) Processor, which provides an innovative approach for obtaining flexibility with relatively small increases in area and power. In this article we will present the development of an optimized ASIP that is tailored to the needs of detecting packets based on the 802.11 standard, and uses a retargetable compilation flow. We will present several optimizations that can be used to optimize both the algorithm and the processor model. These enhancements increase the performance by a factor of 20 and decrease significantly the power consumption relative to a 16bit general purpose processor model. While the proposed configurable ASIP was applied to multiple packet detection standards based on OFDM or DSSS modulations such as 802.11a/g/n and 802.11b/1997 respectively, it was verified on an ODFM 802.11a/g/n system. Most of our analysis focuses on OFDM systems, however, it also applies to DSSS systems. In addition, we present a comparison between the proposed ASIP and a dedicated hardware solution over ASIC in terms of performance power and area.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439309","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646216
Robert Graczyk, A. Lapidoth
A source generates a random sequence that is then described to a controller who wishes to employ feedback control on a given finite-state system in order for its output to closely resemble the sequence. The tension between the best achievable expected fidelity and the description length is studied in the asymptotic regime where the length of the sequence tends to infinity, with the description rate held fixed. The solution is the source-coding dual of coding for channels with states.
{"title":"Coding for Noncausal Tracking","authors":"Robert Graczyk, A. Lapidoth","doi":"10.1109/ICSEE.2018.8646216","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646216","url":null,"abstract":"A source generates a random sequence that is then described to a controller who wishes to employ feedback control on a given finite-state system in order for its output to closely resemble the sequence. The tension between the best achievable expected fidelity and the description length is studied in the asymptotic regime where the length of the sequence tends to infinity, with the description rate held fixed. The solution is the source-coding dual of coding for channels with states.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134158218","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646222
I. Levie, G. Slepyan
we present a model of a one-dimensional chain of two-level artificial atoms driven simultaneously with a dc field and a quantum light in the strong coupling regime. It is shown that the entanglement of the electron and photon (dressing of the atoms with light) dramatically changes the scenario of the Bloch oscillations (BO) compared with standard solution of the Bloch-Zener model. We considered the mutual influence of dressing and BO and show that the quantum properties of light become controllable via an adiabatic dc field tuning. The obtained results open new ways in quantum state engineering, nano-photonic spectroscopy and nano-antennas.
{"title":"Bloch Oscillations of Electrons Dressed with Photons: Theory and Potential Applications in Nanoelectronics","authors":"I. Levie, G. Slepyan","doi":"10.1109/ICSEE.2018.8646222","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646222","url":null,"abstract":"we present a model of a one-dimensional chain of two-level artificial atoms driven simultaneously with a dc field and a quantum light in the strong coupling regime. It is shown that the entanglement of the electron and photon (dressing of the atoms with light) dramatically changes the scenario of the Bloch oscillations (BO) compared with standard solution of the Bloch-Zener model. We considered the mutual influence of dressing and BO and show that the quantum properties of light become controllable via an adiabatic dc field tuning. The obtained results open new ways in quantum state engineering, nano-photonic spectroscopy and nano-antennas.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132279311","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646014
Uri Lipowezky, Boris Korenfeld, I. Ideses
Same day last-mile parcels delivery services are recently gaining a great deal of attention in the transportation science community. In the Tel Aviv metropolitan area, smart mobility companies provide delivery services for small parcels using scooter fleets. Scooter couriers deliver the parcels from the local post offices to the final customers. Since a scooter has a limited capacity and is paid with respect to the total travelling distance, the problem can be formulated as a Capacitated Open Vehicle Routing Problem (COVRP). The proposed approach is based on the high sparseness of the Clarke-Wright (CW) saving matrix for COVRP in case of parcels delivery from post offices. In this case the CW algorithm can be separated to construction of all feasible Hamiltonian paths at the first phase and its optimal combination by solving maximal weight clique problem (MWCP) at the second phase. Computational results show that the proposed algorithm is competitive, improves known benchmark results on some instances and saves 40–80% of delivery cost in the Tel Aviv metropolitan area.
{"title":"Solving the Capacitated Open Vehicle Routing Problem Algorithm, Based on Probability Distribution Modelling of Saving Matrix","authors":"Uri Lipowezky, Boris Korenfeld, I. Ideses","doi":"10.1109/ICSEE.2018.8646014","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646014","url":null,"abstract":"Same day last-mile parcels delivery services are recently gaining a great deal of attention in the transportation science community. In the Tel Aviv metropolitan area, smart mobility companies provide delivery services for small parcels using scooter fleets. Scooter couriers deliver the parcels from the local post offices to the final customers. Since a scooter has a limited capacity and is paid with respect to the total travelling distance, the problem can be formulated as a Capacitated Open Vehicle Routing Problem (COVRP). The proposed approach is based on the high sparseness of the Clarke-Wright (CW) saving matrix for COVRP in case of parcels delivery from post offices. In this case the CW algorithm can be separated to construction of all feasible Hamiltonian paths at the first phase and its optimal combination by solving maximal weight clique problem (MWCP) at the second phase. Computational results show that the proposed algorithm is competitive, improves known benchmark results on some instances and saves 40–80% of delivery cost in the Tel Aviv metropolitan area.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133083229","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646231
Mattan Serry, David Sriker, Avi Caciularu, R. Machlev, Y. Beck, D. Raz
Nonintrusive load monitoring (NILM) algorithms may suggest different approaches for solving the NILM problem: the disintegrating of total power consumption to the discrete appliances comprising it. All of these algorithms incorporate some cost function to discriminate between the possible options at each sample time. For the estimation process of such algorithms, and the selection of the most likely possibility, we propose a new formulation of a family of cost functions, on the set of the possible assertions per each appliance. The proposed design, abbreviated ARPM (Additive, Retentive Penalty Method), emphasizes two major properties that were discovered to be significant when performing real-time estimation in a NILM system. The first is a granular calculation of Hamming distances between possibilities, and the second is the processing of the changes in the measured power consumption, rather than the consumption value itself. This design consists of a low number of free parameters, and can be integrated additively and seamlessly with existing cost functions already embedded in NILM systems. It had been evaluated with a series of experiments and proven to enhance the success rate by all measured criteria and on various datasets, with no parameter adjustments.
{"title":"ARPM: Additive, Retentive Penalty Method for Multidimensional NILM Algorithms","authors":"Mattan Serry, David Sriker, Avi Caciularu, R. Machlev, Y. Beck, D. Raz","doi":"10.1109/ICSEE.2018.8646231","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646231","url":null,"abstract":"Nonintrusive load monitoring (NILM) algorithms may suggest different approaches for solving the NILM problem: the disintegrating of total power consumption to the discrete appliances comprising it. All of these algorithms incorporate some cost function to discriminate between the possible options at each sample time. For the estimation process of such algorithms, and the selection of the most likely possibility, we propose a new formulation of a family of cost functions, on the set of the possible assertions per each appliance. The proposed design, abbreviated ARPM (Additive, Retentive Penalty Method), emphasizes two major properties that were discovered to be significant when performing real-time estimation in a NILM system. The first is a granular calculation of Hamming distances between possibilities, and the second is the processing of the changes in the measured power consumption, rather than the consumption value itself. This design consists of a low number of free parameters, and can be integrated additively and seamlessly with existing cost functions already embedded in NILM systems. It had been evaluated with a series of experiments and proven to enhance the success rate by all measured criteria and on various datasets, with no parameter adjustments.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115133117","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646221
Y. Mogilevsky, M. Mellincovsky
This paper presents the basic concepts regarding active power filters. An active filter generates a compensating signal that mitigates the harmonics, thus improving the power quality of the grid. Some of the most recent applications of these filters in several fields of electrical engineering are depicted. And a practical example is shown.
{"title":"Active Power Filter Applications: State of the Art","authors":"Y. Mogilevsky, M. Mellincovsky","doi":"10.1109/ICSEE.2018.8646221","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646221","url":null,"abstract":"This paper presents the basic concepts regarding active power filters. An active filter generates a compensating signal that mitigates the harmonics, thus improving the power quality of the grid. Some of the most recent applications of these filters in several fields of electrical engineering are depicted. And a practical example is shown.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121274485","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 : 2018-12-01DOI: 10.1109/ICSEE.2018.8646074
O. Shalom, Amir Leshem, A. Scaglione, A. Nedić
This paper describes a distributed statistical estimation problem, corresponding to a network of agents. The network may be vulnerable to data injection attacks, in which the attackers’ main goal is to steer the network’s final state to a state of their choice. We show that the detection metric of the straightforward attack scheme proposed by Wu et. at in [1], is vulnerable to a more sophisticated attack. To overcome this attack we propose a novel metric that can be computed locally by each agent to detect the presence of an attacker in the network, as well as a metric that localizes the attackers in the network. We conclude the paper with simulations supporting our findings.
{"title":"Detection of Data Injection Attacks on Decentralized Statistical Estimation","authors":"O. Shalom, Amir Leshem, A. Scaglione, A. Nedić","doi":"10.1109/ICSEE.2018.8646074","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646074","url":null,"abstract":"This paper describes a distributed statistical estimation problem, corresponding to a network of agents. The network may be vulnerable to data injection attacks, in which the attackers’ main goal is to steer the network’s final state to a state of their choice. We show that the detection metric of the straightforward attack scheme proposed by Wu et. at in [1], is vulnerable to a more sophisticated attack. To overcome this attack we propose a novel metric that can be computed locally by each agent to detect the presence of an attacker in the network, as well as a metric that localizes the attackers in the network. We conclude the paper with simulations supporting our findings.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505940","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
扫码关注我们
求助内容：
应助结果提醒方式：