基于蚁群优化代理的移动Ad hoc网络资源搜索研究

A Study on Mobile Network Resource Research Based on ant Colony Optimal Agents

由于移动网络的动态拓扑结构,网络资源搜索过程又需要大量的信令分组和通信链路的支持,移动网络中的资源搜索变得异常困难.通过分析移动网络中资源搜索的关键问题,提出了一种基于代理的网络架构,并在这种架构上运用改进蚁群算法解决这些问题.该方法首先在移动网络中引入代理节点以确定网络拓扑,然后在这种引入代理节点的网络架构中使用改进蚁群算法,同时利用全局和本地信息素来寻找资源.仿真比较了传统蚁群算法和改进蚁群算法的资源搜索性能,仿真结果显示相对于传统蚁群算法,这种新算法在基于代理的移动网络中可以大大提高移动网络资源搜索的效率.

Due to the dynamic topology of mobile networks, and the huge expenses of signaling packets and communications links needed in the process of network resource searching, resource searching in mobile networks becomes quite difficult. Key problems are analyzed carefully and a new network structure with a new algorithm based on the new structure is proposed to solve these problems. This method first introduces agent nodes to determine the network topology; then based on this agent-based structure, improved Ant Colony Algorithm is used to find resource, with the simultaneous utilization of global and local pheromone. Comparison of the resource search performance of improved Ant Colony Algorithm and the traditional one is conducted via simulation, with the results showing that the improved algorithm used in the agent-based mobile networks can greatly improve the efficiency of resource searching in mobile networks.