拓扑感知的移动网格节点聚集算法.pdfVIP

8 2011 ，47 （2 ） Computer Engineering and Applications 计算机工程与应用 拓扑感知的移动网格节点聚集算法 1，2 2 杜丽娟 ，余镇危 DU Lijuan1，2 ，YU Zhenwei2 1.华北科技学院 电子信息工程系，北京 101601 2.中国矿业大学 机电与信息工程学院，北京 100083 1.Department of Electronic Information Engineering ，North China Institute of Science and Technology ，Beijing 101601，China 2.School of Mechanical ，Electronic and Information Engineering ，China University of Mining Technology ，Beijing 100083，China E-mail ：dulijuan1976@ DU Lijuan ，YU Zhenwei.Topology-aware cluster algorithm in mobile grid.Computer Engineering and Applications ，2011 ， 47 （2 ）：8-11. Abstract ：Super-node based overlay network model is proposed according to features of mobile grid ，and node clustering problem is depicted formally.Clustering algorithm ，which is based on distributed network coordinate system ，consists of find- ing cluster ，creating new cluster and connecting super-nodes.Node firstly finds nearest cluster when it tries to join mobile grid system.Vicinage searching algorithm is adopted if network size is small ，while particle swarm algorithm is adopted con- trarily.In order to meet requirements of delay and load balance ，distance and capacity parameter are considered when new node joins one cluster.The algorithm proposed is characterized with distributed ，self-adaptation and lightweight.Affection of dif- ferent parameters to algorithm performance is analyzed by simulation experiment. Key words ：mobile grid ；cluster ；super-node ；topology-aware ；Partical Swarm Optimization （PSO ） 摘 要：针对移动网格的特点提出基于超级节点的覆盖网络模型，对节点聚集问题进行形式化描述。提出的聚集算法以分布式 网络坐标系统为基础，由查找聚集、建立新聚集和超级节点连接三部分组成。节点在加入移动网格时首先要寻找最近距离的聚 集加入，在网络规模较小时采用简单的禁忌搜索算法来寻找归属聚集，而在网络规模较大时采用改进的粒子群算法寻找归属聚 集。在加入聚集时考虑节点间距离和节点容量参数，从而能够满足应用相关的延时要求并实现良好的负载平衡。算法体现了分 布式、自适应、轻量级的特点。仿真实验分析了不同参数对算法性能的影响。 关键词：移动网格；聚集；超级节点；拓扑感知；粒子群优化 DOI ：10.3778/j.issn. 1002-8331.2011.02.003 文章编号：1002-8331（2011 ）02-0008-04 文献标识码：A 中图分类号：TP393 1 前言