Pub Date : 2018-12-01DOI: 10.1109/ICSEE.2018.8646005
Ofir Krengel, Eli Appleboim, Yehoshua Y.Zeevi
Inpainting of images, represented on surfaces, was previously considered successfully by the application of a two-dimensional Laplacian operator, including in the context of the discrete representation on surfaces. Considering the shortcoming of errors and computational complexity of the strictly-two-dimensional approaches, we propose a one-dimensional-based multi-line approach, wherein the set of lines cover the region of inpainting and its boundaries. The multi-line framework is implemented on smooth and non-smooth surfaces and on images and the results are found to be superior to the previously published results. Additional possible one-dimensional representations are discussed.
{"title":"Inpainting of surfaces and Images","authors":"Ofir Krengel, Eli Appleboim, Yehoshua Y.Zeevi","doi":"10.1109/ICSEE.2018.8646005","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646005","url":null,"abstract":"Inpainting of images, represented on surfaces, was previously considered successfully by the application of a two-dimensional Laplacian operator, including in the context of the discrete representation on surfaces. Considering the shortcoming of errors and computational complexity of the strictly-two-dimensional approaches, we propose a one-dimensional-based multi-line approach, wherein the set of lines cover the region of inpainting and its boundaries. The multi-line framework is implemented on smooth and non-smooth surfaces and on images and the results are found to be superior to the previously published results. Additional possible one-dimensional representations are discussed.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"1 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":"129218707","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.8646046
Y. Levi, Ayal Taitler, I. Keslassy
In this paper, we consider the practical problem of scheduling traffic lights to reduce the average vehicle waiting times. We find that existing scheduling algorithms have lackluster performance. Instead, we introduce two algorithms. First, extended CMSM (eCMSM), which extends CMSM from a switch scheduling model to a general traffic-light scheduling model. We prove that eCMSM can optimally schedule any traffic batch. Second, we introduce Front-Pressure (FP), which aims to further reduce the average waiting time at general intersections. We then evaluate empirically these two algorithms. We find that when using them, the best average waiting time can be improved in 98% of the simulations when compared to several existing algorithms, most significantly in congested settings.
{"title":"Unspread the Jam: Scheduling Traffic Lights to Reduce Congestion","authors":"Y. Levi, Ayal Taitler, I. Keslassy","doi":"10.1109/ICSEE.2018.8646046","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646046","url":null,"abstract":"In this paper, we consider the practical problem of scheduling traffic lights to reduce the average vehicle waiting times. We find that existing scheduling algorithms have lackluster performance. Instead, we introduce two algorithms. First, extended CMSM (eCMSM), which extends CMSM from a switch scheduling model to a general traffic-light scheduling model. We prove that eCMSM can optimally schedule any traffic batch. Second, we introduce Front-Pressure (FP), which aims to further reduce the average waiting time at general intersections. We then evaluate empirically these two algorithms. We find that when using them, the best average waiting time can be improved in 98% of the simulations when compared to several existing algorithms, most significantly in congested settings.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"119 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":"133477020","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.8721181
M. Kamalian, J. Prilepsky, A. Vasylchenkova, D. Shepelsky, S. Turitsyn
The nonlinear Fourier transform (NFT) has attracted great interest recently as a new technique for nonlinearity mitigation in fibre-optic transmission. Most of the attention has so far been paid to the NFT for time-decaying signals while periodic signals can potentially ameliorate some difficulties of conventional NFT, offering a better system performance. We consider two communication systems based on the usage of periodic NFT (PNFT): with signal processing based (i) on the reduced algebro-geometric and (ii) on Riemann-Hilbert problem (RHP) approaches. Simulation results show that both methods can be used for nonlinearity mitigation. However, the latter approach is expandable without considerable penalty in processing complexity, which makes it a more appealing option for implementation.
{"title":"Methods of nonlinear fourier-based optical transmission with periodically-extended signals","authors":"M. Kamalian, J. Prilepsky, A. Vasylchenkova, D. Shepelsky, S. Turitsyn","doi":"10.1109/ICSEE.2018.8721181","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8721181","url":null,"abstract":"The nonlinear Fourier transform (NFT) has attracted great interest recently as a new technique for nonlinearity mitigation in fibre-optic transmission. Most of the attention has so far been paid to the NFT for time-decaying signals while periodic signals can potentially ameliorate some difficulties of conventional NFT, offering a better system performance. We consider two communication systems based on the usage of periodic NFT (PNFT): with signal processing based (i) on the reduced algebro-geometric and (ii) on Riemann-Hilbert problem (RHP) approaches. Simulation results show that both methods can be used for nonlinearity mitigation. However, the latter approach is expandable without considerable penalty in processing complexity, which makes it a more appealing option for implementation.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"1 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":"129031017","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.8646184
Zeev Kustanovich, G. Weiss
We present a research of a possibility of constructing a photovoltaic DC to AC inverter based on a synchronverter operation principle. A possible area of an application for this inverter is in a photovoltaic power plant that is connected to the low voltage grid. We give a brief explanation about a theoretical control algorithm that governs an operation of the inverter including Maximum Power Point Tracking (MPPT). A Simulink average model verifies the performance of the algorithm. We also present a brief explanation of the experiments that are in progress in Smart Grid Interoperability Laboratory of the European Commission Joint Research Center in Ispra, Italy. The main goal of these experiments is to verify a performance of the control algorithm by using an external PCB uploaded with the control algorithm and connected to the Real Time Digital Simulator (RTDS).
{"title":"Synchronverter based photovoltaic inverter","authors":"Zeev Kustanovich, G. Weiss","doi":"10.1109/ICSEE.2018.8646184","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646184","url":null,"abstract":"We present a research of a possibility of constructing a photovoltaic DC to AC inverter based on a synchronverter operation principle. A possible area of an application for this inverter is in a photovoltaic power plant that is connected to the low voltage grid. We give a brief explanation about a theoretical control algorithm that governs an operation of the inverter including Maximum Power Point Tracking (MPPT). A Simulink average model verifies the performance of the algorithm. We also present a brief explanation of the experiments that are in progress in Smart Grid Interoperability Laboratory of the European Commission Joint Research Center in Ispra, Italy. The main goal of these experiments is to verify a performance of the control algorithm by using an external PCB uploaded with the control algorithm and connected to the Real Time Digital Simulator (RTDS).","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"51 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":"125654857","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.8646112
P. Ros, A. Sanginario, M. Crepaldi, D. Demarchi
Applications are demanding new approaches to electronic systems. The concept of running for obtaining the best performances in terms of speed and dimensions, that drove the electronic design in the last decades, is no more valid. In fact, the electronic systems are nowadays applied in very much different scenarios where sometimes, for example, it is not at all important the speed, but power consumption and reliability are the keys.It is strategic to find new approaches that must have an impact at system level, not on the single parts only, but on the global structure: the optimization is done as consequence of the choices related to how the single devices are working, associated to how they interact each other and they transmit the information. The two levels (system and device) are strictly related, and design choices have to be done looking at the system as a global entity to be optimized.
{"title":"Quality-Energy Trade-off and Bio-Inspired Electronic Systems","authors":"P. Ros, A. Sanginario, M. Crepaldi, D. Demarchi","doi":"10.1109/ICSEE.2018.8646112","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646112","url":null,"abstract":"Applications are demanding new approaches to electronic systems. The concept of running for obtaining the best performances in terms of speed and dimensions, that drove the electronic design in the last decades, is no more valid. In fact, the electronic systems are nowadays applied in very much different scenarios where sometimes, for example, it is not at all important the speed, but power consumption and reliability are the keys.It is strategic to find new approaches that must have an impact at system level, not on the single parts only, but on the global structure: the optimization is done as consequence of the choices related to how the single devices are working, associated to how they interact each other and they transmit the information. The two levels (system and device) are strictly related, and design choices have to be done looking at the system as a global entity to be optimized.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"13 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":"124280329","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.8646292
Mor Goren, R. Zamir
Diversity “multiple description” (MD) source coding promises graceful degradation in the presence of an unknown number of erasures in the channel. A simple solution in the case of two descriptions consists of oversampling the source by a factor of two and delta-sigma quantization. This approach was applied successfully to JPEG-based image coding over a lossy packet network, where the interpolation into two packets is done in the discrete cosine transform (DCT) domain. The extension to a larger number of descriptions, however, suffers from noise amplification whenever the received descriptions do not form a uniform sampling pattern. In this work we show how noise amplification can be reduced by optimizing the interpolation filter. We propose two interpolation methods which, for a given total coding rate, minimize the average distortion over all (K out of N) patterns of received packets. We provide simulation results comparing low pass and irregular interpolation filters, and discuss the advantage of each method.
{"title":"Combating Packet Loss in Image Coding using Oversampling and Irregular Interpolation","authors":"Mor Goren, R. Zamir","doi":"10.1109/ICSEE.2018.8646292","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646292","url":null,"abstract":"Diversity “multiple description” (MD) source coding promises graceful degradation in the presence of an unknown number of erasures in the channel. A simple solution in the case of two descriptions consists of oversampling the source by a factor of two and delta-sigma quantization. This approach was applied successfully to JPEG-based image coding over a lossy packet network, where the interpolation into two packets is done in the discrete cosine transform (DCT) domain. The extension to a larger number of descriptions, however, suffers from noise amplification whenever the received descriptions do not form a uniform sampling pattern. In this work we show how noise amplification can be reduced by optimizing the interpolation filter. We propose two interpolation methods which, for a given total coding rate, minimize the average distortion over all (K out of N) patterns of received packets. We provide simulation results comparing low pass and irregular interpolation filters, and discuss the advantage of each method.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"20 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":"116633214","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.8646076
Ifat Abramovich, Tomer Ben-Yehuda, R. Cohen
Deep learning has led to great successes in computer vision tasks such as image classification. This is mostly attributed to the availability of large image datasets such as ImageNet. However, the progress in video classification has been slower, especially due to the small size of available video datasets and larger computational and memory demands. To promote innovation and advancement in this field, Google announced the YouTube-8M dataset in 2016, which is a public video dataset containing about 8-million tagged videos. In this paper, we train several deep neural networks for video classification on a subset of YouTube-8M. Our approach is based on extracting frame-level features using the Inception-v3 network, which are later used by recurrent neural networks with LSTM/BiLSTM units for video classification. We focus on network architectures with low computational requirements and present a detailed performance comparison. We show that for 5 categories, more than 96% of the videos are labeled correctly, where for 10 categories more than 89% of the videos are labeled correctly. We demonstrate that transfer learning leads to substantial saving in training time, while offering good results.
{"title":"Low-Complexity Video Classification using Recurrent Neural Networks","authors":"Ifat Abramovich, Tomer Ben-Yehuda, R. Cohen","doi":"10.1109/ICSEE.2018.8646076","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646076","url":null,"abstract":"Deep learning has led to great successes in computer vision tasks such as image classification. This is mostly attributed to the availability of large image datasets such as ImageNet. However, the progress in video classification has been slower, especially due to the small size of available video datasets and larger computational and memory demands. To promote innovation and advancement in this field, Google announced the YouTube-8M dataset in 2016, which is a public video dataset containing about 8-million tagged videos. In this paper, we train several deep neural networks for video classification on a subset of YouTube-8M. Our approach is based on extracting frame-level features using the Inception-v3 network, which are later used by recurrent neural networks with LSTM/BiLSTM units for video classification. We focus on network architectures with low computational requirements and present a detailed performance comparison. We show that for 5 categories, more than 96% of the videos are labeled correctly, where for 10 categories more than 89% of the videos are labeled correctly. We demonstrate that transfer learning leads to substantial saving in training time, while offering good results.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"153 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":"115547168","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.8646165
Merav Allouch, A. Azaria, Rina Azoulay, Ester Ben-Izchak, M. Zwilling, D. Zachor
An overall goal of our work is to use machine-learning based solutions to assist children with communication difficulties in their communication task. In this paper, we concentrate on the problem of recognizing insulting sentences the child says, or insulting sentences that are told to him. An automated agent that is able to recognize such sentences can alert the child in real time situations, and can suggest how to respond to the resulting social situation. We composed a dataset of 1241 non-insulting and 1255 insulting sentences. We trained different machine learning methods on 90% randomly chosen sentences from the dataset and tested it on the remaining. We used the following machine learning methods: Multi-Layer Neural Network, SVM, Naive Bayes, Decision Tree, and Tree Bagger for the task. We found that the best predictors of the insulting sentences, were the SVM method, with 80% recall and over 75%precision, and the Multi-Layer Neural Network and the Tree Bagger, with precision and recall exceeding 75%, We also found that adding additional data to the learning process, such as 9500 labeled sentences from twitter, or adding the word “positive” and the word “negative” to sentences including positive or negative words, respectively, slightly improves the results in most of the cases. Our results provide the cornerstones for an automated system that would enable on-line assistance and consultation for children with communication disabilities, and also for other persons with communication problems, in a way that will enable them to function better in society through this assistance.
{"title":"Automatic Detection of Insulting Sentences in Conversation","authors":"Merav Allouch, A. Azaria, Rina Azoulay, Ester Ben-Izchak, M. Zwilling, D. Zachor","doi":"10.1109/ICSEE.2018.8646165","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646165","url":null,"abstract":"An overall goal of our work is to use machine-learning based solutions to assist children with communication difficulties in their communication task. In this paper, we concentrate on the problem of recognizing insulting sentences the child says, or insulting sentences that are told to him. An automated agent that is able to recognize such sentences can alert the child in real time situations, and can suggest how to respond to the resulting social situation. We composed a dataset of 1241 non-insulting and 1255 insulting sentences. We trained different machine learning methods on 90% randomly chosen sentences from the dataset and tested it on the remaining. We used the following machine learning methods: Multi-Layer Neural Network, SVM, Naive Bayes, Decision Tree, and Tree Bagger for the task. We found that the best predictors of the insulting sentences, were the SVM method, with 80% recall and over 75%precision, and the Multi-Layer Neural Network and the Tree Bagger, with precision and recall exceeding 75%, We also found that adding additional data to the learning process, such as 9500 labeled sentences from twitter, or adding the word “positive” and the word “negative” to sentences including positive or negative words, respectively, slightly improves the results in most of the cases. Our results provide the cornerstones for an automated system that would enable on-line assistance and consultation for children with communication disabilities, and also for other persons with communication problems, in a way that will enable them to function better in society through this assistance.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"25 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":"116750544","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.8646164
Yishai Cohen, I. Lapidot
This paper focuses on estimating the quality of a clustering process. In our case - the task is to cluster short speech segments that belong to different speakers. Moreover, speaker clustering quality may be well estimated on several clustering approaches if they all based on the same features. This is very important, as it allows us to use the same quality estimation system without retraining, and achieve reasonable results even when the clustering method is changed. We predict the system’s quality by applying a logistic regression estimator on a several statistical parameters of the clustering. In this paper, mean-shift clustering with either cosine or probabilistic linear discriminant analysis (PLDA) score as similarity measure, and stochastic vector quantization (VQ) with cosine distance were applied in order to cluster the short speaker segments represented by i-vectors. The quality of the clustering is measured using the average cluster purity (ACP), average speaker purity (ASP) and K. We show that these measures can be estimated fairly well by applying logistic regression based on various clustering statistics that calculated once clustering is over. These statistical parameters are used as a feature vector representing the clustering.
{"title":"Robust speaker clustering quality estimation","authors":"Yishai Cohen, I. Lapidot","doi":"10.1109/ICSEE.2018.8646164","DOIUrl":"https://doi.org/10.1109/ICSEE.2018.8646164","url":null,"abstract":"This paper focuses on estimating the quality of a clustering process. In our case - the task is to cluster short speech segments that belong to different speakers. Moreover, speaker clustering quality may be well estimated on several clustering approaches if they all based on the same features. This is very important, as it allows us to use the same quality estimation system without retraining, and achieve reasonable results even when the clustering method is changed. We predict the system’s quality by applying a logistic regression estimator on a several statistical parameters of the clustering. In this paper, mean-shift clustering with either cosine or probabilistic linear discriminant analysis (PLDA) score as similarity measure, and stochastic vector quantization (VQ) with cosine distance were applied in order to cluster the short speaker segments represented by i-vectors. The quality of the clustering is measured using the average cluster purity (ACP), average speaker purity (ASP) and K. We show that these measures can be estimated fairly well by applying logistic regression based on various clustering statistics that calculated once clustering is over. These statistical parameters are used as a feature vector representing the clustering.","PeriodicalId":254455,"journal":{"name":"2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)","volume":"29 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":"123986813","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.8645999
G. Leshem, Esther David, M. Domb
The Internet of Things (IoT) is composed of a vast number of connected devices, interacting among them in real-time and high messaging volume. Such setting is in high probability to be targeted by malicious attackers. Therefore, robust security measures are required. Encryption is one of the ways to prevent the exposure of the transmitted messages and authenticate it. The main challenge of implementing encryption, is the need to frequently and securely change the encryption keys, which require constant key construction and key distribution. IoT devices have poor memory, storage, and processing bandwidth. Most of the existing security solutions cannot be implemented on them, and so leading to lack of adequate security. Allowing safe interaction between any two IoT-devices, means having a unique encryption key per conversation. This requires frequent changes of the encryption keys. To increase the availability of keys at each IoT-device, we propose an ongoing key construction process that loads the network with a common key-pool. The protocol is scalable to ensure long term security sustainability and encryption availability. The proposed protocol is based on a probability analysis that ensures the existence of a common key between any pair of IoT devices in a predefine probability which is set by the system designer. The implementation proves the feasibility of our proposed security protocol for IoT networks.
{"title":"Probability Based Keys Sharing for IOT Security","authors":"G. Leshem, Esther David, M. Domb","doi":"10.1109/icsee.2018.8645999","DOIUrl":"https://doi.org/10.1109/icsee.2018.8645999","url":null,"abstract":"The Internet of Things (IoT) is composed of a vast number of connected devices, interacting among them in real-time and high messaging volume. Such setting is in high probability to be targeted by malicious attackers. Therefore, robust security measures are required. Encryption is one of the ways to prevent the exposure of the transmitted messages and authenticate it. The main challenge of implementing encryption, is the need to frequently and securely change the encryption keys, which require constant key construction and key distribution. IoT devices have poor memory, storage, and processing bandwidth. Most of the existing security solutions cannot be implemented on them, and so leading to lack of adequate security. Allowing safe interaction between any two IoT-devices, means having a unique encryption key per conversation. This requires frequent changes of the encryption keys. To increase the availability of keys at each IoT-device, we propose an ongoing key construction process that loads the network with a common key-pool. The protocol is scalable to ensure long term security sustainability and encryption availability. The proposed protocol is based on a probability analysis that ensures the existence of a common key between any pair of IoT devices in a predefine probability which is set by the system designer. The implementation proves the feasibility of our proposed security protocol for IoT networks.","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":"126195488","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
扫码关注我们
求助内容：
应助结果提醒方式：