With technological advancement, cloud computing paradigms are gaining massive popularity in the ever-changing technological advancement. The main objective of the cloud computing system is to provide on-demand storage and computing resources to the users on the pay-per-use policy. It allows small businesses to use top-notch infrastructure at low expense. However, due to the cloud resource sharing property, data privacy and security are significant concerns and barriers for smart systems to constantly transfer generated data to the cloud computing resources, which a third-party provider manages. Many encryption techniques have been proposed to cope with data security issues. In this paper, different existing data protection and encryption techniques based on common parameters have been critically analyzed and their workflows are graphically presented. This survey aims to collect existing data encryption techniques widely presented in the literature for smart system data security offloaded to the cloud computing systems under a single umbrella.
Conventional RSA algorithm, being a basis for several proposed cryptosystems, has remarkable security laps with respect to confidentiality and integrity over the internet which can be compromised by state-of-the-art attacks, especially, for different types of data generation, transmission, and analysis by IoT applications. This security threat hindrance is considered to be a hard problem to solve on classical computers. However, bringing quantum mechanics into account, the concept no longer holds true. So, this calls out for the modification of the conventional pre-quantum RSA algorithm into a secure post-quantum cryptographic-based RSA technique. In this research, we propose a post-quantum lattice-based RSA (LBRSA) for IoT applications in order to secure the shared data and information. The proposed work is validated by implementing it in 60-dimensions. The key size is about 1.152 × 105-bits and generation time is 0.8 hours. Furthermore, it has been tested with AVISPA, which confirms security in the presence of an intruder. Moreover, the proposed LB-RSA technique is compared with the existing state-of-the-art techniques. The empirical results advocate that the proposed lattice-based variant is not only safe but beats counterparts in terms of secured data sharing.
In this paper, a model based on discrete wavelet transform and convolutional neural network for brain MR image classification has been proposed. The proposed model is comprised of three main stages, namely preprocessing, feature extraction, and classification. In the preprocessing, the median filter has been applied to remove salt-and-pepper noise from the brain MRI images. In the discrete wavelet transform, discrete Harr wavelet transform has been used. In the proposed model, 3-level Harr wavelet decomposition has been applied on the images to remove low-level detail and reduce the size of the images. Next, the convolutional neural network has been used for classifying the brain MR images into normal and abnormal. The convolutional neural network is also a prevalent classification method and has been widely used in different areas. In this study, the convolutional neural network has been used for brain MRI classification. The proposed methodology has been applied to the standard dataset, and for performance evaluation, we have used different performance evaluation measures. The results indicate that the proposed method provides good results with 99% accuracy. The proposed method results are then presented for comparison with some state-of-the-art algorithms where simply the proposed method outperforms the counterpart algorithms. The proposed model has been developed to be used for practical applications.
Grid resource allocation mechanism maps tasks to the available grid resources according to some predefined criterion, such as minimizing makespan or execution cost, load balancing, energy efficiency, maintaining user-defined task deadlines, and efficiently using resource memory. The minimization of the makespan is a dominant criterion and is more challenging when computationally intensive tasks have realtime deadlines and data requirements. Such tasks require data files for processing that are transferred from data storage resources to the computing resources, which consume network bandwidth. Resource allocation mechanism for these tasks takes into account the data files transfer time and processing power of the computing resources to complete execution within deadlines. The problem of allocating real-time data-intensive tasks to the grid heterogeneous computing resources with the assumption that the data resources are decoupled from the computing resources, remain challenging. This paper addresses the aforementioned problem as the global optimization problem by considering heterogeneous computing resources of various processing capabilities connected to the data storage resources by network links of various bandwidths. We have analytically formulated the resources with the aim to maximize total number of mapped tasks while possibly minimizing the makespan subject to the time QoS constraints of deadlines, execution time, and data files transfer time. The experimental results reveal that the proposed technique outperforms the other alternatives when real-time tasks are considered.
Datacentres provide the foundations for cloud computing, but require large amounts of electricity for their operation. Approaches that promise to reduce power use by minimizing execution time, for example using different scheduling and resource management techniques, are discussed in the literature. This paper summarizes some of the most important scheduling techniques in clouds focusing on power consumption, covering VM-level, host-level and task-level scheduling where the most promising approach is task level scheduling, with energy savings by means of load filtering, consolidation, adapted CPU throughput, or host power control. We explore use of the rate monotonic (RM) and backfilling algorithms for real-time task scheduling in cloud environment because RM is the simplest fixed priority scheduling technique, and thus the choice for modern real-time systems, and prior uses of RM in task scheduling have demonstrated power efficiency with optimal results. We specifically consider deadline-based tasks scheduling for real-time clouds which, to the best of our knowledge, has not been employed previously. RM with backfilling is experimentally evaluated and results show that, compared to the classical algorithms, all tasks were scheduled with minimum power consumption (5.5% - 29.3%), on minimum resources (3.9% - 25.2% less) while majority were meeting their deadlines (93.21% - 94.7%). The approach can guarantee deadline oriented Software as a Service (SaaS) in cloud if arrival rate i.e. network transfer time can be estimated in advance. We subsequently provided an extension of the proposed approach to task-based load balancing for almost balanced resource utilization and approximately 1.0% to 1.6% energy efficiency.