| Abstract |
The ant colony algorithm has been widely used in the field of data analysis of smart cities. However, the research of the traditional ant colony algorithm is more focused on one-to-one scenarios and there is insufficient research on many-to-one scenarios. Therefore, for the many-to-one topology mapping problem, this paper proposes a mapping method based on the ant colony algorithm. The design purpose of the mapping algorithm is to study the optimal mapping scheme, which can effectively reduce the cost of solving the problem. The core of the mapping algorithm is to design the objective function of the algorithm optimization. The commonly used optimization objective function and evaluation index is the average hop count; the average hop count is the most important indicator to measure the entire system. The smaller the average hop count, the less the pulse data needs to be forwarded, which can reduce the communication pressure of the system, reduce congestion, reduce the energy consumption caused by communication, and reduce the delay from the generation of pulse data to the response, etc. Therefore, this paper chooses the average hop count as the optimization objective and reduces the average hop count by designing a mapping algorithm. Through the simulation and verification of the improved ant colony algorithm in the scenario of many-to-one topology mapping, it is concluded that the final convergence result and convergence speed of the improved ant colony algorithm are significantly better than those of the traditional ant colony algorithm. © 2022 by the authors. |
