Load Balanced Clustering Research Articles

Design and Implementation of Virtualization Cloud Computing System Intelligent Terminal Application Layer

Cloud task scheduling has become a trend, and the shortcomings of traditional scheduling algorithms can be optimized through mathematical models of other cloud task scheduling scenarios. In order to improve the virtualization data processing effect of intelligent terminal application layer, this paper proposes an improved krill swarm optimization algorithm based on adaptive weight. The optimization of cluster load balancing and task average response time ratio are used to improve the convergence and accuracy of task scheduling algorithm. Moreover, this paper uses CloudSim simulation tool to conduct experiments to verify the effectiveness of the proposed model. In addition, this paper proposes an application-based virtualization method, which virtualizes the application programs inside the host machine into the virtualization software inside the virtual machine, so that the virtual machine can access it. Finally, this paper verifies the reliability of the proposed method with experiments, thus providing a theoretical reference for the subsequent design of intelligent terminal application layer virtualization cloud computing system. Compared with the traditional way of using physical hardware, using virtual machine hardware is more flexible, efficient and safe, which brings great convenience to the development and deployment of applications.

Container Scheduling Algorithms for Distributed Cloud Environments

Due to the difficulty of existing container scheduling algorithms to adapt to large-scale complex scenarios and meet the diverse application and load requirements, this study delves into a groundbreaking hybrid scheduling approach that melds Deep Deterministic Policy Gradient (DDPG) with a Genetic Algorithm (GA). The proposed method initially employs a container grouping policy to reduce the overhead associated with frequent inter-container calls. Subsequently, to address the computational inefficiency of large-scale scheduling, a genetic algorithm is utilized for rapid global optimization. To overcome the problem of genetic algorithms being highly susceptible to falling into local optimality, the DDPG algorithm is applied for local optimization, with a cross-mutation operation introduced to escape local optima. The experimental outcomes demonstrate that the proposed algorithm enhances cluster load balancing by 81.13%, improves the fitness function by 3.26%, reduces completion time by 19.06%, and decreases container dependency overhead by 2.75%. Furthermore, under the experimental conditions, the system performs best when the group size is 10. This research offers a novel paradigm for the development of container scheduling algorithms in distributed intelligent data clouds, advancing the field of resource management in cloud computing environments.

Optimized Resource Management and Dynamic Routing Protocol for Wireless Sensor Networks Through Load Balancing, Packet Scheduling, and Intelligent Clustering

Heterogeneous Wireless Sensor Networks (HWSNs) are pivotal for providing weather-related event data, enabling universal location access, and facilitating remote monitoring through multi-hop transmission. Efficient energy utilization is critical in ensuring the optimal functioning of HWSNs. Previously, Compressive Sensing (CS) technology was established to enhance communication efficiency within HWSNs. While previous methods were effective in managing energy consumption and reducing transmission delays across network devices, the increased number of devices has impacted their efficacy. Consequently, energy becomes a vital limitation in constructing HWSNs. In order to address these challenges, this study introduces Load Balancing and Packet Scheduling with Intelligent Clustering based Improved Routing Protocol (LPICR). This integrates load balancing, packet scheduling, intelligent clustering, and enhanced routing techniques. The protocol is structured into three main categories: intelligent route selection, load balancing-based Cluster Head (CH) selection, and path scheduling. Initially, an efficient opportunistic routing is conducted by the intelligent route selection process. This routing method minimizes data forwarding during communication and significantly decreases energy consumption in the HWSN. Furthermore, by using a load balancing-oriented procedure for selecting cluster heads, the system achieves efficient determination of cluster heads and construction of clusters, resulting in the most efficient use of energy in communication. Path scheduling reduces the probability of delays by facilitating effective data flow between the source and destination in the HWSN. The NS2 platform is used to implement the proposed LPICR-HWSN protocol. The calculation of the result and comparison analysis is considered for the parameters are Data loss rate, communication time, packet success rate, malicious detection ratio, throughput, Routing overhead and energy efficiency. The results are thoroughly investigated by accounting for factors like the quantity of nodes and the varying speed of the network. To assess the efficacy of this proposed protocol, we conduct a comparative analysis using established methodologies such as CDAS-WSN, EEPC-WSN, TCCS-WSN, and MTODS-HWSN. The results suggest that the proffered LPICR-HWSN model demonstrates superior performance compared to previous methods.

Intelligent Education Managemnt System Design for Universities based on MTCNN Face Recognition Algorithm

Face recognition technique has made significant advancements in security and attendance, but its application in teaching management is minimal. To address the issues of insufficient teacher resources and declining educational quality, the paper designs an intelligent education management system for colleges and universities based on improved Multi-task Cascaded Convolutional Neural Networks (MTCNN) face recognition. The purpose is to achieve accurate recognition of faces through improved facial recognition technology, thereby analyzing the attendance status of students, and improving the efficiency and quality of educational resource utilization. Firstly, an improved MTCNN facial recognition technology is adopted to achieve realtime monitoring of student status and attendance in the classroom through a B/S network structure. Secondly, through cluster deployment and load balancing, system stability and response speed can be improved. The results indicated that the improved MTCNN had better facial recognition accuracy and GPU utilization than traditional systems under different occlusion conditions. When there was no occlusion, recognition accuracy was 99.4%. However, when occlusion was presented at 10%, 20%, and 30%, the accuracy dropped to 92.3%, 84.25%, and 73.4%, respectively. Additionally, when the number of concurrent users was 1000, the maximum GPU utilization rate was 75%, which was 11% lower than traditional MTCNN systems. The use of an improved MTCNN facial recognition-based intelligent education management system in universities can effectively enhance the quality of classroom teaching and monitor the status of students. Further optimization of algorithm performance is needed in subsequent research to support larger-scale concurrent user usage while reducing hardware resource consumption.

Load balanced and optimal clustering in WSNs using grey wolf optimizer

Load balanced and optimal clustering in WSNs using grey wolf optimizer

IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks

IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks

Exploration of Energy Meter Data Security and Fast Response Technology in Spot Power Trading

Abstract With the advancement of smart grid construction, higher requirements have been put forward for energy meter data, which need to realize real-time, accurate, efficient, safe, and economical data transmission. In this paper, an intelligent collection of energy meter data is designed to monitor energy meter data. The PCA algorithm is utilized to downscale the energy meter data, and the LMR algorithm is combined to monitor abnormal data from the meter. Based on the smart contract in blockchain technology, a parallel Pedersen commitment algorithm based on privacy protection is designed, a hybrid signature algorithm is created to ensure the secure transmission of energy meter data and a cluster load balancing model for energy meter data is also designed in combination with Hopfield neural network. The PCA-LMR algorithm identifies 95 anomalies of the data in 12 months and under the encryption of a smart contract. The packet loss rate of energy meter data is maintained at about 2%, and after optimizing the cluster load capacity of energy meter data using the Hopfield neural network, the cluster load variance value is about 1.84 in 20 h. Modern technology can improve the secure transmission of energy meter data and enhance its rapid response ability to ensure the economic benefits of the power system.

Optimization of Task-Scheduling Strategy in Edge Kubernetes Clusters Based on Deep Reinforcement Learning

Kubernetes, known for its versatility in infrastructure management, rapid scalability, and ease of deployment, makes it an excellent platform for edge computing. However, its native scheduling algorithm struggles with load balancing, especially during peak task deployment in edge environments characterized by resource limitations and low latency demands. To address this issue, a proximal policy optimization with the least response time (PPO-LRT) algorithm was proposed in this paper. This deep reinforcement learning approach learns the pod-scheduling process, which can adaptively schedule edge tasks to the most suitable worker nodes with the shortest response time according to the current cluster load and pod state. To evaluate the effectiveness of the proposed algorithm, multiple virtual machines were created, and we built a heterogeneous node cluster. Additionally, we deployed k3s, a Kubernetes distribution suited for edge environments, on the cluster. The load balancing, high load resilience, and average response time during peak task deployment were tested by initiating numerous tasks within a limited time frame. The results validate that the PPO-LRT-based scheduler shows superior performance in cluster load balancing compared to the Kube scheduler. After the deployment of 500 random tasks, several cluster nodes become overwhelmed by using the Kube scheduler, whereas the PPO-LRT-based scheduler evenly allocates the workload across the cluster, reducing the average response time by approximately 31%.

Load Balanced Clustering in Wireless Sensor Networks Using Grey Wolf Optimization

Load Balanced Clustering in Wireless Sensor Networks Using Grey Wolf Optimization

CRLM: A cooperative model based on reinforcement learning and metaheuristic algorithms of routing protocols in wireless sensor networks

In wireless sensor networks, reasonable clustering and routing are keys to efficient energy utilization. However, the selection of cluster heads and routes is NP-hard. Most of the existing routing protocols use heuristic or metaheuristic optimization algorithms to solve this problem. Most protocols regard the selection of the cluster head and routing as two independent problems. However, the selection of cluster heads will affect the selection of routes, and there is a certain relationship between the two stages. Therefore, considering these two problems independently, the solution obtained is not necessarily the optimal solution in the network. In addition, most of the existing routing protocols are still subject to conventional clustering and conventional multi-hop communication in the network, which is extremely unfavorable for reducing the energy consumption of nodes. In this paper, we propose a cooperative model based on reinforcement learning and metaheuristic algorithms called CRLM, in which we use reinforcement learning to enhance the merit-seeking capability of the metaheuristic algorithm and use the algorithm to solve network communication schemes (clustering and routing are considered as one phase). The communication scheme also achieves load balancing of clusters within the network through pruning and employs a novel multi-hop model to reduce network energy waste. Compared to E-ALWO, ChOA-HGS, GATERP, GWO, IPSO-GWO, and LEACH, CRLM has 56%, 95%, 34.5%, 85.7%, 116.7%, and 140.7% improvements in network lifetime.

Hybrid Chameleon Search and Remora Optimization Algorithm‐based Dynamic Heterogeneous load balancing clustering protocol for extending the lifetime of wireless sensor networks

SummaryClustering is an indispensable strategy that helps towards the extension of lifetime of each sensor nodes with energy stability in wireless sensor networks (WSNs). This clustering process aids in sustaining energy efficiency and extended network lifetime in sensitive and critical real‐life applications that include landslide monitoring and military applications. The dynamic characteristics of WSNs and several cluster configurations introduce challenge in the process of searching an ideal network structure, a herculean challenge. In this paper, Hybrid Chameleon Search and Remora Optimization Algorithm‐based Dynamic Clustering Method (HCSROA) is proposed for dynamic optimization of wireless sensor node clusters. It utilized the global searching process of Chameleon Search Algorithm for selecting potential cluster head (CH) selection with balanced trade‐off between intensification and extensification. It determines an ideal dynamic network structure based on factors that include quantity of nodes in the neighborhood, distance to sink, predictable energy utilization rate, and residual energy into account during the formulation of fitness function. It specifically achieved sink node mobility through the integration of the local searching capability of Improved Remora Optimization Algorithm for determining the optimal points of deployment over which the packets can be forwarded from the CH of the cluster to the sink node. This proposed HCSROA scheme compared in contrast to standard methods is identified to greatly prolong network lifetime by 29.21% and maintain energy stability by 25.64% in contrast to baseline protocols taken for investigation.

Load balancing clustering and routing for IoT‐enabled wireless sensor networks

AbstractInternet of things (IoT) devices are equipped with a number of interconnected sensor nodes that relies on ubiquitous connectivity between sensor devices to optimize information automation processes. Because of the extensive deployments in adverse areas and unsupervised nature of wireless sensor networks (WSNs), energy efficiency is a significant aim in these networks. Network survival time can be extended by optimizing its energy consumption. It has been a complex struggle for researchers to develop energy‐efficient routing protocols in the field of WSNs. Energy consumption, path reliability and Quality of Service (QoS) in WSNs became important factors to be focused on enforcing an efficient routing strategy. A hybrid optimization technique presented in this paper is a combination of fuzzy c‐means and Grey Wolf optimization (GWO) techniques for clustering. The proposed scheme was evaluated on different parameters such as total energy consumed, packet delivery ratio, packet drop rate, throughput, delay, remaining energy and total network lifetime. According to the results of the simulation, the proposed scheme improves energy efficiency and throughput by about 30% and packet delivery ratio and latency by about 10%, compared with existing protocols such as Chemical Reaction Approach based Cluster Formation (CHRA), Hybrid Optimal Based Cluster Formation (HOBCF), GWO‐based clustering (GWO‐C) and Cat Swarm Optimization based Energy‐Efficient Reliable sectoring Scheme with prediction algorithms (P_CSO_EERSS). The study concludes that the protocol suitable for creating IoT monitoring system network lifetime is an important criteria.

Adaptive load balancing in cluster computing environment

Adaptive load balancing in cluster computing environment

A Parallel Intelligence-Driven Resource Scheduling Scheme for Digital Twins-Based Intelligent Vehicular Systems

Real-time digital twin technology can enhance traffic safety of intelligent vehicular system and provide scientific strategies for intelligent traffic management. At the same time, real-time digital twin depends on strong computation from vehicle side to cloud side. Aiming at the problem of delay caused by the dual dependency of timing and data between computation tasks, and the problem of unbalanced load of mobile edge computing servers, a parallel intelligence-driven resource scheduling scheme for computation tasks with dual dependencies of timing and data in the intelligent vehicular systems (IVS) is proposed. First, the delay and energy consumption models of each computing platform are formulated by considering the dual dependence of sub-tasks. Then, based on the bidding idea of the auction algorithm, the allocation model of computing resources and communication resources is defined, and the load balance model of the mobile edge computing (MEC) server cluster is formulated according to the load status of each MEC server. Secondly, joint optimization problem for offloading, resource allocation, and load balance is formulated. Finally, an adaptive particle swarm with genetic algorithm is proposed to solve the optimization problem. The simulation results show that the proposed scheme can reduce the total cost of the system while satisfying the maximum tolerable delay, and effectively improve the load balance of the edge server cluster.

A container deployment strategy for server clusters with different resource types

AbstractThe method of deploying microservices based on container technology is widely used in cloud environments. This method can realize the rapid deployment of microservices and improve the resource utilization of cloud datacenters. However, resource allocation and deployment of container‐based microservices are key issues. With the continuous growth of computing‐ and storage‐intensive services, it is necessary to consider the deployment of microservices of different business types. This study establishes a multi‐objective optimization problem model with the similarity between containers and servers, load balance of clusters, and reliability of microservice execution as the optimization objectives. An improved artificial fish swarm algorithm is proposed for the container deployment of computing‐ and storage‐intensive microservices. The comprehensive experimental results show that, compared with the existing deployment strategies, the matching degree between the container and server, cluster load balance value, service execution reliability, and other performance parameters are improved while shortening the running time of the algorithm. In addition, under the constraint of load balancing, the resource utilization of the computing and storage server clusters is improved.

An In-depth Comparative Analysis of Cloud Block Storage Workloads: Findings and Implications

Cloud block storage systems support diverse types of applications in modern cloud services. Characterizing their input/output (I/O) activities is critical for guiding better system designs and optimizations. In this article, we present an in-depth comparative analysis of production cloud block storage workloads through the block-level I/O traces of billions of I/O requests collected from two production systems, Alibaba Cloud and Tencent Cloud Block Storage. We study their characteristics of load intensities, spatial patterns, and temporal patterns. We also compare the cloud block storage workloads with the notable public block-level I/O workloads from the enterprise data centers at Microsoft Research Cambridge, and we identify the commonalities and differences of the three sources of traces. To this end, we provide 6 findings through the high-level analysis and 16 findings through the detailed analysis on load intensity, spatial patterns, and temporal patterns. We discuss the implications of our findings on load balancing, cache efficiency, and storage cluster management in cloud block storage systems.

Genetic Algorithm with Random and Memory Immigrant Strategies for Solving Dynamic Load Balanced Clustering Problem in Wireless Sensor Networks

In Wireless Sensor Networks (WSNs), clustering is an effective method to distribute the load equally among all the nodes as compared to flat network architecture. Due to the dynamic nature of the network, the clustering process can be viewed as a dynamic optimization problem and the conventional computational intelligence techniques are not enough to solve these problems. The Dynamic Genetic Algorithm (DGA) addresses these problems with the help of searching optimal solutions in new environments. Therefore the dynamic load-balanced clustering process is modeled using the basic components of standard genetic algorithm and then the model is enhanced is using immigrants and memory-based schemes to elect suitable cluster heads. The metrics nodes’ residual energy level, node centrality, and mobility speed of the nodes are considered to elect the load-balanced cluster heads and the optimal number of cluster members are assigned to each cluster head using the proposed DGA schemes such as Random Immigrants Genetic Approach (RIGA), Memory Immigrants Genetic Approach (MIGA), and Memory and Random Immigrants Genetic Approach (MRIGA). The simulation results show that the proposed DGA scheme MRIGA outperforms well as compared with RIGA and MIGA in terms of various performance metrics such as the number of nodes alive, residual energy level, packet delivery ratio, end-to-end delay, and overhead for the formation of clusters.

Improved Load-Balanced Clustering for Energy-Aware Routing (ILBC-EAR) in WSNs

Sensors are considered as important elements of electronic devices. In many applications and service, Wireless Sensor Networks (WSNs) are involved in significant data sharing that are delivered to the sink node in energy efficient manner using multi-hop communications. But, the major challenge in WSN is the nodes are having limited battery resources, it is important to monitor the consumption rate of energy is very much needed. However, reducing energy consumption can increase the network lifetime in effective manner. For that, clustering methods are widely used for optimizing the rate of energy consumption among the sensor nodes. In that concern, this paper involves in deriving a novel model called Improved Load-Balanced Clustering for Energy-Aware Routing (ILBC-EAR), which mainly concentrates on optimal energy utilization with load-balanced process among cluster heads and member nodes. For providing equal rate of energy consumption among nodes, the dimensions of framed clusters are measured. Moreover, the model develops a Finest Routing Scheme based on Load-Balanced Clustering to transmit the sensed information to the sink or base station. The evaluation results depict that the derived energy aware model attains higher rate of life time than other works and also achieves balanced energy rate among head node. Additionally, the model also provides higher throughput and minimal delay in delivering data packets.

Genetic-Chicken Swarm Algorithm for Minimizing Energy in Wireless Sensor Network

Wireless Sensor Network (WSN) technology is the real-time application that is growing rapidly as the result of smart environments. Battery power is one of the most significant resources in WSN. For enhancing a power factor, the clustering techniques are used. During the forward of data in WSN, more power is consumed. In the existing system, it works with Load Balanced Clustering Method (LBCM) and provides the lifespan of the network with scalability and reliability. In the existing system, it does not deal with end-to-end delay and delivery of packets. For overcoming these issues in WSN, the proposed Genetic Algorithm based on Chicken Swarm Optimization (GA-CSO) with Load Balanced Clustering Method (LBCM) is used. Genetic Algorithm generates chromosomes in an arbitrary method then the chromosomes values are calculated using Fitness Function. Chicken Swarm Optimization (CSO) helps to solve the complex optimization problems. Also, it consists of chickens, hens, and rooster. It divides the chicken into clusters. Load Balanced Clustering Method (LBCM) maintains the energy during communication among the sensor nodes and also it balances the load in the gateways. The proposed GA-CSO with LBCM improves the lifespan of the network. Moreover, it minimizes the energy consumption and also balances the load over the network. The proposed method outperforms by using the following metrics such as energy efficiency, ratio of packet delivery, throughput of the network, lifetime of the sensor nodes. Therefore, the evaluation result shows the energy efficiency that has achieved 83.56% and the delivery ratio of the packet has reached 99.12%. Also, it has attained linear standard deviation and reduced the end-to-end delay as 97.32 ms.

Fuzzy Logic Based Load Balanced Clustering for Network Lifetime Enhancement in WSN

Large number of small sensor nodes exists in WSN’s for sensing and collecting information from the environment. In today’s time, these sensor nodes were applied in under water, military area, health care, earthquake sensing and in dedicated areas with recent technologies. Sensor nodes have limited life time and have supplementary network life. Network lifecycle depends on many factors such as connectivity, residual energy, topology types, single hop, multi hop, distance from base station, distance to cluster heads and much more. Among the various solutions given, clustering is considered to be good solution and optimal cluster head selection leads to efficient energy consumption. This paper proposes fuzzy based multi-attributes clustering that balances load among sensor nodes and also gives energy efficient clustering. Here we have used some attributes such as delay, residual energy, distance to CH, standard deviation to average network lifetime and standard deviation to residual energy. Results and experimental analysis validates that the proposed methods outperforms other compared algorithms.