The sensor's waking strategy is critical to the sensor network. The basic mathematical model of waking strategy is TSP problem. Some typical intelligent algorithms for TSP problem model include antcolony algorith...
详细信息
ISBN:
(纸本)9789811081231;9789811081224
The sensor's waking strategy is critical to the sensor network. The basic mathematical model of waking strategy is TSP problem. Some typical intelligent algorithms for TSP problem model include antcolonyalgorithm, genetic algorithm and so on. On the basis of the maximum and minimum ant colony algorithm, this paper improves the following disadvantages: According to the principle of choosing the city based on the pheromone principle, the non-contract principle is added, The principle of city selection and make it in the process of selecting the city, the priority to follow the principle of non-contract;in a single path after the help of the enumeration algorithm with the special advantages, refer to the enumeration algorithm part of the results of the re-processing of the path, The path can cover the search space. The improved algorithm avoids the occurrence of stagnation to a certain extent, weakening the blindness of search. The possibility of the results is increased by 25%, single results of the calculation time is reduced by 89.79%.
暂无评论