Topology-aware cluster algorithm in mobile grid

doi:10.3778/j.issn.1002-8331.2011.02.003

Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (2): 8-11.DOI: 10.3778/j.issn.1002-8331.2011.02.003

• 博士论坛 • Previous Articles Next Articles

Topology-aware cluster algorithm in mobile grid

DU Lijuan^1，2，YU Zhenwei²

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

Received:2010-10-20 Revised:2010-11-26 Online:2011-01-11 Published:2011-01-11
Contact: DU Lijuan

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

杜丽娟^1，2，余镇危²

1.华北科技学院电子信息工程系，北京 101601
2.中国矿业大学机电与信息工程学院，北京 100083

通讯作者: 杜丽娟

Abstract

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 finding 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 contrarily.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 different parameters to algorithm performance is analyzed by simulation experiment.

Key words: mobile grid, cluster, super-node, topology-aware, Partical Swarm Optimization（PSO）

摘要： 针对移动网格的特点提出基于超级节点的覆盖网络模型，对节点聚集问题进行形式化描述。提出的聚集算法以分布式网络坐标系统为基础，由查找聚集、建立新聚集和超级节点连接三部分组成。节点在加入移动网格时首先要寻找最近距离的聚集加入，在网络规模较小时采用简单的禁忌搜索算法来寻找归属聚集，而在网络规模较大时采用改进的粒子群算法寻找归属聚集。在加入聚集时考虑节点间距离和节点容量参数，从而能够满足应用相关的延时要求并实现良好的负载平衡。算法体现了分布式、自适应、轻量级的特点。仿真实验分析了不同参数对算法性能的影响。

关键词: 移动网格, 聚集, 超级节点, 拓扑感知, 粒子群优化

CLC Number:

TP393

DU Lijuan^1，2，YU Zhenwei². Topology-aware cluster algorithm in mobile grid[J]. Computer Engineering and Applications, 2011, 47(2): 8-11.

杜丽娟^1，2，余镇危². 拓扑感知的移动网格节点聚集算法[J]. 计算机工程与应用, 2011, 47(2): 8-11.

[1]	LAN Hong, HUANG Min. Fusion of KNN Optimized Density Peaks and FCM Clustering Algorithm [J]. Computer Engineering and Applications, 2021, 57(9): 81-88.
[2]	GUO Xiaojing, SUI Haoda. Application of Improved YOLOv3 in Foreign Object Debris Target Detection on Airfield Pavement [J]. Computer Engineering and Applications, 2021, 57(8): 249-255.
[3]	LI Li, JI Xinyuan, SONG Song. Prediction Model for Number of Software Defects in Loop [J]. Computer Engineering and Applications, 2021, 57(7): 158-163.
[4]	HUO Guangyu, ZHANG Yong, SUN Yanfeng, YIN Baocai. Research on Archive Data Intelligent Classification Based on Semantic [J]. Computer Engineering and Applications, 2021, 57(6): 247-253.
[5]	YANG Fang, YIN Xi, SI Jianhui, LIU Hongyuan, WANG Xue. Mathematical Expression Similarity Calculation Method Based on Focus Clustering [J]. Computer Engineering and Applications, 2021, 57(6): 88-93.
[6]	ZHAO Fan, ZHANG Lin, WEN Zhiquan, YANG Linlin, LIN Guangfeng. Direct and Efficient Natural Scene Chinese Character Approaching Spotting Method [J]. Computer Engineering and Applications, 2021, 57(6): 159-167.
[7]	PENG Qihui, XUAN Shibin, GAO Qing. Distribution Automatic Threshold Density Peak Clustering Algorithm [J]. Computer Engineering and Applications, 2021, 57(5): 71-78.
[8]	LI Yongzhen, LIAO Husheng. Multi-view Clustering via Graph Convolutional Neural Network [J]. Computer Engineering and Applications, 2021, 57(5): 115-122.
[9]	WANG Changlong, ZHANG Yuandong, MIAO Hong, YANG Yuheng. Application of Double Channel Convolutional Neural Network in Pumpkin Diseases Identification [J]. Computer Engineering and Applications, 2021, 57(5): 183-189.
[10]	HU Xiaomin, WANG Mingfeng, ZHANG Shourong, LI Min. New Differential Evolution with Particle Swarm Optimization Algorithm for Text Clustering [J]. Computer Engineering and Applications, 2021, 57(4): 61-67.
[11]	WANG Junling, LU Xinming. Video Key Frame Extraction Algorithm Based on Semantic Correlation [J]. Computer Engineering and Applications, 2021, 57(4): 192-198.
[12]	WANG Fuyin, ZHANG Desheng, ZHANG Xiao. Adaptive Density Peaks Clustering Algorithm Combining with Whale Optimization Algorithm [J]. Computer Engineering and Applications, 2021, 57(3): 94-102.
[13]	CHEN Junfeng, ZHENG Zhongtuan. Over-Sampling Method on Imbalanced Data Based on WKMeans and SMOTE [J]. Computer Engineering and Applications, 2021, 57(23): 106-112.
[14]	ZHANG Zhonglin, ZHAO Yu, YAN Guanghui. Natural Neighbor Density Extremum Clustering Algorithm [J]. Computer Engineering and Applications, 2021, 57(23): 200-210.
[15]	MEI Jie, WEI Yuanyuan, XU Taosheng. Fusion Clustering Algorithm Based on Multi-Prototypes Using Density Peaks [J]. Computer Engineering and Applications, 2021, 57(22): 78-85.

Topology-aware cluster algorithm in mobile grid

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

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics