Search

Software Defined Networking (SDN) is a paradigm shift in the network industry with decoupling of control and data plane. This helps network engineers to control and manage their network from centralized controller and troubleshoot the network at much better pace. With the benefits that SDN provides, it also has some vulnerable to attacks like Distributed Denial of Service (DDoS) that can disrupt the availability of the network. Most of the recent research work in DDoS detection and mitigation is done over Traditional network environments and packet limit strategy is used for mitigation by researchers with very less focus on redirection of illegitimate traffic which can result in less downtime and helpful in network analysis. The major contribution of this paper is detection and mitigation of DDoS in Software Defined Networks. We have created our own DDoS dataset with over 1.7 million entries. For Detection, we have used two different methods: (1) Snort (IDS) and (2) Machine Learning. In Machine Learning, we have used eight different Machine Learning algorithms that also include Ensemble Classifier and a Hybrid method of SVM-RF. We were able to get 99.1% accuracy which is a substantial growth as compared to recent works. For Mitigation, we have again used two methods: (1) Drop illegitimate traffic and (2) Redirect Illegitimate traffic. Results showed that hybrid SVM-RF algorithm works better as compared to individual Machine Learning algorithms and also as mitigation depends on Detection accuracy, so, the better the detection, the better the mitigation. In this paper detection and mitigation of DDoS has been performed over a SDN network. In which We have created our own dataset with over 1.7 million entries. For detection we have used two method: Snort (IDS), and Machine Learning and for Mitigation, Drop illegitimate traffic, and Redirect Illegitimate traffic. [ABSTRACT FROM AUTHOR]

One of the key operations in the Public Key Infrastructure (PKI) is certificate revocation management. In essence, revocation is a process to check the reliability of the certificate. A certificate is effectively deemed invalid when it is revoked, a procedure commonly referred to as PKI certificate revocation. The revoked certificates are kept on the certificate revocation list (CRL). The latest revocation list is always required by the client to validate the certificate. As a result, flooding occurs when all clients on the network request the new list at the new revoked list's publish time. There is also a rapid increase in network traffic, eventually increasing the CRL size and also utilizing high bandwidth. Flooding for updates and the rise in CRL size can cause a single point of failure. Hence, efficient revocation mechanisms are needed to manage the network. This paper proposes efficient revocation management by partitioning the CRL to manage its size and building a filter data structure (FDS) to verify the status of the certificates. Instead of parsing the entire list to check the revocation status, the novel mechanism allows us to check whether the revoked certificate is in the bloom filter. As a result, the search time is reduced to O(1) from O(n). Moreover, this paper addresses the scalability issue through partitioning and also minimizes the search retrieval time. The proposed scheme is evaluated against various schemes. The performance of the proposed scheme shows it outperforms existing schemes concerning latency, network traffic overload reduction, and scalability. [ABSTRACT FROM AUTHOR]

Recently, many image encryption algorithms have been proposed. Part of them failed to pass the cryptanalysis test and were found to be unsecure. Some others were more secure and could resist the known cryptanalysis methods. Many of those recent schemes followed a well-known model that consists of encrypting the image's pixels using a variety of techniques and methods. Many algorithms were claimed to be secure and performant to be used in real applications. This paper investigates this claim by performing a comparative analysis between a chaotic algorithm recently proposed and the standard general purpose AES cryptosystem in a web application context. The experimental tests conducted on both algorithms in this paper proved that the pixel-wise algorithms are not suitable for this kind of applications. [ABSTRACT FROM AUTHOR]

Electronic medical records have the advantages of large storage capacity, convenience, improved efficiency, etc. However, since electronic medical records contain a large amount of patient's private information, if they are stored directly in the cloud server, patients may face the risk of privacy data leakage and electronic medical record data tampering. To solve the above problems, this paper proposes a secure sharing scheme of electronic medical records combining quantum key and blockchain. Based on the true randomness of quantum keys, the multi-user secure forwarding mechanism of quantum keys is designed using proxy re-encryption technology and blockchain. A fine-grained access control scheme for electronic medical records by users with different roles was proposed using data desensitization technology. To facilitate secure retrieval from the cloud server, searchable encryption technology is used. This paper analyzes the comprehensive performance level of the proposed scheme through blockchain performance testing and system efficiency testing. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) systems generate a vast volume of data to process, and the volume of data generated by the IoT will continue to expand exponentially in the future. Due to the large-scale nature of such systems and their geographically distributed nature, how to optimally place operators and brokers for data processing across cloud, fog, and edge is the main concern of this paper. Furthermore, in the past, IoT systems relied on cloud-based brokers. If the communication between operators in an IoT application has to be regulated by a broker located in the cloud, the advantages brought by the processing of nodes located at the edge and the fog may be neglected. We consider various factors, such as the impact of different network topologies on operators and brokers, the needs of IoT application users, the performance of sensor layers, and the location characteristics of IoT sensors. In diverse placement strategies, the characteristics of the broker have been given special attention. This paper considers the combined architecture of the operator and broker on the edge, fog, and cloud as an optimization problem of minimizing computational processing and data transmission cost. We propose jointly placing the IoT application's operator and broker on the edge, fog, and cloud nodes. Then we proposed two algorithms: the low-complexity heuristic algorithm named GREEDY and the genetic algorithm called GA. Simulation results show that, in most situations, the GA placement method outperforms others and provides a near-optimal solution. [ABSTRACT FROM AUTHOR]

Harris Hawks Optimization (HHO) is a novel meta-heuristic optimization algorithm. The algorithm is inspired by the behavior of Harris Hawks collaborating with each other to pursue prey in nature. The algorithm has the advantages of simple structure, fewer parameters, easy implementation, and excellent performance on high-dimensional problems. However, the algorithm also suffers from the inability to strike a good balance between exploration and exploitation, low convergence accuracy, and slow convergence speed in the early stage. In response to these defects, this paper will introduce three strategies to the HHO: a non-negative stochastic shrinkage exponential energy function, a Cauchy-Gaussian-based dynamic variance reduction selection strategy, and a greedy-difference-based selection strategy. The improved algorithm TSHHO is analyzed on the well-established 28 benchmark test functions, and four industrial engineering design problems. The experimental results show that the TSHHO algorithm proposed in this paper can achieve a better balance in the exploration and development stages,the strategies significantly improve the search efficiency, convergence accuracy, and robustness of the algorithm. [ABSTRACT FROM AUTHOR]

With the rapid development of cloud computing, numerous large-scale workflow are executed in the cloud environment. Therefore, the workflow scheduling in cloud environment has become an emerging topic. This paper focuses on a reliability constrained multi-objective workflow scheduling problem (RCMOWSP) with the objectives of minimum execution cost and time. To solve the RCMOWSP, this paper proposes a knowledge-based multi-objective estimation of distribution algorithm (KMOEDA) with several problem-specific operators. First, an idle time-based decoding scheme is applied to sort the permutation of tasks greedily. In the global search strategy, a probability model is constructed to improve the diversity of population. Based on the problem-specific knowledge, a reliability-aware local search strategy is designed to performs local search around the solutions that violate reliability constraint. An elite enhancement strategy with a task perturbation operator and a resource perturbation operator is introduced to further improve the elite non-dominated solutions in the external archive. A comprehensive experiment is conducted to verify the performance of KMOEDA. The comparative results show that the KMOEDA significantly outperforms several relative multi-objective workflow scheduling approaches in solving the RCMOWSP. [ABSTRACT FROM AUTHOR]

Scheduling tasks in the cloud system is the main issue that needs to be addressed in order to improve customer satisfaction and system performance. This paper proposes DCOHHOTS, a novel multi-objective task scheduling algorithm based on a modified Harris hawks optimizer. In overall, this paper has two main stages. As the first step, DCOHHO is introduced as a new version of Harris Hawks Optimizer. Using the Differential Evolution algorithm, an optimal configuration is selected from the chaotic map, the opposition-based learning, and the ratio of the population. In order to improve the performance of the Harris Hawks Optimizer, this optimal configuration is applied to initialize the hawk's position. In the second stage, DCOHHOTS, a DCOHHO-based Task Scheduling algorithm, is proposed. Multi-objective behavior in the proposed task scheduling algorithm optimizes resource utilization to decrease the makespan, energy consumption, and execution cost. Moreover, prioritizing tasks before submitting them to the scheduler is done using the hierarchical process in the DCOHHOTS algorithm. For the purpose of investigating the performance of the proposed DCOHHO algorithm, a number of experiments are conducted using 20 standard functions and twelve algorithms. The experimental results demonstrate that the DCOHHO algorithm is superior at determining the optimal test function solutions. Additionally, makespan, execution cost, resource utilization, and energy efficiency of DCOHHOTS task scheduling algorithms are analyzed. Compared to existing algorithms, the proposed algorithm saves up to 16% energy in heavy loads. Additionally, resource utilization has increased by 17%. Compared to the conventional algorithm, the proposed algorithm reduced makepan and execution cost by 26% and 8%, respectively. [ABSTRACT FROM AUTHOR]

Abstract-Achieving high solution efficiency on conventional sequential computation architecture is a challenging task due to penetration of multiple renewable energy sources (RESs). This challenge has become the bottleneck for the application in real-time grid operation, grid planning and analysis of the large-scale and complicated modern power system. Therefore, this paper proposes a parallel multi-GPU and multi-process Fast Decoupled (FD) method to accelerate the power flow calculation, reducing the system responsive time and guaranteeing real-time performance on a large-scale modern power system. In this paper, two hierarchy architecture, task parallelism and data parallelism, are designed to optimize the FD solver parallelization. Moreover, the GPUDirect technology is employed to enhance efficiency of data transmission and drastically reduce copy overhead. The proposed method in this paper achieves a speedup of 9 × ∼ 33 × , compared to the single GPU on a sample large-scale power system. [ABSTRACT FROM AUTHOR]

This paper analyzes the tradeoffs between performance and resilience against cyber attacks of applications organized as workflows. The static nature of current workflows is a major benefit to attackers. To combat this advantage, a promising new approach inspired to Moving Target Defense (MTDs) was developed to increase a workflow's robustness to cyber attacks. This approach is based on dynamic reconfigurations of workflow tasks to reduce an attacker's probability of succeeding in completing the reconnaissance phase before launching an attack. Dynamic reconfigurations increase the resilience of a workflow against cyber attacks but increase its execution time due to the overhead of reconfigurations. As a part of this paper, we developed metrics that capture the impact of reconfigurations on a workflow's execution time and resilience against cyber attacks. The paper also presents recursive algorithms for computing the execution time and the reconnaissance function of a workflow. Our analysis relied on extensive trace-driven simulations of workflows from five different traces from the Workflow Trace Archive (WTA) and we used 6000 workflows from three different domains: scientific computing, engineering, and industrial. Our analysis of the results showed that there is a significant difference at the 95% confidence level due to reconfiguration on the resilience of workflows and demonstrated a consistent behavior across all five trace domains. [ABSTRACT FROM AUTHOR]

As a new network architecture, Software Defined Network (SDN) has been widely used in recent years. The continuous increase of network scale makes centralized SDN unable to meet network requirements, so distributed SDN comes into being. The application of the optimization algorithm to solve the Controller Placement Problem (CPP) can improve the performance of distributed SDN. The meta-heuristic algorithm has been widely concerned because it is not easy to fall into the local optimal solution. Based on the advantages of meta-heuristic algorithm, this paper uses the multi-point replacement method and the two-point replacement method which have low complexity to discretization African Vultures Optimization Algorithm (AVOA) in the search and development stages respectively to solve CPP in SDN. In addition, the performance of the improved optimization algorithm is compared with other algorithms on three real SDN topologies of different scales. The research results show that compared with other six latest meta-heuristic algorithms, the improved optimization algorithm in this paper can obtain the lowest average delay between the controller and switch in the shortest time. Compared with PHCPA with the best performance, IAVOA proposed in this paper improves the convergence speed of 38.16%. [ABSTRACT FROM AUTHOR]

The centralized storage and centralized authorization approach in medical information systems can lead to data tampering and private information privacy leakage, while the traditional access control model has an overly simple authentication approach, relies excessively on trusted third-party organizations for the enforcement of access control policies, and has low efficiency in processing access requests. To address these problems, this paper proposes an access control model based on the collaboration of blockchain main and side chains, AC-BMS. Firstly, a password-based authentication scheme is designed based on doctors' identity information; then Polygon side chain is designed to enhance the storage scalability of the blockchain; finally, the access node information on the main Ethereum chain is located on the side chain, and resources are obtained by executing Roll-up contracts deployed on the side chain. It is confirmed by simulation experiments in Hyperledger Fabric that the access efficiency and throughput of the blockchain access model proposed in this paper are improved when the number of accesses is multiplied, the average access time is saved by 2–3 s, the latency time is floating and stable, and the security, scalability, and availability are enhanced. [ABSTRACT FROM AUTHOR]

With the development of collaborative edge computing (CEC), the manufacturing market is gradually moving toward large-scale, multi-scenario, and dynamic directions. The existing scheduling strategies based on machine learning or deep learning are only applicable to specific scenarios, which is difficult to meet the requirements of dynamic real-time scheduling in multiple scenarios. The proposed digital twin technology provides a new solution for real-time scheduling of multiple scenarios. In this paper, a digital twin-oriented multi-scene real-time scheduler (GNN-RL) is proposed. This scheduler converts task sequences into node trees and sets up two learning layers. The first layer is an online learning representation layer, which uses GNN to learn node features of embedded structures in real time to boost large instances without additional training. The second layer is the online learning policy layer, which introduces imitation learning mappings into optimal scheduling behavior policies adapted to multiple scenarios. Finally, our approach is validated in several scenarios in 3D digital twin factories, such as computationally intensive, delay-sensitive, and task-urgent scenarios. Since the scheduler proposed in this paper learns general features of the embedding graph rather than instance-specific features, it has good generality and scalability, with good generalization and scalability, outperforming other scheduling rules and schedulers on various benchmarks. [ABSTRACT FROM AUTHOR]

Given the complexity and wide range of applications being developed for the Internet of Things (IoT) requiring an efficient mapping of application tasks in hardware resources, especially embedded systems, it is necessary to address the problem of resource optimization, taking into account constraints for energy consumption, latency, and bandwidth, among others. This paper proposes a population based multi-objective heuristic algorithm to solve the task mapping for an application into a hierarchical hardware architecture known as Wireless Network on Chip using a mathematical modeling, as well as Artificial Intelligence algorithms, that combine the strategies of neural networks and genetic algorithms. A Population Based Incremental Learning (PBIL) algorithm is used in this research to solve the task mapping problem oriented to IoT applications, allowing heterogeneous systems to be involved with different bandwidths, latencies and technologies. The optimization goals addressed in this paper are bandwidth, speedup, power consumption and communication cost. The PBIL algorithm was tested on synthetic applications with heavy workload, where performance is measured taking into account the combination of low power consumption and maximum speedup and bandwidth. Other tests carried out with the PBIL algorithm were aimed to reduce the cost of communication in task mapping for real applications such as Multi-Window Display (MWD) and MPEG4 decoder. The results obtained in both synthetic and real applications showed an improvement when Escort entropy was used compared to Renyi and Shannon. In the case of real applications, when using a 2D Mesh topology, an improvement of 15.25% for MWD and 40.32% for MPEG-4 was observed when compared to the ISFL algorithm. Also, when the Mesh-Star topology was used, better results were obtained compared to ISFL (48.74% MWD and 62.06% MPEG-4). [ABSTRACT FROM AUTHOR]

Super-computing or HPC clusters are built to provide services to execute computationally complex applications. Generally, these HPC applications involve large scale IO (input/output) processing over the networked parallel file system disks. They are commonly developed on top of the C/C++ based MPI standard library. The HPC clusters MPI–IO performance significantly depends on the particular parameter value configurations, not generally considered when writing the algorithms or programs. Therefore, this leads to poor IO and overall program performance degradation. The IO is mostly left to individual practitioners to be optimised at code level. This usually leads to unexpected consequences due to IO bandwidth degradation which becomes inevitable as the file data scales in size to petabytes. To overcome the poor IO performance, this research paper presents an approach for auto-tuning of the configuration parameters by forecasting the MPI–IO bandwidth via artificial neural networks (ANNs), a machine learning (ML) technique. These parameters are related to MPI–IO library and lustre (parallel) file system. In addition to this, we have identified a number of common configurations out of numerous possibilities, selected in the auto-tuning process of READ/WRITE operations. These configurations caused an overall READ bandwidth improvement of 65.7% with almost 83% test cases improved. In addition, the overall WRITE bandwidth improved by 83% with number of test cases improved by almost 93%. This paper demonstrates that by using auto-tuning parameters via ANNs predictions, this can significantly impact overall IO bandwidth performance. [ABSTRACT FROM AUTHOR]

It is difficult to manage massive amounts of data in an overlying environment with a single server. Therefore, it is necessary to comprehend the security provisions for erratic data in a dynamic environment. The authors are concerned about the security risk of vulnerable data in a Mobile Edge based distributive environment. As a result, edge computing appears to be an excellent perspective in which training can be done in an Edge-based environment. The combination of Edge computing and consensus approach of Blockchain in conjunction with machine learning techniques can further improve data security, mitigate the possibility of exposed data, and it reduces the risk of a data breach. As a result, the concept of federated learning provides a path for training the shared data. A dataset was collected that contained several vulnerable, exposed, recovered, and secured data and data security was precepted under the surveillance of two-factor authentication. This paper discusses the evolution of data and security flaws and their corresponding solutions in smart edge computing devices. The proposed model incorporates data security using consensus approach of Blockchain and machine learning techniques that include several classifiers and optimization techniques. Further, the authors applied the proposed algorithms in an edge computing environment by distributing several batches of data to different clients. As a result, the client privacy was maintained by using Blockchain servers. Furthermore, the authors segregated the client data into batches that were trained using the federated learning technique. The results obtained in this paper demonstrate the implementation of a Blockchain-based training model in an edge-based computing environment. [ABSTRACT FROM AUTHOR]

The widespread growth of the Internet of Things (IoT) in various application domains makes device security and data privacy a critical concern. Indeed, the continuous discovery and exchange of resources between IoT devices through central Resource Directories (RD), running on standardized application-layer protocols, such as Constrained Application Protocol (CoAP) causes trust and reliability issues. Blockchain (BC) offers a promising reliable and non-repudiable solution through consensus and decentralization. Nevertheless, its applicability in IoT environments is still challenging. This paper proposes DRDChain: a lightweight permissioned blockchain framework for discovering and consuming IoT resources. DRDChain deploys Distributed RDs (DRDs) as validating peers and constrained IoT devices as BC clients. Resource registration and discovery operations in DRDChain are modeled as smart contracts and support multiple data storage approaches. A prototype of DRDChain is implemented using Hyperledger Iroha and CoAPthon. Extensive evaluations in a realistic IoT environment have demonstrated the effectiveness and efficiency of DRDChain in terms of reliability, time, throughput, and storage size. [ABSTRACT FROM AUTHOR]

The shuttle-based storage/retrieval system (SBS/RS) is a new type of automatic warehouse system. More and more enterprises choose it because of its dense storage structure, small footprint, high efficiency, and many other advantages. Each enterprise has different requirements for system efficiency, the number of storage units, and the size of the warehouse. It makes sense to study the design of the minimum cost Shuttle-Based Storage/Retrieval System under the limitation of warehouse space size to meet enterprise requirements on the number of cargos and enterprise needs on system efficiency. An optimization model to minimize the system cost is established, and a heuristic algorithm is designed in this paper. Through the experiment, we identified that different system selection schemes and the configuration of facilities in the system under different throughput capacity requirements. The relationship between the system's total cost, unit cost, and design scheme of the system is found. This study can guide designers and planners to design a more reasonable system. Under the different needs of enterprises, build a Shuttle-Based Storage/Retrieval System with the lowest cost. [ABSTRACT FROM AUTHOR]

As a GPU has become an essential component in high performance computing, it has been attempted by many works to leverage GPU computing in Hadoop. However, few works considered to fully utilize the GPU in Hadoop and only a few works studied utilizing both CPU and GPU at the same time. In this paper, we propose a CPU-GPU hybrid scheduling in Hadoop, where both CPUs and GPUs in a node are exploited as much as possible in an adaptive manner. The technical barrier stands in that the optimal number of GPU tasks is not known in advance, and the total number of Containers in a node cannot be changed once a Hadoop job starts. In the proposed approach, we first determine the initial number of Containers as well as the hybrid execution mode, then the proposed dynamic scheduler adjusts the number of Containers for a GPU and a CPU with the help of a GPU monitor during the job execution. It also employs a load-balancing algorithm for the tail. The experiments with various benchmarks show that the proposed CPU-GPU hybrid scheduling achieves 3.87 × of speedup on average against the 12-core CPU-only Hadoop. [ABSTRACT FROM AUTHOR]

Enormous information is an accumulation of vast measures of information that contains copied things gathered from different sources. Distinguishing copied information from enormous information is a difficult issue. In this paper secure deduplication scheme has been presented for huge information stockpiling. Customers may store and transmit data effectively and efficiently due to cloud service providers. Providers of cloud services are drawn to the application of data de-duplication tools to lower storage costs and conserve bandwidth. To secure the data they share on the cloud, users of the cloud are interested in having a secure and private connection. As a result, the priory is transferred to the cloud, and the data is encrypted. Because the encryption objective conflicts with the purpose of data deduplication, this feature presents a difficult problem. The author then suggested brand-new hybrid chunking methods to boost deduplication performance in cloud storage. Content-based hybrid chunking algorithm of Two Threshold Two Divisor (TTTD) with a Dynamic Prime Coding (DPC) algorithm is suggested for reducing the deduplication data. To increase throughput, which means reducing execution time and CPU resource utilisation, an index method must be incorporated into the deduplication matching process. For chunks with higher security levels, it offers greater security protection, while for chunks with lower security levels, it trades off security for greater deduplication effectiveness. When moving data to open, semi-trusted systems like public clouds, identity management, secure data exchange, and privacy preservation become more challenging than they are in closed, trusted systems where security and privacy can be controlled more simply. Accordingly, the article proposed a cross-domain authentication technique for the verification process. Evaluations of the real-world datasets show the efficiency of the design. With other methods, the proposed hybrid Content-based TTTD-DPC analyses many performance parameters, including chunk distribution, processing time, chunking time, throughput, average chunk size, and deduplication ratio. The deduplication system's total throughput and processing speed are both enhanced by the proposed approach. In addition, the recommended methodology reduces computational cost (772 ms) in terms of hash function compared to other existing methods. [ABSTRACT FROM AUTHOR]

In recent years, face biometrics recognition systems are a wide space of a computer usage which is mostly employed for security purpose. The main purpose of the face biometrics recognition system is to authenticate a user from a given database. Due to the widespread expansion of the surveillance cameras and facial recognition technology, a robust face recognition system required. The recognition system needs to store a large number of training samples in any storage unit, that time hackers can access and control that data. So, Protecting and managing sensitive data is essential object. This requires a technique that preserve the privacy of individuals, maintain data integrity, and prevent information leakage. The storage of biometric templates on centralized servers has been associated with potential privacy risks. To address this issue, we have developed and implemented a proof-of-concept facial biometric identification system that uses a private Blockchain platform and smart contract technology. So, the proposed approach is presented a secure and tamper-proof from data breaches as well as hacks with data availability, by using the Blockchain platform to store face images. This paper aims to utilize Blockchain technology to identify individuals based on their biometric traits, specifically facial recognition system makes it tamper-proof (immutable) ensuring security. The system consists of enrolment and authentication phases. Blockchain technology uses peer-to-peer communication, cryptography, consensus processes, and smart contracts to ensure the security. The proposed approach was tested on two popular datasets: CelebFaces Attributes (CelebA) and large-scale face UTKFace datasets. The experimental results indicate that the system yields highly performance outcomes, as evidenced by the Equal Error Rate (EER) values of 0.05% and 0.07% obtained for the CelebA and UTKFace datasets, respectively. The system was compared to three baseline methods and scored the lowest Equal Error Rate. [ABSTRACT FROM AUTHOR]

In today's world, agricultural production and operation activities generate a lot of data. As a result, computer-aided agriculture applications have become a hot topic in the study, with various machine learning (ML) algorithms being used to classify agricultural data. This paper presents a comparative study consisting of a combination of ML algorithms with meta-heuristic algorithms for feature selection to improve the classification capability of ML algorithms by finding the features that significantly impact accuracy. We have used six different meta-heuristic algorithms for feature selection. Experiments are conducted on four different agricultural datasets with five classification models. To understand the effect of proposed models, the selected features are fed into the ML algorithms. The results prove that combining ML and meta-heuristic algorithms achieves higher classification accuracy with fewer features on agricultural datasets. [ABSTRACT FROM AUTHOR]

With rapid development and deployment of artificial intelligence methods, the Industrial Internet of Things (IIoT) has highly developed to fast tracing industrial communications and optimizing manufacturing processes. In Industry 5.0, hyper-automation process as one of technological trends navigates industrial entities to intelligent devices of the IIoT, cloud computing, smart robotics, smart agile software and embedded components by high complexity and reliability. By increasing data communication in the IIoT environments and cloud computing, the security and safety of hyper-automation process is also increasingly unstable and challengeable with respect to cyber-attacks, unstructured malwares and abnormal activities. With the diversification and unexpected behaviors of cyber-security threats, traditional cyber-attack detection systems have some critical problems with increasing massive data including unappropriated feature selection and extraction, high computation time in prediction and inaccurate classification models. Due to the above-mentioned challenges, this paper presents a new cloud-based cyber-attack detection architecture based on Ensemble Bagged Trees Detection (EBTD) algorithm for predicting malicious behaviors and types of cyber-attacks for hyper-automation process in the IIoT. The proposed architecture uses Analysis of Variance (ANOVA) and a priority-based feature selection and extraction model to find the optimal features with highly dependent on the network traffic, computation time, malicious behaviors, and types of attacks. Then, experimental results are conducted using the technical data sets UNSW-NB15 and NSL-KDD. The simulation results show that the proposed architecture performance performs better than other case studies and prediction models and effective on optimization of large-scale cyber-attack detection systems for critical hyper-automation process in the IIoT environment. [ABSTRACT FROM AUTHOR]

In industrial applications, mobile robot navigation involves autonomously moving towards specific target areas. Visual sensors are commonly used to identify and locate the target, enabling actions like manipulator grasping. However, when using the Yolo series for target positioning, two challenges arise. The first challenge is that the evaluation index Intersection over Union (IOU) only provides limited information and does not fully express the confidence in the target position. To overcome this, the Yolo layer utilizes a complete IOU as its loss function, which considers factors such as overlap, distance, and aspect ratio. Additionally, a Gaussian model layer is introduced between the non-maximum suppression layer and the output layer to estimate the coordinate uncertainty. The second challenge is that the prediction framework for target positioning lacks accuracy, resulting in significant deviations from the ground truth. To improve precision, this paper proposes combining the B-spline level set method for target segmentation. This technique adjusts the deviation from the minimum rectangular box surrounding the target. The proposed global optimization segmentation model, based on B-spline, effectively handles local optimal values in non-convex and traditional variational segmentation models. Experimental results demonstrate that: In the VOC dataset, compared with the Yolo-v3 method and Faster R-CNN method, the mAP of the GC Yolo-v3 method is increased by 2.95% and 5.85%, respectively, and the recall value is increased by 0.03 and 0.02, respectively. Compared with the Yolo-v3 method in VOC dataset, the average IOU value of the GC Yolo-v3 method is increased by 8.31%. In the real dataset, compared with the Yolo-v3 method and the Faster R-CNN method, the mAP of the GC Yolo-v3 method is increased by 3.32% and 7.41% respectively, and the recall value is increased by 0.08 and 0.05 respectively. The average IOU value of the GC Yolo-v3 method is 6.35% higher than that of the Yolo-v3 method in real dataset. [ABSTRACT FROM AUTHOR]

Fog computing provides a suitable development for real-time processing in the Internet of Things (IoT). Attribute-based encryption (ABE) is the main method to control data access in fog computing. A residue number system (RNS) can speed up multiplication and exponential operations by converting very large integers to small integers. This paper proposes a fine-grained lightweight access control scheme using ABE modified with RNS properties (RNS-ABE) with fog computing. Decryption is implemented with the Chinese remainder theorem (CRT), and a new access structure based on the CRT secret sharing scheme is also introduced. Security of the proposed scheme proved based on RNS properties and the complicated problem of factoring a very large integer into its large prime factors, like RSA encryption. The time cost comparison shows that the total encryption and decryption time of our scheme is more efficient than the lightweight schemes with the underlying operation of bilinear pairing. [ABSTRACT FROM AUTHOR]

With more personal devices being connected to the internet, individuals are becoming increasingly concerned about privacy. Therefore, it is important to develop machine learning algorithms that can use customer data to create personalized models while still adhering to strict privacy laws. In this paper, we propose a robust solution to this problem in a distributed, asynchronous environment with a verifiable convergence rate. Our proposed framework trains a Convolutional Neural Network on each client and sends the feature embeddings to other clients for data aggregation. This allows each client to train a deep-learning model on feature embeddings gathered from various clients in a single communication cycle. We provide a detailed description of the architecture and execution of our suggested approach. Our technique's effectiveness is evaluated by comparing it to the top central training and federated learning (FL) algorithms, and our tests on diverse datasets demonstrate that our method outperforms FL in terms of accuracy and is comparable to central training algorithms. Our findings also show that our proposed method reduces data transfer by over 75% compared to FL, resulting in significant bandwidth savings. As a result, model training can assist companies with high security and data protection concerns in setting up reliable collaboration platforms without requiring a central service provider. [ABSTRACT FROM AUTHOR]

Wavelet neural networks (WNN) have been applied in many fields to solve regression as well as classification problems. After the advent of big data, as data gets generated at a brisk pace, it is imperative to analyze it as soon as it is generated owing to the fact that the nature of the data may change dramatically in short time intervals. This is necessitated by the fact that big data is all pervasive and throws computational challenges for data scientists. Therefore, in this paper, we built an efficient Scalable, Parallelized Wavelet Neural Network (SPWNN) which employs the parallel stochastic gradient algorithm (SGD) algorithm. SPWNN is designed and developed under both static and streaming environments in the horizontal parallelization framework. SPWNN is implemented by using Morlet and Gaussian functions as activation functions. This study is conducted on big datasets like gas sensor data which has more than 4 million samples and medical research data which has more than 10,000 features, which are high dimensional in nature. The experimental analysis indicates that in the static environment, SPWNN with Morlet activation function outperformed SPWNN with Gaussian on the classification datasets. However, in the case of regression, there is no clear trend was observed. In contrast, in the streaming environment i.e., Gaussian outperformed Morlet on the classification and Morlet outperformed Gaussian on the regression datasets. Overall, the proposed SPWNN architecture achieved a speedup of 1.22 - 1.78. [ABSTRACT FROM AUTHOR]

Cloud computing systems are widely used to deploy big data-based applications because of their high storage and computation capacity. The key component for storage in cloud computing environment is distributed file system which can store and process data produced by big data-based applications effectively. The users of such big data-based applications issue read requests more frequently when compared to write requests. So, most of these cloud-based applications demand optimal performance from the distributed file system, especially for read operations. Numerous caching and prefetching techniques have been proposed in the existing literature to enhance the performance of distributed file system. However, these techniques typically adopt a synchronous approach, focusing on either application data prefetching or user data prefetching, when the user application starts executing and this may result in an extended read access time. Furthermore, the data is prefetched either based on access frequency or reuse distance with out considering the access recency of data which may result in less cache hit ratio. In this paper, we have proposed application-specific and user-specific data prefetching algorithms for prefetching the data from the distributed file system and storing the same in the multi-level caches present in the distributed file system based on the combination of access frequency and recency ranking of file blocks that were previously accessed by client application programs. Additionally, we have divided the cache into two partitions namely user and application caches to store the prefetched data as per the popularity value calculated by considering user and application level accesses. We have also introduced a parallel read algorithm to read data simultaneously from the multiple caches present in the distributed file system environment. The simulation results demonstrate that, the proposed algorithms improved the distributed file systems performance by minimum of 8 to maximum of 92 percent in terms of average read access time when compared with different existing approaches. [ABSTRACT FROM AUTHOR]

Blockchain technology has been increasingly integrated into various fields of economic and social development. However, scalability issues such as low broadcast efficiency, high communication overhead, and high redundant transmission rate have greatly limited the large-scale application of blockchain. This paper proposes a new scalability-enhanced Kademlia network protocol (SEKad), which optimizes blockchain network transmission in terms of both network topology and communication broadcast mechanism, provides a new approach to solving the scalability problem from the network layer. In SEKad protocol, firstly, SEKad employs a method that aligns the physical topology with the network topology for node clustering. This strategy groups neighboring nodes into clusters, streamlining network complexity and reducing network diameter. Secondly, SEKad presents a cluster-adaptable network topology based on Kademlia (Kad-CA). Kad-CA improves the rationality and efficiency of per-hop routing, optimizing the construction of K buckets and thus enhancing overall network efficiency. Finally, within the network transmission model, SEKad devise the smallest sub-tree broadcasting mechanism and the minimum redundant transmission mechanism for Kad-CA. These mechanisms work to reduce the redundant transmission rate, and enhance broadcasting efficiency. In order to evaluate the performance of SEKad, we built an experimental platform and conducted evaluations. The experimental results show that SEKad has better network scalability and stability, the network diameter size can be reduced by 27% and the redundant transmission rate can be reduced by 30%. [ABSTRACT FROM AUTHOR]

The Vehicular Ad Hoc Network (VANET) is a novel and innovative technology which is part of the Intelligent Transportation Systems (ITS). VANET is a network composed of a collection of vehicles and other roadside components that are interconnected wirelessly. The intention underlying the development of this technology is the improvement of the vehicle environment and the enhancement of vehicle and driver safety. Nevertheless, since VANETs operate wirelessly and under complicated conditions, they are susceptible to a variety of attacks by malicious actors. Traditional techniques such as encryption are no longer effective, so new techniques using intrusion detection systems IDS have attracted the attention of a large number of researchers. The IDS scans the entire network and identifies all the possible harmful nodes present in the network. The present paper covers the problem of the identification of attacks in VANET by using XGBoost. The effectiveness analysis of the proposed models has been realized on the NSL-KDD and 5RoutingMetrics datasets combined with various feature selection techniques Boruta and Adaptive Synthetic Sampling Approach (ADASYN). Furthermore, the acquired results are being compared to two of the last most used ensemble methods CatBoost and convolutional neural networks CNN.In comparison with the other IDSs, our model approach achieves high performance in accuracy, recall and precision. [ABSTRACT FROM AUTHOR]

User reviews can play a big part in deciding a company's income in the e-commerce industry. Before making selections regarding any product or service, online users rely on reviews. As a result, the trustworthiness of online evaluations is vital for organisations and can directly impact their reputation and revenue. Because of this, some firms pay spammers to publish false reviews. Most recent studies to detect fake reviews utilise supervised learning. However, neural network techniques, a recent form of advanced technology, have been utilised extensively to detect fake reviews and have demonstrated their ability to do so. Thus, this paper first provides a benchmark study to analyse the performance of various machine learning algorithms with different feature extraction methods on five fake review datasets to present our results. Second, we propose three advanced language models for embedding reviews into the classifiers. Third, we conduct an exhaustive feature set evaluation study to find the best features in detecting fake reviews. Fourth, we analyse the performance of traditional machine learning, deep learning, and advanced deep learning models using different feature extraction methods on five fake review datasets. Finally, we integrate the ELECTRA model with CNN which can identify real or fake reviews. Our proposed technique utilises accuracy, precision, recall, and F1 score as assessment criteria to determine the leniency of the proposed model. For deep contextualised representation and neural classification, we integrate Single-Layer Perceptron (SLP), Multi-Layer Perceptron (MLP), and Convolutional Neural Networks (CNN) following the embedding layer of unique pre-trained models like ELMo, ELECTRA, and GPT2. The experimental results indicate that our proposed model outperforms state-of-the-art methods with improvements ranging from 1 to 7% in terms of the accuracy, F1 score. To the best of our knowledge, no prior work has evaluated such advanced pre-trained models' efficiency in detecting fake reviews. Further, this research comprehensively evaluates several machine-learning approaches and feature extraction strategies for fake online review detection. [ABSTRACT FROM AUTHOR]

Concept drift is one of the most prominent issues in streaming data that machine learning models need to address. Most of the research in the field of concept drift targets updating the prediction model for recovery from concept drift. A little effort has been put into the development of a learning system that can learn drifting concepts with minimal overhead. In this paper, a dynamic ensemble classifier is designed to detect and adapt the concept drifts in streaming data. Thereupon, a novel approach- Selective Ensemble using Transfer Learning (SETL) is proposed that has the ability to adapt the new concept of data. It employs a transfer learning and a weighted majority voting scheme to enable resource optimization. It also overcomes the issues, such as negative transfer and overfitting that may occur during the process of transfer learning. The experiments are performed using real-world open-source datasets. The results indicate that SETL outperforms existing state-of-the-art algorithms for most of the datasets in terms of performance metrics such as Accuracy, F1-score, Kappa measure, precision and recall. [ABSTRACT FROM AUTHOR]

With the increasing complexity of products, the utilization of automated requirements classification in the process of requirement engineering is of positive significance to improve the efficiency of product development. There have been many experiments on the requirements classification based on artificial intelligence. However, many studies only use a single feature in semantic features or statistical features to classify requirements and put forward the problem of small-scale requirement datasets caused by the confidentiality of requirement data, which limits the application research of requirement classification in a large number of fields. Therefore, we propose a requirement classification model that integrates semantic and statistical features, and design a federated learning framework based on knowledge distillation without centralized servers in a ring architecture. In this paper, we extract a large amount of requirement data from a large number of requirement documents, and conduct experiments in the centralized learning environment and the federated learning environment respectively. The final experimental results show that our method can maintain the confidentiality of the requirement data and improve the communication efficiency in the process of model training with a slight decrease in the effect of requirement classification compared with centralized learning. [ABSTRACT FROM AUTHOR]

Recent advances in smart connected vehicles and intelligent transportation systems are based on the collection and processing of massive amounts of sensor data. There are various internal sensors integrated into modern vehicles that are useful to monitor multiple mechanical and electrical systems, and the shift to semi-autonomous vehicles adds outward-facing sensors such as cameras, lidar, and radar. Low-cost, dependable sensing, connectivity, computational capacity, and powerful analytics are ushering in a new era of vehicle context sensing and vehicular network (VANET). However, due to latency, bandwidth, cost, security, and privacy issues, as well as the growing capabilities of edge computing devices, it is necessary to examine both edge and cloud computing in order to make informed judgments based on their contexts and performances. So, in this paper, we have proposed an architecture that focuses on an intelligent transportation system based on both Cloud and Edge computing in order to monitor and analyze vehicle sensor data and its environment; known as monitoring and analyzing as a service. Our proposed architecture is able to react in real-time to any vehicle context changes in a dynamic, adaptive, and autonomous way. It generates many plans adapted to the vehicle context that will be useful for future research to achieve a self-learning and self-adaptive system. This suggested architecture helped us improve vehicle and road safety, traffic efficiency, and convenience as well as comfort to both drivers and passengers. Also, we have reduced latency and increased bandwidth. Finally, we have approved the performance of our architecture based on different evaluation metrics. [ABSTRACT FROM AUTHOR]

In network services, there are often conflicts among privacy protection, trust, and service quality, which greatly reduces the regulatory effectiveness of networks. Using the basic method of information theory, this paper considers the optimization mechanism of trust and the balance between privacy and service utility from the perspective of quantifying information flow. First, we build a trust model based on multiple factors, such as direct trust, service trust, and trust cloud network. The weight of trust factors is determined by category diversity and information entropy theory. Second, based on statistical knowledge and information entropy, we propose a new privacy measurement model with hierarchical weights. Third, we establish a trust privacy service relationship model to realize the trade-off between privacy, service, and trust in networks. The demander can choose to establish trust, protect privacy, or obtain high-quality services according to personal preferences and needs. Fourth, we propose a privacy trust mapping relationship model and a privacy disclosure selection model. Finally, we design different experimental schemes. These simulation results show that our research can not only provide better quality of service but also better protect privacy and help interactive parties in networks establish a strong trust relationship. This research will improve the effectiveness of networks and can be applied to class II vaccine multi-agent collaborative supervision based on technology. [ABSTRACT FROM AUTHOR]

For the global-scale multimedia live streaming services, both of the cost-efficiency at the service provider side and the Quality of Experience (QoE) satisfaction at the viewer side need to be achieved. This is a difficult challenge because the request patterns of global live-streaming services are highly dynamic. In this paper, we solve this issue by cloud-based adaptive resource allocation. We first present a cloud-based multi-tier architecture, called MaaS (Media as a Service), which consists of four types of modules. The main issue that we focus on is the deployment of properly dimensioned MaaS modules in proper geographical regions. We take the QoE of the Dynamic Adaptive Streaming over HTTP viewers into account for this decision. We propose a combination of deep-learning based demand prediction scheme and a dynamic-programming based heuristic to make a good tradeoff between viewers' QoE and the cloud resource cost. Extensive evaluation shows that the proposed scheme clearly outperforms the existing schemes. [ABSTRACT FROM AUTHOR]

Blockchain, a promising technology, has been extensively applied in numerous fields, such as network security, finance, and medical care. However, due to the low power consumption and weak computing power of the mobile environment, the application of blockchain in this environment still faces many challenges. Therefore, edge computing has been introduced to improve the computing power of mobile devices and encourage more mobile edge devices to join the blockchain network. In this paper, we propose a double auction model to address the issue of edge computing resource allocation in blockchain networks. Based on this auction model, we first propose a truthful double auction mechanism based on breakeven (TDAMB) to determine matched pairs of edge computing service providers (ECSPs) and miners. Furthermore, to improve the system efficiency, we propose a double auction mechanism based on a critical value (DAMCV). We also theoretically analyze the individual rationality, budget balance and truthfulness of the proposed mechanisms. Extensive experiments show that TDAMB and DAMCV have good effects on edge computing resource allocation in blockchain networks. [ABSTRACT FROM AUTHOR]

Performance is a key requirement in quality of service for cloud storage system users. Cloud storage system is complex, so the performance results may be different even under exact same experimental conditions. Many benchmarks are developed to measure performance, but there are only several research focus on performance fluctuations. In this paper, we present a generic method and two metrics to measure the performance fluctuations of a distributed file system. It analyzes the IO path and finds related factors such as storage media, network, configurations and software components. We tested the performance fluctuations of Ceph under different storage media HDD, SSD, and different workloads Webserver, Fileserver, and Mailserver. We adjust the software configuration and software components to reduce the performance fluctuations. By using Filestore, it reduces 85.4% performance fluctuations than Filestore. By using EXT4 instead of XFS, it reduces performance fluctuations by 33.2%. But reducing performance fluctuations of lower components does not always reduce the performance fluctuation of distributed file system. We reduced the performance fluctuation of the local file system by 80.7%, but the performance fluctuation of DFS by 38.0%. [ABSTRACT FROM AUTHOR]

In peer-to-peer(P2P) networks, content delivery is very critical, but there are not many relevant research results in content delivery technology. In this paper, in order to simulate content delivery in P2P mode, the number of online players is abstracted into the number of servers that can provide services, the peers write content to buffer is abstracted into the arrival of customers, and the players read content from buffer is abstracted into the service process of the servers. Based on the consideration of the effect of the number of P2P online players on energy consumption, an M/M/c queueing model with random variation in the number of servers is developed, and negative customers and preemptive priority policies are introduced. The matrix–geometric solution method and Gauss-Seidel iterative method are used to derive the performance measures of the system at steady state for two types of contents. And some numerical examples are given using Matlab for analyzing the trend of performance measures in P2P networks with parameters. The benefit function is established to obtain the parameter values that make the social benefit optimal by Nash equilibrium and social optimal strategy, and provide the theoretical basis for the scheduling of P2P peers. [ABSTRACT FROM AUTHOR]

Because of the limitations of current PCB detection methods, such as low detection accuracy and high rate of false and missed detection, a PCB defect detection algorithm based on improved RetinaNet is proposed, that is, RetinaNet-line. Firstly, the algorithm uses PVT v2B2-Hi as the backbone network of the whole model, which can not only solve the deep feature redundancy caused by the residual network in RetinaNet but also improve the feature extraction ability of the network. Then, the CARAFE up-sampling module is used to enrich the semantic features of defective targets and promote the discrimination ability of the algorithm to defective targets. Finally, HSV color space is used to process the input feature image, and the color distribution is expanded by random perturbation in H, S, and V channels, with the data enhancement completed. In this paper, experiments are conducted on the publicly shared PCB defect detection dataset from the Intelligent Open Laboratory of Peking University, and the results show that the improved algorithm achieves 94.2% in the mAP index, which is better than other networks. [ABSTRACT FROM AUTHOR]

To solve the problems of slow convergence and insufficient accuracy of traditional ant colony algorithms in solving large-scale problems, this paper proposes a multi-ant colony optimization algorithm based on game strategy and hierarchical temporal memory model (GHMACO). Firstly, the heterogeneous multi-ant colony model is constructed, and each colony collaborates to improve the performance of the algorithm. Secondly, in order to enhance the communication among the heterogeneous colonies, a non-cooperative game strategy is introduced. The heterogeneous ant colonies are divided into the propagating colony and the absorbing colonies, where the propagating colony propagates the optimal payoffs of the game, and the absorbing colonies choose optimal strategies for absorption to balance the convergence and diversity of the algorithm. Further, the hierarchical temporal memory model is adopted to perform hierarchical optimization strategies based on path memories which includes: local exploration strategy, pheromone redistribution strategy and path replacement strategy, thus improving the accuracy of the algorithm and helping the colonies to jump out of the local optimum. Experiments on the traveling salesman problem show that the improved algorithm is effective in improving the convergence and accuracy of the traditional ant colony algorithms, especially in large-scale problems. [ABSTRACT FROM AUTHOR]

Biometric cryptosystem (BCS) is an emerging field which performs user authentication in a secured environment. User authentication is handled using Biometrics and security using Cryptography, thus together forms BCS. Furthermore, the use of biometrics eliminates the need to remember passwords. The features extracted from the user's biometric are used in place of a password for user authentication. BCS unleashes the key from the secured place upon successful user authentication. This paper proposes a novel method called binary robust independent elementary features based biometric cryptosystem (BRIEFBCS) for biometric key generation. The proposed method relies on a well known cryptographic construct, Fuzzy vault scheme, for data security. The motivation behind using BRIEF scheme for biometric cryptosystem is that the obtained descriptor are compact in size, faster to implement and suitable for low memory devices. BRIEFBCS comprises of three levels, i.e., Key generation, Enrollment and Authentication. The experiments have been carried on five ear databases viz. AMI, CP, IITD-v1, IITD-v2 and USTB-v2. The proposed method's performance is evaluated and compared to state-of-the-art methods in terms of accuracy, false reject rate, vault construction time, key recovery time and Receiver Operating Characteristics curve. The proposed method has been demonstrated to outperform numerous state-of-the-art methods in both qualitative and quantitative aspects. [ABSTRACT FROM AUTHOR]

Traditional machine learning classifiers can automatically evaluate human behaviour and emotion recognition tasks. However, prior research work does not secure users' privacy and personal information because they need complete access to sensitive physiological data. The recently introduced Federated Learning (FL) paradigm can address this problem. FL allows the local model updates to be sent to a central server, combining them to create a global model. It does not allow the global model to access the raw data used to train it. Motivated by the core concept of FL, this paper proposes a novel FL-based Multi-modal Emotion Recognition System (F-MERS) framework combining EEG, GSR, ECG, and RESP physiological sensors data. It uses Multi-layer Perceptron (MLP) as a base model for classifying complex emotions in three dimensions: Valence, Arousal, and Dominance (VAD). The work validates the F-MERS framework with three emotion benchmark datasets, DEAP, AMIGOS, and DREAMER, achieving accuracies of 87.90%, 89.02%, and 79.02%, respectively. It is the first FL-enabled framework for recognizing complex emotions in three dimensions (VAD) with multi-modal physiological sensors. The proposed study assesses the F-MERS framework in two scenarios: (1). Subject dependent and (2). Subject independent, making the framework more generalized and robust. The experimental outcomes indicate that the F-MERS framework is scalable, efficient in communication, and offers privacy preservation over the baseline Non-FL MLP model. [ABSTRACT FROM AUTHOR]

In this paper, a novel machine-learning based models are presented to predict the effect of notch depth on elastic new strain-concentration factor of rectangular bars with single edge U-notch under combined loading of static tension and pure bending. Regarding the importance of this study, the database with 162 samples is utilized to develop the new methodology of machine learning based models. The database includes the notch radius, the Poisson's ratio, and the thick ratio that represent the influential inputs. The predicted key feature is the elastic new strain-concentration factor under combined loading of static tension and pure bending. These samples were tested with high precision and the predicted values of SNCF were obtained. For comparison, adaptive neural fuzzy inference system, artificial neural network, fine tree, ensemble boosted tree, and ensemble optimized bagged tree were designed and developed in this study. To evaluate and compare the performance of the models, four statistical indices of MAE, MSE, root mean square error (RMSE)and determination coefficient (R) were utilized. Based on the results, all models can predict the SNCF appropriately. However, the Ensemble optimized Bagged tree model had a better performance than other models and it had a significant priority in term of prediction accuracy. Finally, the results indicated that the elastic SNCF increased with increasing notch depth from 0.2 ≤ ho/Ho ≤ 0.7 and sharply decreases with increasing notch depth for shallow notches (0.8 ≤ ho/Ho ≤ 0.95). [ABSTRACT FROM AUTHOR]

Healthcare (HC) is among the most promising sectors for assessing Internet of things (IoT) based technological advances, as patients can use wearable or injected medical sensors to monitor medical parameters any place and at any time. The data gathered by IoT devices can be sent to medical professionals, and doctors have real-time access to their patient's data. Nevertheless, the IoT devices within the network have limited resources and minimal computing capability, causing energy conservation issues. Even though clustering saves energy in network nodes, existing clustering methods could be more effective because of the higher Energy Consumption (EC), poorly balanced network load, and enhanced end-to-end delays. Furthermore, the integrity and security of medical information have become significant issues for HC applications. This paper proposes a secure and energy-efficient data transmission (DT) framework for IoT-based HC (IoT-HC) systems using enhanced mayfly clustering-based Q learner routing (EMCQLR) and exponential key-based elliptical curve cryptography (EKECC) techniques. The proposed work consists of the following steps. Double hash biometric-based authentication (DHABA) is initially used for IoT user authorization that prevents the HC network from unauthorized data access. The cluster head (CH) is then selected using the enhanced mayfly optimization algorithm (EMOA) to build clusters of IoT medical sensors and collect data from the nodes. Data is routed to the sink node by checking for data duplication. The path-weighted Q reinforcement learning (PWQRL) model can perform data routing. Finally, the EKECC algorithm encrypts the data packets received from the body sensors, providing security to the patient's data when DT is performed over an unsecured wireless channel. The performance of the suggested system is evaluated using the energy, loss ratio, throughput, success rate, and delay. The simulation outcomes show that the proposed method outperforms existing methods. Furthermore, false data elimination check and reliability metrics show that our proposed scheme ensures information privacy, message authenticity, and integrity while requiring minimal communication overhead and computation. [ABSTRACT FROM AUTHOR]

Clustering streaming data is challenging due to many temporal dynamics, such as concept drift, concept evolution, and feature evolution. Concept evolution is the most challenging of these. Due to concept evolution, new classes may emerge or existing classes may disappear, so it is crucial to process streaming data continuously. This paper proposes a novel online clustering method, specifically for streaming data with concept evolution. It consists of three phases: initialization, clustering and outlier handling. To identify recurrences of previous data in streaming data, it is critical to preserve the sequential properties of data chunks. In the proposed model, representatives from previous windows are added to the current window, making it distinct from existing models. The detection and handling of outliers are very challenging tasks in streaming data analysis. Outliers are often the first instances of a new cluster. The proposed model stores the outliers from each data window. When the number of outliers exceeds a certain threshold, the representatives of outliers are added to the next window to identify new classes. The lack of data sets made it necessary for us to create a synthetic data set with 22020 data instances and test the model on both synthetic and real datasets. Using Silhouette Coefficient, Calinski–Harabasz index, and Davies–Bouldin index analysis, this model yielded the most favourable results. [ABSTRACT FROM AUTHOR]

The ever-increasing number of cloud services has led to the service's identification problem. It has become difficult to provide users with cloud services that meet their functional and non-functional requirements, especially as many cloud services offer the same or similar functionality but with different execution constraints (cloud characteristics, QoS, price, and so on). Service recommendation systems can solve the service's identification problem by helping users to retrieve the right cloud services according to their desired needs. However, the majority of service recommendation systems rely on user feedback to locate the user's neighbors, predict missing ratings, and rank the recommended services. As a result, users' rating histories might cause three major problems: cold start, data sparsity, and malicious attack. In order to deal with these issues, we propose in this paper a hybrid recommendation approach, called "HRPCS", that provides a list of personalized cloud services to the active user. This approach is based on user and service clustering. In this approach, cloud services are recommended based on the user's needs (functional and non-functional) and QoS preferences. Then, the services are ranked according to their prices and credibility. Further, the proposed approach returns a list of diversified cloud services. The experimental results confirmed our expectations and proved the effectiveness of our approach. [ABSTRACT FROM AUTHOR]

The internet of things (IoT) offers a vast infrastructure where numerous devices interact to collect data or perform simple processing activities. These devices are, usually, equipped with sensors, software and storage capabilities being able to process the collected data and exchange knowledge with their peers. Data and knowledge may be transferred, in an upwards mode, to the edge infrastructure and Cloud to be the subject of more complex processing. Advanced processing may be also realized upon clusters of IoT devices or edge nodes, i.e., a set of interconnected devices/nodes.Such group of nodes may work to achieve a common goal, thus, we may desire to rely on their collected data to support activities like federated learning.A training process, when necessary, may be delivered across the cluster of nodes to conclude the view of the group. In this paper, we focus on the development of a monitoring process upon the collected data and a grouping method upon multiple datasets formulated by IoT devices (hosted by edge nodes) in order to deliver the most similar ones. Our vision is to continuously identify similar datasets to support knowledge extraction through the adoption of techniques like the aforementioned federated learning. We utilize a correlation detection method combined with a probabilistic model to conclude the most similar datasets. [ABSTRACT FROM AUTHOR]

Industrial applications and automation controls are closely connected with heterogeneous Wireless Sensor Network (WSN); thus, Industrial Internet-of Thing (IIoT) enhances the productivity, scalability, and flexibility of the operations. However, in many cases such as tracking a device or service localization becomes very crucial to state back the operations at times. Existing literature show a various localization solutions, but they face the drawbacks of high energy consumption, and non-coherence in heterogeneity. Besides, in a WSN-based IIoT, non-cooperativeness exists among nodes due to various system and environmental parameters, which make the system resource-exhaustive. In this paper, we introduce a novel localization algorithm that addresses the above-mentioned problems. We call our proposed algorithm RAnge-free Power efficient COoperative Localization (RAPCOL). Specifically, the use of co-operative beacon nodes to broadcast the information to Base Station and low energy consumption highlights the novelty of the work. RAPCOL uses weight metrics for selecting optimal cooperative beacon nodes to prolong the network lifetime. We also introduce an Improvised Particle Swarm Optimization (IPSO) that credits in the contribution in RAPCOL. We run a overall nine sets of experiments to analyze the localization accuracy, effect of beacon nodes, sensor nodes, network connectivity, and sensing field, error frequency, residual energy, time, and network lifetime. A comparative study with the existing localization models shows that RAPCOL is 30 % better than the existing models in terms of accuracy and resource consumption. We observe stable performance of RAPCOL with a differentiated effect of beacon nodes and sensor nodes. We also observe that our proposed IPSO 20 % better in fast convergence to the optimal solution. Though RAPCOL localization time is 12 % higher than other existing protocols, RAPCOL's accuracy and energy saving mechanism make it efficient for IIoTs. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoTs) is a complex and large network of all kinds of equipment and things that covers various areas such as military networks, industrial networks, smart urban infrastructures, education, and many other areas, high volume of traffic, and the growing number of connected equipment. to these networks has made intrusion detection in these networks a challenging issue; Therefore, protecting these networks from various attacks is of particular importance and can be established through planning and establishing effective security controls. One of these important and effective methods of security control is the use of an intrusion detection system (IDS). Due to the ability of machine learning and deep learning methods to learn from existing real examples, they are used to prevent, predict, and intelligently and quickly track complex and unknown future examples. The most important ability and feature of these methods are to detect and predict new attacks, which in many cases are mutated or inspired by previous attacks. Therefore, IoTs control and security systems use and develop new methods in creating safe and intelligent communication between their devices and equipment, which are activated using advanced deep learning and machine methods. Also, the success and advancements of deep learning methods in various fields and fields with extensive data have made activists in the field of the internet interested in these methods. In this paper, to solve the mentioned problems and challenges, we also present a new and effective method of detection based on long short-term memory (LSTM)–recurrent neural network (RNN) and kernel principal component analysis (PCA). To achieve data preprocessing, high accuracy detection rate, feature extraction, and attack detection is embedded in an end-to-end or global detection method. We have used the NSL-KDD dataset to evaluate the results and check the presented idea. The results of our experiments and simulations show that the proposed IDS-LSTM attack detection strategy and idea has better performance than several detection and prediction strategies that use neural networks, support vector machines (SVM). [ABSTRACT FROM AUTHOR]