Search

The Internet of Things (IoT) is a network of physical items implanted with software, sensors, etc., to link and exchange data with other devices. These devices vary in complexity from common household items to sophisticated industrial instruments. It would be challenging to choose an appropriate IoT service based on the requirements of the vast pool of accessible services with similar capabilities, given the growth of IoT-based service providers in the market. A suitable selection may be made using quality-of-service (QoS) parameters that characterize a service. IoT has several benefits over traditional communication systems. Also, it is a component of a safe and smart city system known as the Industrial Internet of Things (IIoT) which is particularly useful in the industrial field. However, it suffers from various issues such as high costs, energy consumption, and long delays. The production scheduling problem is one of the main issues in IIoT, and it is an NP-hard problem regarding cost and energy efficiency. Therefore, a meta-heuristic algorithm based on the elephant herd optimization algorithm is proposed to minimize resource costs, conversion costs, and the cost of continuous development delays. By combining the clan updating factor, separating operator, and the proposed algorithm, we created an effective and efficient method to solve the issue of production scheduling. Many experiments are performed to determine the performance of industrial environments. The outcomes demonstrate that the suggested technique can optimize planning and achieve cost reduction, efficient energy consumption, and latency decrease. [ABSTRACT FROM AUTHOR]

With the galloping progress of the Internet of Things (IoT) and related technologies in multiple facets of science, distribution environments, namely cloud, edge, fog, Internet of Drones (IoD), and Internet of Vehicles (IoV), carry special attention due to their providing a resilient infrastructure in which users can be sure of a secure connection among smart devices in the network. By considering particular parameters which overshadow the resiliency in distributed environments, we found several gaps in the investigated review papers that did not comprehensively touch on significantly related topics as we did. So, based on the resilient and dependable management approaches, we put forward a beneficial evaluation in this regard. As a novel taxonomy of distributed environments, we presented a well-organized classification of distributed systems. At the terminal stage, we selected 37 papers in the research process. We classified our categories into seven divisions and separately investigated each one their main ideas, advantages, challenges, and strategies, checking whether they involved security issues or not, simulation environments, datasets, and their environments to draw a cohesive taxonomy of reliable methods in terms of qualitative in distributed computing environments. This well-performed comparison enables us to evaluate all papers comprehensively and analyze their advantages and drawbacks. The SLR review indicated that security, latency, and fault tolerance are the most frequent parameters utilized in studied papers that show they play pivotal roles in the resiliency management of distributed environments. Most of the articles reviewed were published in 2020 and 2021. Besides, we proposed several future works based on existing deficiencies that can be considered for further studies. [ABSTRACT FROM AUTHOR]

In the distributed database systems, the relations needed by a query can be kept in several locations. This process significantly increases potential corresponding Query Execution Plans (QEP's) for a user query. Henceforth, in addition to the expense of local computing, the charge of transferring data between different cloud sites should also be considered. It does not sound logical to investigate all potential query plans in a high setting like this. The best query plan (regarding cost) must be generated for processing a given query. A new hybrid multi-objective genetic and bat algorithm, a Multi-Objective Genetic Algorithm with BAT (MOGABAT), is used in the present article to produce the best query plans. The functionality comparison is made on different join graph structures, among MOGABAT, Multi-Objective BAT (MOBAT), and Non-dominated Sorting Genetic Algorithm II (NSGA-II). The obtained results have shown that the quality of generated query plans is enhanced for the join graph structures. Nevertheless, more execution time is needed. [ABSTRACT FROM AUTHOR]

Cloud computing enables businesses to decrease the total costs by outsourcing their required services. Therefore, it provides a new challenge of data protection regarding reliability, integrity, and confidentiality because of outsourcing. As a result, cloud security is becoming a key differentiator and competitive edge between cloud providers. Nowadays, the use of blockchain in cloud computing is one of the most common innovations that can solve cloud computing security problems. Blockchain is a decentralized data management technology to provide security, anonymity, and data integrity without any third-party organization. This work presents a comprehensive study of cloud computing security concerns and blockchain solutions to address these concerns. Applying different filters and searching international databases, 21 articles from reputable journals are found and reviewed. We examine cloud security in three categories: data integration, trust, and privacy. The results show that blockchain provides a successful platform in this regard. However, security issues are one of the most important challenges that still need further study. The article also provides a roadmap framework for future research and action. [ABSTRACT FROM AUTHOR]

Internet of things has become an essential principle of human life with the widespread acceptance of intelligent environments, where everyday objects can communicate through the internet. Mobility is the most critical factor in today's internet of things devices to apply in real-world applications. Also, proper routing protocol plays a vital role in communication and reduces devices' energy consumption. The clustering approach is one of the efficient routing techniques to improve energy consumption and enhance network life. Due to the NP-Hard nature of clustering, a krill herd optimization algorithm is proposed in this paper to select the cluster head nodes and intermediate nodes required for routing. The simulation results using NS-3 confirmed that the proposed technique performs better than particle swarm optimization and cuckoo search in terms of network lifetime. The proposed technique increases the total network lifetime by at least 11.1% compared to the current clustering methods. [ABSTRACT FROM AUTHOR]

Today, cloud providers represent their individual services with several functional and non-functional properties in various environments. Discovering and selecting an appropriate atomic service from a pool of activated services are a main challenge in the multi-cloud service composition. Minimizing the number of cloud providers is a critical matter in the service composition problem, which effects on energy consumption, response time and total cost. This paper presents a hybrid formal verification approach to assess the service composition in multi-cloud environments though the decreasing number of cloud providers to gain final service composition with a high level of Quality of Service (QoS). The presented approach provides behavioral modeling to examine the procedure of user' requests, service selection, and composition in a multi-cloud environment. Also, the proposed approach permits analysis of the service composition using a Multi-Labeled Transition Systems (MLTS)-based model checking and Pi-Calculus-based process algebra methods for monitoring the functional specifications and non-functional properties as the QoS standards. In addition, the proposed approach satisfies the functional properties for the multi-cloud service composition. The experimental results proved the feasibility of the proposed approach with performance evaluations and some confirmation setups. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) has the idea of receiving data and sending them for each object within the communication network. One of the main issues in this type of networks is handling a growing volume of data with various data sources and data types to satisfy the performance requirements of applications. In this regard, data management in the IoT plays an important role in its efficient operations and has become a major research topic. However, the data management has a crucial role in the IoT, there is not any comprehensive and systematic work to analyze its approaches. Thus, main propose of this paper is to systematically review and study the existing data management approaches in the IoT. The data management approaches are classified into three main classes, including SQL database, NoSQL database, and graph database. In addition, the detailed comparison of the important mechanisms in each category brings a recommendation for further works. [ABSTRACT FROM AUTHOR]

In a cloud environment, scheduling problem as an NP-complete problem can be solved using various metaheuristic algorithms. The metaheuristic algorithms are very popular for scheduling tasks because of their effectiveness. A bacterial foraging is a swarm intelligence algorithm inspired by the foraging and chemotactic phenomenon of bacteria. This paper proposes a task scheduling algorithm based on bacterial foraging optimization to reduce the idle time of virtual machines whereas the load balancing and reducing of runtime have occurred. The Cloudsim toolkit has assessed the performance of the proposed method in comparison with some scheduling algorithms. According to the obtained results, the makespan and energy consumption were reduced by using the proposed algorithm. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a new information technology sector in which each device may receive and distribute data across a network. Industrial IoT (IIoT) and related areas, such as Industrial Wireless Networks (IWNs), big data, and cloud computing, have made significant strides recently. Using IIoT requires a reliable and effective data collection system, such as a spanning tree. Many previous spanning tree algorithms ignore failure and mobility. In such cases, the spanning tree is broken, making data delivery to the base station difficult. This study proposes an algorithm to construct an optimal spanning tree by combining an artificial bee colony, genetic operators, and density correlation degree to make suitable trees. The trees’ fitness is measured using hop count distances of the devices from the base station, residual energy of the devices, and their mobility probabilities in this technique. The simulation outcomes highlight the enhanced data collection reliability achieved by the suggested algorithm when compared to established methods like the Reliable Spanning Tree (RST) construction algorithm in IIoT and the Hop Count Distance (HCD) based construction algorithm. This proposed algorithm shows improved reliability across diverse node numbers, considering key parameters including reliability, energy consumption, displacement probability, and distance. [ABSTRACT FROM AUTHOR]