›› 2015, Vol. 28 ›› Issue (8): 115-.

• 论文 • 上一篇    下一篇

无标度网络的局部搜索策略

曾成,孙雅倩,徐玉珠,张达敏   

  1. (贵州大学 大数据与信息工程学院,贵州 贵阳 550025)
  • 出版日期:2015-08-15 发布日期:2015-08-15
  • 作者简介:曾成(1989—),男,硕士研究生。研究方向:数字通信与通信系统。E-mail:584765812@qq.com。张达敏(1967—),男,博士,教授,硕士生导师。研究方向:计算机应用技术,网络拥塞控制等
  • 基金资助:

    贵州省省委组织部基金资助项目(TZJF-2011-37);贵州省合作计划基金资助项目([2012]7002号);贵州大学研究生创新基金资助项目(研理工2015078)

Local Search Strategy in Scale-Free Networks

ZENG Cheng,SUN Yaqian,XU Yuzhu,ZHANG Damin   

  1. (College of Big Data and Information Engineering,Guizhou University,Guiyang 550025,China)
  • Online:2015-08-15 Published:2015-08-15

摘要:

基于最小聚类系数搜索和贪婪算法在搜索中的优点,根据BA无标度网络的结构特性,以最小聚类系数和度量距离两个影响搜索性能的参数,设计出最小聚类系数最小距离搜索策略。并通过仿真实验对最小聚类系数最小距离搜索策略、最小聚类系数搜索策略、贪婪算法和随机游走搜索策略的性能进行对比。理论分析与仿真结果均表明,最小聚类系数最小距离搜索策略在BA无标度网络模型上能取得较好地搜索效果。

关键词: 无标度网络, 聚类系数, 贪婪算法, 局部搜索策略

Abstract:

Based on the advantage of the minimum clustering coefficient search strategy and the greedy algorithm,a minimum clustering coefficient and minimum distance search strategy is designed according to the structure characteristics of the BA scale-free networks,considering the minimum clustering coefficient and the distance metrics which are the influence factor for the search performance.A comparison is made between the minimum clustering coefficient search strategy,greedy algorithm,strategies as random walk and the proposed strategy by simulation.Theoretical analysis and simulation results both show that the proposed strategy achieves a good search performance.

Key words: scale free network;clustering coefficient;greedy algorithm;local search strategy

中图分类号: 

  • TP393