scholarly journals ACPEC: A Resource Management Scheme Based on Ant Colony Algorithm for Power Edge Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Zhu Liu ◽  
Xuesong Qiu ◽  
Nan Zhang

With the development of power IoTs (Internet of Things) technology, more and more intelligent devices access the network. Cloud computing is used to provide the resource storage and task computing services for power network. However, there are many problems with traditional cloud computing such as the long-time delay and resource bottleneck. Therefore, in this paper, a two-level resource management scheme is put forward based on the idea of edge computing. Furthermore, a new task scheduling algorithm is presented based on the ant colony algorithm, which realized the resource sharing and dynamic scheduling. The data of simulation show that this algorithm has a good effect on the performance of task execution time, power consumption, and so on.

2021 ◽  
pp. 08-25
Author(s):  
Mustafa El .. ◽  
◽  
◽  
Aaras Y Y.Kraidi

The crowd-creation space is a manifestation of the development of innovation theory to a certain stage. With the creation of the crowd-creation space, the problem of optimizing the resource allocation of the crowd-creation space has become a research hotspot. The emergence of cloud computing provides a new idea for solving the problem of resource allocation. Common cloud computing resource allocation algorithms include genetic algorithms, simulated annealing algorithms, and ant colony algorithms. These algorithms have their obvious shortcomings, which are not conducive to solving the problem of optimal resource allocation for crowd-creation space computing. Based on this, this paper proposes an In the cloud computing environment, the algorithm for optimizing resource allocation for crowd-creation space computing adopts a combination of genetic algorithm and ant colony algorithm and optimizes it by citing some mechanisms of simulated annealing algorithm. The algorithm in this paper is an improved genetic ant colony algorithm (HGAACO). In this paper, the feasibility of the algorithm is verified through experiments. The experimental results show that with 20 tasks, the ant colony algorithm task allocation time is 93ms, the genetic ant colony algorithm time is 90ms, and the improved algorithm task allocation time proposed in this paper is 74ms, obviously superior. The algorithm proposed in this paper has a certain reference value for solving the creative space computing optimization resource allocation.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Tao Cong ◽  
Lin Jiang ◽  
Qihang Sun ◽  
Yang Li

With the rapid development of big data, big data research in the security protection industry has been increasingly regarded as a hot spot. This article mainly aims at solving the problem of predicting the tendency of juvenile delinquency based on the experimental data of juvenile blindly following psychological crime. To solve this problem, this paper proposes a rough ant colony classification algorithm, referred to as RoughAC, which first uses the concept of upper and lower approximate sets in rough sets to determine the degree of membership. In addition, in the ant colony algorithm, we use the membership value to update the pheromone. Experiments show that the algorithm can not only solve the premature convergence problem caused by stagnation near the local optimal solution but also solve the continuous domain and combinatorial optimization problems and achieve better classification results. Moreover, the algorithm has a good effect on predicting classification and can provide guidance for predicting the tendency of juvenile delinquency.


2018 ◽  
Vol 11 (5) ◽  
pp. 79-90
Author(s):  
Zhi-hui Shang ◽  
Jian-wei Zhang ◽  
Xiao-hua Wang ◽  
Hong-jin Li ◽  
Xu Luo

2022 ◽  
Vol 2022 ◽  
pp. 1-14
Author(s):  
Zhenzhong Zhang ◽  
Wei Sun ◽  
Yanliang Yu

With the vigorous development of the Internet of Things, the Internet, cloud computing, and mobile terminals, edge computing has emerged as a new type of Internet of Things technology, which is one of the important components of the Industrial Internet of Things. In the face of large-scale data processing and calculations, traditional cloud computing is facing tremendous pressure, and the demand for new low-latency computing technologies is imminent. As a supplementary expansion of cloud computing technology, mobile edge computing will sink the computing power from the previous cloud to a network edge node. Through the mutual cooperation between computing nodes, the number of nodes that can be calculated is more, the types are more comprehensive, and the computing range is even greater. Broadly, it makes up for the shortcomings of cloud computing technology. Although edge computing technology has many advantages and has certain research and application results, how to allocate a large number of computing tasks and computing resources to computing nodes and how to schedule computing tasks at edge nodes are still challenges for edge computing. In view of the problems encountered by edge computing technology in resource allocation and task scheduling, this paper designs a dynamic task scheduling strategy for edge computing with delay-aware characteristics, which realizes the reasonable utilization of computing resources and is required for edge computing systems. This paper proposes a resource allocation scheme combined with the simulated annealing algorithm, which minimizes the overall performance loss of the system while keeping the system low delay. Finally, it is verified through experiments that the task scheduling and resource allocation methods proposed in this paper can significantly reduce the response delay of the application.


2019 ◽  
Vol 151 ◽  
pp. 519-526 ◽  
Author(s):  
Awatif Ragmani ◽  
Amina Elomri ◽  
Noreddine Abghour ◽  
Khalid Moussaid ◽  
Mohammed Rida

2020 ◽  
Vol 39 (4) ◽  
pp. 4947-4958
Author(s):  
Xiaobo Guo ◽  
Yongping Liu

With the growth of data volume in transportation system, requirements of big data technologies are rapidly increasing. This paper presented an improved ant colony algorithm by using data analysis technologies of cloud computing and data mining. And the influence of different spatio-temporal feature fusion methods on the steering wheel angle value of intelligent vehicles is explored by feature fusion method. Furthermore, time-constrained and space-constrained networks are utilized to extract the key features that affect the steering wheel angle value. Experimental results show that the proposed algorithm improves the efficiency of data processing and information search by 35%, comparing to traditional ant colony algorithm. It is very effective in the shortest path analysis of ITS. Our research shows that the application of real-time information in the logistics distribution system can make the planning process more dynamic and the prediction results closer to reality.


Sign in / Sign up

Export Citation Format

Share Document