Satender Sharma, U. Chauhan, Ruqaiya Khanam, Krishnavir Singh
Abstract The advancement in computer science technology has led to some serious concerns about the piracy and copyright of digital content. Digital watermarking technique is widely used for copyright protection and other similar applications. In this paper, a technique for digital watermarking based on Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), and Grasshopper Optimization Algorithm (GOA) is proposed. The method computes the DWT of the cover image to obtain the sub-components of the image. The subcomponent is converted to frequency domain using DCT. The challenge is to find the optimal scaling factor to be used for watermarking. The authors have designed a GOA based technique that finds the optimized scaling factor and the coefficient for embedding the watermark. GOA makes the watermark undetectable and is invisible in the cover image. The watermark image is embedded in the cover image using these coefficients. The extraction of watermark from the cover image is done by using inverse DCT and DWT. The proposed method is compared with the other state of the art methods. The effectiveness of the proposed method is computed using Peak Signal to Noise Ratio (PSNR), Normalized Cross Correlation (NCC) and Image Fidelity (IF). The proposed method outperforms the other methods and can be effectively used for practical digital watermarking.
{"title":"Digital Watermarking using Grasshopper Optimization Algorithm","authors":"Satender Sharma, U. Chauhan, Ruqaiya Khanam, Krishnavir Singh","doi":"10.1515/comp-2019-0023","DOIUrl":"https://doi.org/10.1515/comp-2019-0023","url":null,"abstract":"Abstract The advancement in computer science technology has led to some serious concerns about the piracy and copyright of digital content. Digital watermarking technique is widely used for copyright protection and other similar applications. In this paper, a technique for digital watermarking based on Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), and Grasshopper Optimization Algorithm (GOA) is proposed. The method computes the DWT of the cover image to obtain the sub-components of the image. The subcomponent is converted to frequency domain using DCT. The challenge is to find the optimal scaling factor to be used for watermarking. The authors have designed a GOA based technique that finds the optimized scaling factor and the coefficient for embedding the watermark. GOA makes the watermark undetectable and is invisible in the cover image. The watermark image is embedded in the cover image using these coefficients. The extraction of watermark from the cover image is done by using inverse DCT and DWT. The proposed method is compared with the other state of the art methods. The effectiveness of the proposed method is computed using Peak Signal to Noise Ratio (PSNR), Normalized Cross Correlation (NCC) and Image Fidelity (IF). The proposed method outperforms the other methods and can be effectively used for practical digital watermarking.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"330 - 336"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2019-0023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46644825","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}
Abstract Detection of plant disease has a crucial role in better understanding the economy of India in terms of agricultural productivity. Early recognition and categorization of diseases in plants are very crucial as it can adversely affect the growth and development of species. Numerous machine learning methods like SVM (support vector machine), random forest, KNN (k-nearest neighbor), Naïve Bayes, decision tree, etc., have been exploited for recognition, discovery, and categorization of plant diseases; however, the advancement of machine learning by DL (deep learning) is supposed to possess tremendous potential in enhancing the accuracy. This paper proposed a model comprising of Auto-Color Correlogram as image filter and DL as classifiers with different activation functions for plant disease. This proposed model is implemented on four different datasets to solve binary and multiclass subcategories of plant diseases. Using the proposed model, results achieved are better, obtaining 99.4% accuracy and 99.9% sensitivity for binary class and 99.2% accuracy for multiclass. It is proven that the proposed model outperforms other approaches, namely LibSVM, SMO (sequential minimal optimization), and DL with activation function softmax and softsign in terms of F-measure, recall, MCC (Matthews correlation coefficient), specificity and sensitivity.
{"title":"Classification of plant diseases using machine and deep learning","authors":"Monika Lamba, Yogita Gigras, A. Dhull","doi":"10.1515/comp-2020-0122","DOIUrl":"https://doi.org/10.1515/comp-2020-0122","url":null,"abstract":"Abstract Detection of plant disease has a crucial role in better understanding the economy of India in terms of agricultural productivity. Early recognition and categorization of diseases in plants are very crucial as it can adversely affect the growth and development of species. Numerous machine learning methods like SVM (support vector machine), random forest, KNN (k-nearest neighbor), Naïve Bayes, decision tree, etc., have been exploited for recognition, discovery, and categorization of plant diseases; however, the advancement of machine learning by DL (deep learning) is supposed to possess tremendous potential in enhancing the accuracy. This paper proposed a model comprising of Auto-Color Correlogram as image filter and DL as classifiers with different activation functions for plant disease. This proposed model is implemented on four different datasets to solve binary and multiclass subcategories of plant diseases. Using the proposed model, results achieved are better, obtaining 99.4% accuracy and 99.9% sensitivity for binary class and 99.2% accuracy for multiclass. It is proven that the proposed model outperforms other approaches, namely LibSVM, SMO (sequential minimal optimization), and DL with activation function softmax and softsign in terms of F-measure, recall, MCC (Matthews correlation coefficient), specificity and sensitivity.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"491 - 508"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46667810","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}
Abstract Advances in communication technology have significantly altered our knowledge about telephone networks. The remarkable expansion in communication is obvious in numerous aspects of life of life; the transmission of information has never been easier. Wireless communication has also had a remarkable development, and these facilities have become more reliable and easily accessible. This study, through a descriptive approach in accordance with earlier studies, aims to explain how to increase the capacity of wireless data delivery in addition to other important challenges that face the enhancement of these services in remote areas. This study highlights the challenges that accompany the adoption of wireless networks in remote areas: particularly signal strength. This is highly linked to the specific features of rural areas in terms of living habits in separated nodes rather than in high-density population centers areas.
{"title":"Improving Data Delivery in Large Environments and Mobile Areas","authors":"Nada I. Najim","doi":"10.1515/comp-2020-0211","DOIUrl":"https://doi.org/10.1515/comp-2020-0211","url":null,"abstract":"Abstract Advances in communication technology have significantly altered our knowledge about telephone networks. The remarkable expansion in communication is obvious in numerous aspects of life of life; the transmission of information has never been easier. Wireless communication has also had a remarkable development, and these facilities have become more reliable and easily accessible. This study, through a descriptive approach in accordance with earlier studies, aims to explain how to increase the capacity of wireless data delivery in addition to other important challenges that face the enhancement of these services in remote areas. This study highlights the challenges that accompany the adoption of wireless networks in remote areas: particularly signal strength. This is highly linked to the specific features of rural areas in terms of living habits in separated nodes rather than in high-density population centers areas.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"288 - 293"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48456937","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}
Abstract Although cloud computing is considered the most widespread technology nowadays, it still suffers from many challenges, especially related to its security. Due to the open and distributed nature of the cloud environment, this makes the cloud itself vulnerable to various attacks. In this paper, the design of a novel integrated Cloud-based Intrusion Detection System (CIDS) is proposed to immunise the cloud against any possible attacks. The proposed CIDS consists of five main modules to do the following actions: monitoring the network, capturing the traffic flows, extracting features, analyzing the flows, detecting intrusions, taking a reaction, and logging all activities. Furthermore an enhanced bagging ensemble system of three deep learning models is utilized to predict intrusions effectively. Moreover, a third-party Cloud-based Intrusion Detection System Service (CIDSS) is also exploited to control the proposed CIDS and provide the reporting service. Finally, it has been shown that the proposed approach overcomes all problems associated with attacks on the cloud raised in the literature.
{"title":"A Design of an Integrated Cloud-based Intrusion Detection System with Third Party Cloud Service","authors":"Wisam Elmasry, A. Akbulut, A. Zaim","doi":"10.1515/comp-2020-0214","DOIUrl":"https://doi.org/10.1515/comp-2020-0214","url":null,"abstract":"Abstract Although cloud computing is considered the most widespread technology nowadays, it still suffers from many challenges, especially related to its security. Due to the open and distributed nature of the cloud environment, this makes the cloud itself vulnerable to various attacks. In this paper, the design of a novel integrated Cloud-based Intrusion Detection System (CIDS) is proposed to immunise the cloud against any possible attacks. The proposed CIDS consists of five main modules to do the following actions: monitoring the network, capturing the traffic flows, extracting features, analyzing the flows, detecting intrusions, taking a reaction, and logging all activities. Furthermore an enhanced bagging ensemble system of three deep learning models is utilized to predict intrusions effectively. Moreover, a third-party Cloud-based Intrusion Detection System Service (CIDSS) is also exploited to control the proposed CIDS and provide the reporting service. Finally, it has been shown that the proposed approach overcomes all problems associated with attacks on the cloud raised in the literature.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"365 - 379"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0214","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44829962","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}
Abstract This paper is aimed at efficiently distributing workload between the Fog Layer and the Cloud Network and then optimizing resource allocation in cloud networks to ensure better utilization and quick response time of the resources available to the end user. We have employed a Dead-line aware scheme to migrate the data between cloud and Fog networks based on data profiling and then used K-Means clustering and Service-request prediction model to allocate the resources efficiently to all requests. To substantiate our model, we have used iFogSim, which is an extension of the CloudSim simulator. The results clearly show that when an optimized network is used the Quality of Service parameters exhibit better efficiency and output.
{"title":"QoS Based Optimal Resource Allocation and Workload Balancing for Fog Enabled IoT","authors":"A. Khalid, Q. Ain, Awais Qasim, Zeeshan Aziz","doi":"10.1515/comp-2020-0162","DOIUrl":"https://doi.org/10.1515/comp-2020-0162","url":null,"abstract":"Abstract This paper is aimed at efficiently distributing workload between the Fog Layer and the Cloud Network and then optimizing resource allocation in cloud networks to ensure better utilization and quick response time of the resources available to the end user. We have employed a Dead-line aware scheme to migrate the data between cloud and Fog networks based on data profiling and then used K-Means clustering and Service-request prediction model to allocate the resources efficiently to all requests. To substantiate our model, we have used iFogSim, which is an extension of the CloudSim simulator. The results clearly show that when an optimized network is used the Quality of Service parameters exhibit better efficiency and output.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"262 - 274"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0162","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45257421","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}
Abstract This paper investigates the transmission performance of 16-channel DWDM (Dense Wavelength Division Multiplexing) system with two complex Optical Differential Quadrature Phase Shift Keying modulator configurations using 2 LiNb MZM (Mach-Zehnder Modulator) and 3 LiNb MZM. The link performance is evaluated for 100 Gbps data rate per channel in a total 750 km single mode fiber link. The perfomance is analyzed in terms of forward power, reflected power and bit-error rate of the received signal. From the simulation results we prove, that the link performance can be improved by adopting the high efficiency optical modulation.
{"title":"On the 100 Gbps DWDM with Optical Carrier Suppression Modulation","authors":"Tomás Huszaník, J. Turán, Ľ. Ovseník","doi":"10.1515/comp-2020-0104","DOIUrl":"https://doi.org/10.1515/comp-2020-0104","url":null,"abstract":"Abstract This paper investigates the transmission performance of 16-channel DWDM (Dense Wavelength Division Multiplexing) system with two complex Optical Differential Quadrature Phase Shift Keying modulator configurations using 2 LiNb MZM (Mach-Zehnder Modulator) and 3 LiNb MZM. The link performance is evaluated for 100 Gbps data rate per channel in a total 750 km single mode fiber link. The perfomance is analyzed in terms of forward power, reflected power and bit-error rate of the received signal. From the simulation results we prove, that the link performance can be improved by adopting the high efficiency optical modulation.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"218 - 223"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0104","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42232211","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}
Abstract Wireless sensor networks (WSNs) have grown widely due to their application in various domains, such as surveillance, healthcare, telecommunication, etc. In WSNs, there is a necessity to design energy-efficient algorithms for different purposes. Load balancing of gateways in cluster-based WSNs is necessary to maximize the lifetime of a network. Shuffled frog leaping algorithm (SFLA) is a popular heuristic algorithm that incorporates a deterministic approach. Performance of any heuristic algorithm depends on its exploration and exploitation capability. The main contribution of this article is an enhanced SFLA with improved local search capability. Three strategies are tested to enhance the local search capability of SFLA to improve the load balancing of gateways in WSNs. The first proposed approach is deterministic in which the participation of the global best solution in information exchange is increased. The next two variations reduces the deterministic approach in the local search component of SFLA by introducing probability-based selection of frogs for information exchange. All three strategies improved the success of local search. Second contribution of article is increased lifetime of gateways in WSNs with a novel energy-biased load reduction phase introduced after the information exchange step. The proposed algorithm is tested with 15 datasets of varying areas of deployment, number of sensors and number of gateways. Proposed ESFLA-RW variation shows significant improvement over other variations in terms of successful local explorations, best fitness values, average fitness values and convergence rate for all datasets. Obtained results of proposed ESFLA-RW are significantly better in terms of network energy consumption, load balancing, first gateway die and network life. The proposed variations are tested to check the effect of various algorithm-specific parameters namely frog population size, probability of information exchange and probability of energy-biased load reduction phase. Higher population size and probabilities give better solutions and convergence rate.
{"title":"Enhanced shuffled frog leaping algorithm with improved local exploration and energy-biased load reduction phase for load balancing of gateways in WSNs","authors":"A. Adamuthe, A. Pathan","doi":"10.1515/comp-2020-0218","DOIUrl":"https://doi.org/10.1515/comp-2020-0218","url":null,"abstract":"Abstract Wireless sensor networks (WSNs) have grown widely due to their application in various domains, such as surveillance, healthcare, telecommunication, etc. In WSNs, there is a necessity to design energy-efficient algorithms for different purposes. Load balancing of gateways in cluster-based WSNs is necessary to maximize the lifetime of a network. Shuffled frog leaping algorithm (SFLA) is a popular heuristic algorithm that incorporates a deterministic approach. Performance of any heuristic algorithm depends on its exploration and exploitation capability. The main contribution of this article is an enhanced SFLA with improved local search capability. Three strategies are tested to enhance the local search capability of SFLA to improve the load balancing of gateways in WSNs. The first proposed approach is deterministic in which the participation of the global best solution in information exchange is increased. The next two variations reduces the deterministic approach in the local search component of SFLA by introducing probability-based selection of frogs for information exchange. All three strategies improved the success of local search. Second contribution of article is increased lifetime of gateways in WSNs with a novel energy-biased load reduction phase introduced after the information exchange step. The proposed algorithm is tested with 15 datasets of varying areas of deployment, number of sensors and number of gateways. Proposed ESFLA-RW variation shows significant improvement over other variations in terms of successful local explorations, best fitness values, average fitness values and convergence rate for all datasets. Obtained results of proposed ESFLA-RW are significantly better in terms of network energy consumption, load balancing, first gateway die and network life. The proposed variations are tested to check the effect of various algorithm-specific parameters namely frog population size, probability of information exchange and probability of energy-biased load reduction phase. Higher population size and probabilities give better solutions and convergence rate.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"437 - 460"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43796864","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}
Abstract Geographical routing is an area of interest for wireless sensor networks because of its scalability and local decision making capability. Usually, geographical routing protocols rely on greedy approach and suffer from the void node problem (VNP). This paper presents an angular three-dimensional routing protocol (A3DR) for wireless sensor networks. In A3DR, the next hop is selected from nodes available in solid angle decided dynamically based on network density, i.e., larger solid angle for sparse networks while a smaller angle for dense one. The delay based contention mechanism has been proposed to select a suitable forwarding node among nodes lying in a particular solid angle. A3DR has a provision to adaptively tune the solid angle to resolve the void node problem. Further, the proposed protocol A3DR will take care of traffic congestion problem suffered by beaconless routing protocol. The A3DR tackle the concave void problem by allowing conditional backtracking to find another suitable path and prevent looping. Additionally, A3DR address overhear problem by utilizing the concept of request-to-forward and clear-to-forward for the nodes lying outside the solid angle 60°. The performance of proposed A3DR is compared with existing protocols by implementing it on the INET framework under OMNET++ simulator. The simulation results indicate that A3DR achieves a high packet reception rate while maximizing the residual energy and minimizing traffic overhead.
{"title":"An Angular 3D Path Selection Protocol in Wireless Sensor Networks","authors":"N. Gupta, R. S. Yadav, R. Nagaria, D. Gupta","doi":"10.1515/comp-2020-0203","DOIUrl":"https://doi.org/10.1515/comp-2020-0203","url":null,"abstract":"Abstract Geographical routing is an area of interest for wireless sensor networks because of its scalability and local decision making capability. Usually, geographical routing protocols rely on greedy approach and suffer from the void node problem (VNP). This paper presents an angular three-dimensional routing protocol (A3DR) for wireless sensor networks. In A3DR, the next hop is selected from nodes available in solid angle decided dynamically based on network density, i.e., larger solid angle for sparse networks while a smaller angle for dense one. The delay based contention mechanism has been proposed to select a suitable forwarding node among nodes lying in a particular solid angle. A3DR has a provision to adaptively tune the solid angle to resolve the void node problem. Further, the proposed protocol A3DR will take care of traffic congestion problem suffered by beaconless routing protocol. The A3DR tackle the concave void problem by allowing conditional backtracking to find another suitable path and prevent looping. Additionally, A3DR address overhear problem by utilizing the concept of request-to-forward and clear-to-forward for the nodes lying outside the solid angle 60°. The performance of proposed A3DR is compared with existing protocols by implementing it on the INET framework under OMNET++ simulator. The simulation results indicate that A3DR achieves a high packet reception rate while maximizing the residual energy and minimizing traffic overhead.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"190 - 207"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49379876","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}
Abstract The authors consider a continuous dynamic approximating model of a gas fields group and, on its basis, set maximum and minimum issues. The tasks proposed for research are optimal control problems with mixed constraints with free-final-time and moving right end. We analytically solve the rapid-action problem. The central mathematical apparatus is Pontryagin maximum principle in Arrow form, using Lagrange multipliers. The theoretically obtained results of the analysis are of particular interest.
{"title":"Theoretical Estimate of the Total Shelf Length in a Gas Fields Model","authors":"A. Skiba, N. Skiba","doi":"10.1515/comp-2020-0224","DOIUrl":"https://doi.org/10.1515/comp-2020-0224","url":null,"abstract":"Abstract The authors consider a continuous dynamic approximating model of a gas fields group and, on its basis, set maximum and minimum issues. The tasks proposed for research are optimal control problems with mixed constraints with free-final-time and moving right end. We analytically solve the rapid-action problem. The central mathematical apparatus is Pontryagin maximum principle in Arrow form, using Lagrange multipliers. The theoretically obtained results of the analysis are of particular interest.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"15 23","pages":"355 - 364"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0224","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41273247","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}
Abstract This paper presents a review of state-of-the-art security frameworks for IoT applications. It aims to find out what alternatives have been proposed to guide IoT application developers in the implementation of security measures through all development phases. In this literature review, we identified 21 security frameworks, and we analyzed them from IoT application domains addressed and IoT elements protected. We find four application domains: generic, smart cities, smart car/VANET, and smart infrastructures. Concerning elements protected, we analyzed the frameworks through protected application resources and we also consider security properties in this paper. Our two principal findings are: (i) Even though there are a wide variety of security frameworks, we did not find a proposal that addresses all the layers of an IoT application (device, network, service and application) and all development phases (analysis, design, implementation, testing, deployment, and maintenance), (ii) Addressing security from the design phase allows IoT developers to have a broader perspective of the system, avoiding massive changes to be made in later stages, saving costs and time. This gap and concerns enable various research on security by design and secure development to be carried out, and proposed frameworks to address the identified problems.
{"title":"Framework-based security measures for Internet of Thing: A literature review","authors":"J. Rueda-Rueda, J. Portocarrero","doi":"10.1515/comp-2020-0220","DOIUrl":"https://doi.org/10.1515/comp-2020-0220","url":null,"abstract":"Abstract This paper presents a review of state-of-the-art security frameworks for IoT applications. It aims to find out what alternatives have been proposed to guide IoT application developers in the implementation of security measures through all development phases. In this literature review, we identified 21 security frameworks, and we analyzed them from IoT application domains addressed and IoT elements protected. We find four application domains: generic, smart cities, smart car/VANET, and smart infrastructures. Concerning elements protected, we analyzed the frameworks through protected application resources and we also consider security properties in this paper. Our two principal findings are: (i) Even though there are a wide variety of security frameworks, we did not find a proposal that addresses all the layers of an IoT application (device, network, service and application) and all development phases (analysis, design, implementation, testing, deployment, and maintenance), (ii) Addressing security from the design phase allows IoT developers to have a broader perspective of the system, avoiding massive changes to be made in later stages, saving costs and time. This gap and concerns enable various research on security by design and secure development to be carried out, and proposed frameworks to address the identified problems.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"346 - 354"},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0220","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41902608","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
扫码关注我们
求助内容：
应助结果提醒方式：