scholarly journals ACTS: An Ant Colony Based Transmission Scheduling Approach for Cloud Network Collaboration Environment

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2109
Author(s):  
Ruiying Cheng ◽  
Pan Zhang ◽  
Lei Xie ◽  
Yongqi Ai ◽  
Peng Xu
Keyword(s):  
Data Transmission ◽  
Ant Colony Algorithm ◽  
Relay Node ◽  
Ant Colony ◽  
Local Optimum ◽  
Transmission Scheduling ◽  
Cloud Platform ◽  
Network Resources ◽  
Relay Nodes ◽  
Cloud Network

In traditional cloud computing research, it is often considered that the network resources between edge devices and cloud platform are sufficient, and the symmetry between the upward link from edge devices to the cloud platform and the downward link from cloud platform to edge devices is definite. However, in many application scenarios, the network resources between edge devices and cloud platform might be limited, and the link symmetry may not be guaranteed. To solve this problem, network relay nodes are introduced to realize the data transmission between edge devices and the cloud platform. The environment in which network relay nodes that can cooperate with the cloud platform is called cloud network collaborative environment (CNCE). In CNCE, how to optimize data transmission from edge devices to cloud platform through relay nodes has become one of the most important research topics. In this paper, we focus on the following two influencing factors that previous studies ignored: (1) the multi-link and multi-constraint transmission process; and (2) the timely resource state of the relay node. Taking these factors into consideration, we design a novel data transmission scheduling algorithm, called ant colony based transmission scheduling approach (ACTS). First, we propose a multi-link optimization mechanism to optimize the constraint limits. This mechanism divides the transmission into two links called the downlink relay link and uplink relay link. For the downlink relay link, we use the store-and-forward method for the optimization. For the uplink relay link, we use the min–min method for the optimization. We use the ant colony algorithm for the overall optimization of the two links. Finally, we improve the pheromone update rule of the ant colony algorithm to avoid the algorithm from falling into a local optimum. Extensive experiments demonstrate that our proposed approach has better results in transmission efficiency than other advanced algorithms.

scholarly journals Path Planning Based on an Improved Ant Colony Algorithm

2018 ◽  
Vol 228 ◽  
pp. 01010
Author(s):  
Miaomiao Wang ◽  
Zhenglin Li ◽  
Qing Zhao ◽  
Fuyuan Si ◽  
Dianfang Huang
Keyword(s):  
Path Planning ◽  
Ant Colony Algorithm ◽  
Search Algorithm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Local Optimum ◽  
Pheromone Concentration ◽  
Suppression Strategy ◽  
Improved Ant Colony Algorithm ◽  
Robot Path

The classical ant colony algorithm has the disadvantages of initial search blindness, slow convergence speed and easy to fall into local optimum when applied to mobile robot path planning. This paper presents an improved ant colony algorithm in order to solve these disadvantages. First, the algorithm use A* search algorithm for initial search to generate uneven initial pheromone distribution to solve the initial search blindness problem. At the same time, the algorithm also limits the pheromone concentration to avoid local optimum. Then, the algorithm optimizes the transfer probability and adopts the pheromone update rule of "incentive and suppression strategy" to accelerate the convergence speed. Finally, the algorithm builds an adaptive model of pheromone coefficient to make the pheromone coefficient adjustment self-adaptive to avoid falling into a local minimum. The results proved that the proposed algorithm is practical and effective.

Cutting trajectory planning of sections with complex composition for roadheader

2018 ◽  
Vol 233 (4) ◽  
pp. 1441-1452 ◽  
Author(s):  
Suyu Wang ◽  
Miao Wu
Keyword(s):  
Trajectory Planning ◽  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Grid Method ◽  
Ant Colony ◽  
Local Optimum ◽  
Complex Composition ◽  
Cutting Head ◽  
Pheromone Concentration ◽  
Simulation Results

In order to realize the autonomous cutting for tunneling robot, the method of cutting trajectory planning of sections with complex composition was proposed. Firstly, based on the multi-sensor parameters, the existence, the location, and size of the dirt band were determined. The roadway section environment was modeled by grid method. Secondly, according to the cutting process and tunneling cutting characteristics, the cutting trajectory ant colony algorithm was proposed. To ensure the operation safety and avoid the cutting head collision, the expanding operation was adopt for dirt band, and the aborting strategy for the ants trapped in the local optimum was put forward to strengthen the pheromone concentration of the found path. The simulation results showed that the proposed method can be used to plan the optimal cutting trajectory. The ant colony algorithm was used to search for the shortest path to avoid collision with the dirt band, and the S-path cutting was used for the left area to fulfill section forming by following complete cover principle. All the ants have found the optimal path within 50 times iteration of the algorithm, and the simulation results were better than particle swarm optimization and basic ant colony optimization.

scholarly journals Relay-Assisted D2D Transmission for Mobile Health Applications

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4417 ◽  
Author(s):  
Hongcheng Huang ◽  
Wei Xiang ◽  
Yang Tao ◽  
Biao Liu ◽  
Min Hu
Keyword(s):  
Energy Consumption ◽  
Mobile Health ◽  
Data Transmission ◽  
Transmission Rate ◽  
Relay Node ◽  
Medical Data ◽  
Spectrum Efficiency ◽  
D2d Communication ◽  
Relay Nodes ◽  
Relay Communication

Relay-assisted Device-to-Device (D2D) communication, one of the important transmission modes in mobile health systems, can provide high transmission quality for servicing users at the edge of system coverage. However, the quality of the D2D relay communication is largely limited by the relay nodes. When a poor node is selected to assist the source node in the data transmission, it is likely to result in the loss of medical data and inaccurate transmission. Therefore, this paper focuses on how to select relay modes and relay nodes to improve the reliability of medical data transmission. Firstly, in order to eliminate the relay nodes with low energy or poor willingness, the acceptable energy consumption metric of relay nodes is proposed in this paper. The relay mode of each relay node is determined by the acceptable energy consumption metric, which can ensure the physical reliability of the relay communication links. Then a trust metric is proposed to measure the social reliability of each relay link, further excluding the malicious relay nodes. Finally, this paper proposes a relay selection algorithm based on compromise factors (RSCF). With the help of the proposed algorithm, the reliability of the relay communication can be guaranteed, and the spectrum efficiency can be promoted greatly. The simulation results show that the relay nodes selected by RSCF algorithm can greatly improve transmission rate and reliability compared with the traditional relay-assisted D2D communication schemes.

scholarly journals Path planning of lunar robot based on dynamic adaptive ant colony algorithm and obstacle avoidance

2020 ◽  
Vol 17 (3) ◽  
pp. 172988141989897 ◽  
Author(s):  
Shinan Zhu ◽  
Weiyi Zhu ◽  
Xueqin Zhang ◽  
Tao Cao
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Potential Field ◽  
Ant Colony Algorithm ◽  
Global Search ◽  
Convergence Speed ◽  
Ant Colony ◽  
Local Optimum ◽  
Adaptive Potential ◽  
Avoidance Strategy

Path planning of lunar robots is the guarantee that lunar robots can complete tasks safely and accurately. Aiming at the shortest path and the least energy consumption, an adaptive potential field ant colony algorithm suitable for path planning of lunar robot is proposed to solve the problems of slow convergence speed and easy to fall into local optimum of ant colony algorithm. This algorithm combines the artificial potential field method with ant colony algorithm, introduces the inducement heuristic factor, and adjusts the state transition rule of the ant colony algorithm dynamically, so that the algorithm has higher global search ability and faster convergence speed. After getting the planned path, a dynamic obstacle avoidance strategy is designed according to the predictable and unpredictable obstacles. Especially a geometric method based on moving route is used to detect the unpredictable obstacles and realize the avoidance of dynamic obstacles. The experimental results show that the improved adaptive potential field ant colony algorithm has higher global search ability and faster convergence speed. The designed obstacle avoidance strategy can effectively judge whether there will be collision and take obstacle avoidance measures.

An Improved Ant Colony Algorithm for the Shortest Path in City’s Road Network

2011 ◽  
Vol 121-126 ◽  
pp. 1296-1300 ◽  
Author(s):  
Jun Bi ◽  
Jie Zhang ◽  
Wen Le Xu
Keyword(s):  
Shortest Path ◽  
Road Network ◽  
Ant Colony Algorithm ◽  
Road Traffic ◽  
Global Optimum ◽  
Ant Colony ◽  
Selection Strategy ◽  
Ant Colony System ◽  
Local Optimum ◽  
Information Quantity

The shortest path between the start node and end node plays an important role in city’s road traffic network analysis system. The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem. But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path. In order to solve the problem, the improved ant colony system algorithm is proposed. The improvement methods for selection strategy, local search, and information quantity modification of basic ant colony system are discussed in detail. The experiments are done in Beijing road network in China. The results of experiments show that comparing with the basic ant colony algorithm, the improved algorithm can easily converge at the global optimum for the shortest path.

scholarly journals Energy-Saving Virtual Machine Placement Method for User Experience in Cloud Environment

2020 ◽  
Vol 2020 ◽  
pp. 1-9 ◽  
Author(s):  
Shanchen Pang ◽  
Kexiang Xu ◽  
Shudong Wang ◽  
Min Wang ◽  
Shuyu Wang
Keyword(s):  
Energy Consumption ◽  
Energy Saving ◽  
Virtual Machine ◽  
User Experience ◽  
Ant Colony Algorithm ◽  
Data Centers ◽  
Virtual Machine Placement ◽  
Ant Colony ◽  
Local Optimum ◽  
Placement Method

Green computing focuses on the energy consumption to minimize costs and adverse environmental impacts in data centers. Improving the utilization of host computers is one of the main green cloud computing strategies to reduce energy consumption, but the high utilization of the host CPU can affect user experience, reduce the quality of service, and even lead to service-level agreement (SLA) violations. In addition, the ant colony algorithm performs well in finding suitable computing resources in unknown networks. In this paper, an energy-saving virtual machine placement method (UE-ACO) is proposed based on the improved ant colony algorithm to reduce the energy consumption and satisfy users’ experience, which achieves the balance between energy consumption and user experience in data centers. We improve the pheromone and heuristic factors of the traditional ant colony algorithm, which can guarantee that the improved algorithm can jump out of the local optimum and enter the global optimal, avoiding the premature maturity of the algorithm. Experimental results show that compared to the traditional ant colony algorithm, min-min algorithm, and round-robin algorithm, the proposed algorithm UE-ACO can save up to 20%, 24%, and 30% of energy consumption while satisfying user experience.

The Research on VRP Based on Max-Min Ant Colony Algorithm

2011 ◽  
Vol 219-220 ◽  
pp. 1285-1288 ◽  
Author(s):  
Chang Min Chen ◽  
Wei Cheng Xie ◽  
Song Song Fan
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Search Time ◽  
Ant Colony ◽  
Local Optimum ◽  
Simulation Data ◽  
Routing Problem ◽  
Np Hard Problem ◽  
The Cost

Vehicle routing problem (VRP) is the key to reducing the cost of logistics, and also an NP-hard problem. Ant colony algorithm is a very effective method to solve the VRP, but it is easy to fall into local optimum and has a long search time. In order to overcome its shortcomings, max-min ant colony algorithm is adopted in this paper, and its simulation system is designed in GUI of MATLAB7.0. The results show that the vehicle routing problem can well achieves the optimization of VRP by accessing the simulation data of database.

scholarly journals Multi-Controller Load Balancing Algorithm for Test Network Based on IACO

Symmetry ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1901
Author(s):  
Yanfang Fu ◽  
Yuting Zhu ◽  
Zijian Cao ◽  
Zhiqiang Du ◽  
Guochuang Yan ◽  
...  
Keyword(s):  
Load Balancing ◽  
Ant Colony Algorithm ◽  
Flight Test ◽  
Cooperative Networks ◽  
Ant Colony ◽  
Local Optimum ◽  
Artificial Fish Swarm Algorithm ◽  
Artificial Fish Swarm ◽  
Asymmetric Load ◽  
Load Balancing Algorithm

With the rapid increase of volume and complexity in the projectile flight test business, it is becoming increasingly important to improve the quality of the service and efficiency of multi-domain cooperative networks. The key for these improvements is to solve the problem of asymmetric load of multi-controllers in multi-domain networks. However, due to the current reality, it is difficult to meet the demands of future tests, and there is not guarantee of subnet multi-domain test load balancing. Most recent works have used a heuristic approach to seek the optimal dynamic migration path, but they may fall into the local optimum. This paper proposes an improved ant colony algorithm (IACO) that can transform the modeling of the mapping relationship between the switch and the controller into a traveling salesman problem by combining the ant colony algorithm and artificial fish swarm algorithm. The IACO not only ensures the load balancing of multi-controllers but also improves the reliability of the cluster. The simulation results show that compared to other algorithms such as traditional ant colony algorithms and distributed decision mechanisms, this IACO achieves better load balancing, improves the average throughput of multi-controller clusters, and effectively reduces the response time of controller request events.

Weaving scheduling based on an improved ant colony algorithm

2020 ◽  
pp. 004051752094889
Author(s):  
Wentao He ◽  
Shuo Meng ◽  
Jing’an Wang ◽  
Lei Wang ◽  
Ruru Pan ◽  
...  
Keyword(s):  
Production Scheduling ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Superior Performance ◽  
Ant Colony System ◽  
Local Optimum ◽  
Scheduling Method ◽  
Automatic Methods ◽  
Automatic Scheduling ◽  
Improved Ant Colony Algorithm

Weaving enterprises are faced with problems of small batches and many varieties, which leads to difficulties in manual scheduling during the production process, resulting in more delays in delivery. Therefore, an automatic scheduling method for the weaving process is proposed in this paper. Firstly, a weaving production scheduling model is established based on the conditions and requirements during actual production. By introducing flexible model constraints, the applicability of the model has been greatly expanded. Then, an improved ant colony algorithm is proposed to solve the model. To address the problem of the traditional ant colony algorithm that the optimizing process usually traps into local optimum, the proposed algorithm adopts an iterative threshold and the maximum and minimum ant colony system. In addition, the initial path pheromone distribution is formed according to the urgency of the order to balance each objective. Finally, the simulation experiments confirm that the proposed method achieves superior performance compared with manual scheduling and other automatic methods. The proposed method shows a certain guiding significance for weaving scheduling in practice.

Sign in / Sign up

Export Citation Format

Share Document