改进蚁群算法在P2P网络资源搜索中的应用  

Study on Resource Search in P2P Networks Based on Improved Ant Algorithm

作　　者：赵开新[1] 魏勇[1] 王东署 

机构地区：[1]河南机电高等专科学校,河南新乡453002 [2]郑州大学电气工程学院,郑州450001

出　　处：《火力与指挥控制》2015年第5期139-142,共4页Fire Control & Command Control

基　　金：国家自然科学基金(61174085);高等学校博士学科点专项科研基金资助项目(20114101110005)

摘　　要：针对P2P网络搜索算法中冗余查询消息过多,资源搜索效率低的问题,提出了基于改进蚁群算法的P2P资源搜索算法,算法中在选择邻节点查询时,综合考虑到本地资源情况、邻节点资源情况、邻节点资源相似度等因素,尽量避开了资源搜索中的恶意节点,并改进了基本蚁群算法的状态转移规则,从而避免了查询消息的盲目发送。仿真实验表明,与传统资源搜索算法K-radom-walks和Flooding相比,该算法在搜索命中率和带宽利用率方面有明显提高。For many redundant messages resources search algorithm and low efficiency issues in P2 P network,the P2 P resource search algorithm based on improved ant colony algorithm is proposed in this paper. The local resources,the neighbor node resources,the neighbor node resource similarity factors in selecting query neighbor are considered,avoiding the malicious node in resources searching as far as possible. And the basic ant colony algorithm state transition rules is improved. Query messages blind sending is avoiding. Simulation results shows the algorithm in search hit rate and bandwidth utilization improved obviously compare with traditional resource search algorithm K-radom-walks and Flooding.

关 键 词：改进蚁群算法 P2P 资源搜索 查询消息 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]