基于节点移动特性的移动P2P网络分簇算法  

A Clustering Algorithm Based on Node Mobility for Mobile P2P Network

作　　者：宋人杰[1] 邹振婉 周欣欣[1] 

机构地区：[1]东北电力大学信息工程学院,吉林吉林132012

出　　处：《东北电力大学学报》2016年第1期87-90,共4页Journal of Northeast Electric Power University

摘　　要：为了提高移动P2P网络的覆盖层拓扑稳定性,提出一种基于节点移动特性的移动P2P网络分簇算法。该算法通过对移动P2P网络的覆盖层拓扑变化与节点移动特性的关系的研究,将具有相同运动特性且物理位置临近的节点聚集成簇,并选取性能较好的节点作为簇首,使得簇内节点能够最大程度的保持覆盖层拓扑结构的稳定性。最后通过实验验证了该算法的有效性。Aiming at the problem that layer topology changes frequently in mobile P2P network which is caused by node mobility, a clustering algorithm based on node mobility is proposed. By studying the relationship between the changes of the topology structure and the changes of node mobility, this algorithm divide the nodes with adjacent physical location and same mobility into a cluster, and select the nodes which has the best performance as the cluster-head, which makes the nodes in the same cluster can maintain the maximum degree of network topology stability. Experimental results show the effectiveness of proposed algorithm.

关 键 词：移动P2P网络 分簇算法 运动特性 拓扑变化 

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