Showing papers by "Mohamed Elhoseny published in 2021"

Energy-Aware Marine Predators Algorithm for Task Scheduling in IoT-Based Fog Computing Applications

Abstract: To improve the quality of service (QoS) needed by several applications areas, the Internet of Things (IoT) tasks are offloaded into the fog computing instead of the cloud. However, the availability of ongoing energy heads for fog computing servers is one of the constraints for IoT applications because transmitting the huge quantity of the data generated using IoT devices will produce network bandwidth overhead and slow down the responsive time of the statements analyzed. In this article, an energy-aware model basis on the marine predators algorithm (MPA) is proposed for tackling the task scheduling in fog computing (TSFC) to improve the QoSs required by users. In addition to the standard MPA, we proposed the other two versions. The first version is called modified MPA (MMPA), which will modify MPA to improve their exploitation capability by using the last updated positions instead of the last best one. The second one will improve MMPA by the ranking strategy based reinitialization and mutation toward the best, in addition to reinitializing, the half population randomly after a predefined number of iterations to get rid of local optima and mutated the last half toward the best-so-far solution. Accordingly, MPA is proposed to solve the continuous one, whereas the TSFC is considered a discrete one, so the normalization and scaling phase will be used to convert the standard MPA into a discrete one. The three versions are proposed with some other metaheuristic algorithms and genetic algorithms based on various performance metrics such as energy consumption, makespan, flow time, and carbon dioxide emission rate. The improved MMPA could outperform all the other algorithms and the other two versions.

ST-DeepHAR: Deep Learning Model for Human Activity Recognition in IoHT Applications

Abstract: Human activity recognition (HAR) has been regarded as an indispensable part of many smart home systems and smart healthcare applications. Specifically, HAR is of great importance in the Internet of Healthcare Things (IoHT), owing to the rapid proliferation of Internet of Things (IoT) technologies embedded in various smart appliances and wearable devices (such as smartphones and smartwatches) that have a pervasive impact on an individual’s life. The inertial sensors of smartphones generate massive amounts of multidimensional time-series data, which can be exploited effectively for HAR purposes. Unlike traditional approaches, deep learning techniques are the most suitable choice for such multivariate streams. In this study, we introduce a supervised dual-channel model that comprises long short-term memory (LSTM), followed by an attention mechanism for the temporal fusion of inertial sensor data concurrent with a convolutional residual network for the spatial fusion of sensor data. We also introduce an adaptive channel-squeezing operation to fine-tune convolutional a neural network feature extraction capability by exploiting multichannel dependency. Finally, two widely available and public HAR data sets are used in experiments to evaluate the performance of our model. The results demonstrate that our proposed approach can overcome state-of-the-art methods.

Deep neural network-based application partitioning and scheduling for hospitals and medical enterprises using IoT assisted mobile fog cloud

Abstract: These days, fog-cloud based healthcare application partitioning techniques have been growing progressively. However, existing static fog-cloud based application partitioning methods are static and ...

Energy-Aware Metaheuristic Algorithm for Industrial-Internet-of-Things Task Scheduling Problems in Fog Computing Applications

Abstract: In Industrial-Internet-of-Things (IIoT) applications, fog computing (FC) has soared as a means to improve the Quality of Services (QoSs) provided to users through cloud computing, which has become overwhelmed by the massive flow of data. Transmitting all these amounts of data to the cloud and coming back with a response can cause high latency and requires high network bandwidth. The availability of sustainable energy sources for FC servers is one of the difficulties that the service providers can face in IIoT applications. The most important factor contributing to energy consumption on fog servers is task scheduling. In this article, we suggest an energy-aware metaheuristic algorithm based on a Harris Hawks optimization algorithm based on a local search strategy (HHOLS) for task scheduling in FC (TSFC) to improve the QoSs provided to the users in IIoT applications. First, we describe the high virtualized layered FC model taking into account its heterogeneous architecture. The normalization and scaling phase aids the standard Harris hawks algorithm to solve the TSFC, which is discrete. Moreover, the swap mutation ameliorates the quality of the solutions due to its ability to balance the workloads among all virtual machines. For further improvements, a local search strategy is integrated with HHOLS. We compare HHOLS with other metaheuristics using various performance metrics, such as energy consumption, makespan, cost, flow time, and emission rate of carbon dioxide. The proposed algorithm gives superior results in comparison with other algorithms.

Data Encryption for Internet of Things Applications Based on Catalan Objects and Two Combinatorial Structures

Abstract: This article presents a novel data encryption technique suitable for Internet of Things (IoT) applications. The cryptosystem is based on the application of a Catalan object (as a cryptographic key) that provides encryption based on combinatorial structures with noncrossing or nonnested matching. The experimental part of this article includes a comparative analysis of the proposed encryption method with the Catalan numbers and data encryption standard (DES) algorithm, which is performed with machine learning-based identification of the encryption method using ciphertext only. These tests showed that it is much more difficult to recognize ciphertext generated with the Catalan method than one made with the DES algorithm. System reliability depends on the quality of the key, therefore, statistical testing proposed by National Institute of Standards and Technology was also performed. Twelve standard tests, the approximate entropy measurement, and random digression complexity analysis are applied in order to evaluate the quality of the generated Catalan key. A proposal for applying this method in e-Health IoT is also given. Possibilities of applying this method in the IoT applications for smart cities data storage and processing are provided.

Cost-efficient mobility offloading and task scheduling for microservices IoVT applications in container-based fog cloud network

Abstract: These days, the usage of the internet of Vehicle Things (IVoT) applications such as E-Business, E-Train, E-Ambulance has been growing progressively. These applications require mobility-aware delay-sensitive services to execute their tasks. With this motivation, the study has the following contribution. Initially, the study devises a novel cooperative vehicular fog cloud network (VFCN) based on container microservices which offers cost-efficient and mobility-aware services with rich resources for processing. This study devises the cost-efficient task offloading and scheduling (CEMOTS) algorithm framework, which consists of the mobility aware task offloading phase (MTOP) method, which determines the optimal offloading time to minimize the communication cost of applications. Furthermore, CEMOTS offers Cooperative Task Offloading Scheduling (CTOS), including task sequencing and scheduling. The goal is to reduce the application costs of communication cost and computational costs under a given deadline constraint. Performance evaluation shows the CTOS and MTOP outperform existing task offloading and scheduling methods in the VCFN in terms of costs and the deadline for IoT applications.

An efficient radix trie-based semantic visual indexing model for large-scale image retrieval in cloud environment

Abstract: In recent years, massive growth in the number of images on the web has raised the requirement of developing an effective indexing model to search digital images from a large‐scale database. Though cloud service offers effective indexing of compressed images, it remains a major issue due to the semantic gap between the user query and diverse semantics of large‐scale database. This article presents a radix trie indexing (RTI) model based on semantic visual indexing for retrieving the images from cloud platforms. Initially, an interactive optimization model is applied to identify the joint semantic and visual descriptor space. Next, an RTI model is applied to integrate the semantic visual joint space model for finding an effective solution for searching large‐scale sized dataset. Finally, a Spark distributed model is applied for deploying the online image retrieval service. The performance of the proposed method is validated on two standard dataset, namely, Holidays 1 M and Oxford 5 K in terms of mean average precision (mAP) and processing time under varying dataset sizes. During experimentation, the presented RTI model shows the maximum mAP value of 0.83 under the dataset size of 1000. Similarly, under the sample count of 1000, it is noted that the standalone server requires a maximum of 118 minutes to complete the process, whereas the spark cluster requires a minimum of around only 19 minutes to finish the process. The experimental outcome showed improvement in terms of various measures over the best rivals in the literature.

An Optimized Framework for WSN Routing in the Context of Industry 4.0.

Abstract: The advancements in Industry 4.0 have opened up new ways for the structural deployment of Smart Grids (SGs) to face the endlessly rising challenges of the 21st century. SGs for Industry 4.0 can be better managed by optimized routing techniques. In Mobile Ad hoc Networks (MANETs), the topology is not fixed and can be encountered by interference, mobility of nodes, propagation of multi-paths, and path loss. To extenuate these concerns for SGs, in this paper, we have presented a new version of the standard Optimized Link State Routing (OLSR) protocol for SGs to improve the management of control intervals that enhance the efficiency of the standard OLSR protocol without affecting its reliability. The adapted fault tolerant approach makes the proposed protocol more reliable for industrial applications. The process of grouping of nodes supports managing the total network cost by reducing severe flooding and evaluating an optimized head of clusters. The head of the unit is nominated according to the first defined expectation factor. With a sequence of rigorous performance evaluations under simulation parameters, the simulation results show that the proposed version of OLSR has proliferated Quality of Service (QoS) metrics when it is compared against the state-of-the-art-based conventional protocols, namely, standard OLSR, DSDV, AOMDV and hybrid routing technique.

Integrating Elman recurrent neural network with particle swarm optimization algorithms for an improved hybrid training of multidisciplinary datasets

Abstract: There are several types of neural networks (NNs) that are widely used for data classification tasks. The supervised learning NN is an advanced network with a training algorithm for setting the weights and biases of the network in its training phase. However, traditional training algorithms such as backpropagation have some drawbacks, such as slow convergence speed and falling into local minima, which reduces the performance of the classifier. Therefore, different nature-inspired metaheuristic algorithms are integrated with the NN training algorithms to provide derivative-free solutions for complex classification problems. Consequently, this paper proposes the integration of a particle swarm optimization (PSO) algorithm with an improved Elman recurrent neural network (ERNN) to form a PSO-ERNN metaheuristic model. The key contribution of this study is the development of a new dimensional equation for ERNN architecture and the integration of PSO in ERNN learning to produce the PSO-ERNN model. The PSO is constructed to train the NN and ERNN models to achieve a fast convergence rate and avoid local minima problems. The PSO-ERNN model is validated by comparing it against the standard PSO-NN metaheuristic model and similar models from the literature. The PSO-NN and PSO-ERNN models are tested and evaluated using ten benchmark classification problems of breast cancer, heart, hepatitis, liver, wine, iris, lung cancer, yeast, Pima Indians diabetes, and ionosphere datasets. In the training phase, the results show that the PSO-ERNN model performs better than the PSO-NN model when the training set has a bigger size of samples. In the testing phase, the PSO-ERNN model outperforms the PSO-NN model for all the tested datasets except the lung cancer and yeast datasets, in which the accuracy percentage slightly decreases. In the validation phase, the PSO-ERNN model shows better performance quality in terms of accuracy percentage in six of the tested datasets. The average percentage of the training, testing, and validation accumulation show that the PSO-NN performs better than the PSO-ERNN in the lung cancer (87.27, 83.32), and heart (73.56, 70.64) datasets. On the other hand, the PSO-ERNN performs better than the PSO-NN in the iris (88.18, 86.74), hepatitis (88.60, 87.93), wine (89.16, 86.08), liver (73.56, 70.64), ionosphere (83.98, 78.94), and breast cancer (94.84, 91.17). PSO-NN and PSO-ERNN produce the same average results in the Pima Indians diabetes (84.00, 84.00) and yeast (91.31, 91.30) dataset. These results show clearly that the PSO-ERNN generally outperforms the PSO-NN when considering the overall results of the ten datasets. Nevertheless, the combinations of the PSO-NN and PSO-ERNN are proven to represent consistent and robust classification methods. The computational efficiencies of the training processes in both the PSO-NN and PSO-ERNN models are highly improved when coupled with the PSO.

An Adaptive Protection of Flooding Attacks Model for Complex Network Environments

Abstract: Currently, online organizational resources and assets are potential targets of several types of attack, the most common being flooding attacks. We consider the Distributed Denial of Service (DDoS) as the most dangerous type of flooding attack that could target those resources. The DDoS attack consumes network available resources such as bandwidth, processing power, and memory, thereby limiting or withholding accessibility to users. The Flash Crowd (FC) is quite similar to the DDoS attack whereby many legitimate users concurrently access a particular service, the number of which results in the denial of service. Researchers have proposed many different models to eliminate the risk of DDoS attacks, but only few efforts have been made to differentiate it from FC flooding as FC flooding also causes the denial of service and usually misleads the detection of the DDoS attacks. In this paper, an adaptive agent-based model, known as an Adaptive Protection of Flooding Attacks (APFA) model, is proposed to protect the Network Application Layer (NAL) against DDoS flooding attacks and FC flooding traffics. The APFA model, with the aid of an adaptive analyst agent, distinguishes between DDoS and FC abnormal traffics. It then separates DDoS botnet from Demons and Zombies to apply suitable attack handling methodology. There are three parameters on which the agent relies, normal traffic intensity, traffic attack behavior, and IP address history log, to decide on the operation of two traffic filters. We test and evaluate the APFA model via a simulation system using CIDDS as a standard dataset. The model successfully adapts to the simulated attack scenarios’ changes and determines 303,024 request conditions for the tested 135,583 IP addresses. It achieves an accuracy of 0.9964, a precision of 0.9962, and a sensitivity of 0.9996, and outperforms three tested similar models. In addition, the APFA model contributes to identifying and handling the actual trigger of DDoS attack and differentiates it from FC flooding, which is rarely implemented in one model.

Optimal Deep Learning based Convolution Neural Network for digital forensics Face Sketch Synthesis in internet of things (IoT)

Abstract: The rapid development in 5G cellular and IoT technologies is expected to be deployed widespread in the next few years. At the same time, crime rates are also increasing to a greater extent while the investigation officers are held responsible to deal with a broad range of cyber and internet issues in investigations. Therefore, advanced IT technologies and IoT devices can be deployed to ease the investigation process, especially, the identification of suspects. At present, only a few research works has been conducted upon deep learning-based Face Sketch Synthesis (FSS) models, concerning its success in diverse application domains including conventional face recognition. This paper proposes a new IoT-enabled Optimal Deep Learning based Convolutional Neural Network (ODL-CNN) for FSS to assist in suspect identification process. The hyper parameter optimization of the DL-CNN model was performed using Improved Elephant Herd Optimization (IEHO) algorithm. In the beginning, the proposed method captures the surveillance videos using IoT-based cameras which are then fed into the proposed ODL-CNN model. The proposed method initially involves preprocessing in which the contrast enhancement process is carried out using Gamma correction method. Then, the ODL-CNN model draws the sketches of the input images following which it undergoes similarity assessment, with professional sketch being drawn as per the directions from eyewitnesses. When the similarity between both the sketches are high, the suspect gets identified. A comprehensive qualitative and quantitative examination was conducted to assess the effectiveness of the presented ODL-CNN model. A detailed simulation analysis pointed out the effective performance of ODL-CNN model with maximum average Peak Signal to Noise Ratio (PSNR) of 20.11dB, Average Structural Similarity (SSIM) of 0.64 and average accuracy of 90.10%.

Intelligent Group Prediction Algorithm of GPS Trajectory Based on Vehicle Communication

Abstract: With the rapid development of in-vehicle communication technology and the integration of big data intelligent technology, intelligent algorithms for vehicle communication used to predict traffic flow and location information have been widely used Aiming at the problem that the gravitational algorithm is difficult to minimize the complex function and easily fall into the local optimum, this paper proposes an improved IGSA algorithm First, a gridding algorithm is introduced to initialize the population, and under the premise of ensuring the randomness of the initial individuals, improving the ergodicity of the population is conducive to improving the quality of the solution; then, an adaptive location-based update strategy of decreasing inertia weights is proposed this strategy inherits the advantages of linearly decreasing weights, and adaptively adjusts the weights according to the fitness value to further improve the optimization performance The optimization simulation of 8 classic test functions shows that the IGSA algorithm is an effective algorithm for solving complex optimization problems Finally, the IGSA algorithm is used to predict the geographic location problem in the vehicle GPS data The IGSA algorithm is used to optimize the extreme learning method to optimize the hyperparameters and establish a vehicle GPS data prediction model Simulation results verify the feasibility of the method

Multi-objective rain optimization algorithm with WELM model for customer churn prediction in telecommunication sector

Abstract: Customer retention is a major challenge in several business sectors and diverse companies identify the customer churn prediction (CCP) as an important process for retaining the customers. CCP in the telecommunication sector has become an essential need owing to a rise in the number of the telecommunication service providers. Recently, machine learning (ML) and deep learning (DL) models have begun to develop effective CCP model. This paper presents a new improved synthetic minority over-sampling technique (SMOTE) with optimal weighted extreme machine learning (OWELM) called the ISMOTE-OWELM model for CCP. The presented model comprises preprocessing, balancing the unbalanced dataset, and classification. The multi-objective rain optimization algorithm (MOROA) is used for two purposes: determining the optimal sampling rate of SMOTE and parameter tuning of WELM. Initially, the customer data involve data normalization and class labeling. Then, the ISMOTE is employed to handle the imbalanced dataset where the rain optimization algorithm (ROA) is applied to determine the optimal sampling rate. At last, the WELM model is applied to determine the class labels of the applied data. Extensive experimentation is carried out to ensure the ISMOTE-OWELM model against the CCP Telecommunication dataset. The simulation outcome portrayed that the ISMOTE-OWELM model is superior to other models with the accuracy of 0.94, 0.92, 0.909 on the applied dataset I, II, and III, respectively.

Computational Intelligence-Based Financial Crisis Prediction Model Using Feature Subset Selection with Optimal Deep Belief Network.

Abstract: At present times, financial decisions are mainly based on the classifier technique, which is utilized to allocate a collection of observations into fixed groups. A diverse set of data classifier ap...

IoT Solution for AI-Enabled PRIVACY-PREServing with Big Data Transferring: An Application for Healthcare Using Blockchain

Abstract: Internet of Things (IoT) performs a vital role in providing connectivity between computing devices, processes, and things. It significantly increases the communication facilities and giving up-to-date information to distributed networks. On the other hand, the techniques of artificial intelligence offer numerous and valuable services in emerging fields. An IoT-based healthcare solution facilitates patients, hospitals, and professionals to observe real-time and critical data. In the literature, most of the solution suffers from data intermission, high ethical standards, and trustworthiness communication. Moreover, network interruption with recurrent expose of sensitive and personal health data decreases the reliance on network systems. Therefore, this paper intends to propose an IoT solution for AI-enabled privacy-preserving with big data transferring using blockchain. Firstly, the proposed algorithm uses a graph-modeling to develop a scalable and reliable system for gathering and transmitting data. In addition, it extracts the subset of nodes using the artificial intelligence approach and achieves efficient services for the healthcare system. Secondly, symmetric-based digital certificates are utilized to offer authentic and confidential transmission with communication resources using blockchain. The proposed algorithm is explored with existing solutions through multiple simulations and proved improvement in terms of realistic parameters.

Data Reduction Model for Balancing Indexing and Securing Resources in the Internet-of-Things Applications

Abstract: Evolution of the Internet of Things (IoT) makes a revolution in connecting, monitoring, controlling, and managing things, objects, and almost surroundings through the Internet. To reveal the potential of IoT, rich knowledge has to be extracted, indexed, and shared securely in real time. Recent comprehensive researches on IoT spot the light on main correlative challenges, such as security, scalability, heterogeneity, and big data. Due to the heterogeneity of IoT applications that produce a large volume of a variety of data streams in real time, mining, securing, and analyzing IoT data become tedious and challenging tasks. Indexing sensory data is one of data mining techniques, which ease information retrieval. But ordinary indexing methods are not fit with such massive and dynamic data; where indexes become out-of-date once they are built. Clustering, data reduction, and summarization present promising solutions for enabling low-power security and balanced indexing. This article presents a novel method for dynamic data reduction and summarization using dynamic time warping (DTW), which also presents a balanced architecture for enabling balanced indexing based on similarity data fusion. Data reduction-based prediction models enable real-time search and secure discovery for Smart Things (SThs). The results of the proposed model were proved using real examples and data sets. Using the Szeged-weather data set similar SThs data is reduced by 95%. Thus, indexes sizes could be reduced, and using smart scheduling, crawling cycle length could be expanded.