| 基于节点聚合度的生成簇算法 |
| |
| 引用本文： | 杜胜永,柴乔林,王华. 基于节点聚合度的生成簇算法[J]. 计算机应用, 2006, 26(4): 948-950 |
| |
| 作者姓名： | 杜胜永 柴乔林 王华 |
| |
| 作者单位： | 山东大学,计算机与科学技术学院,山东,济南,250061;山东大学,计算机与科学技术学院,山东,济南,250061;山东大学,计算机与科学技术学院,山东,济南,250061 |
| |
| 摘 要： | 无线传感器网络可以用无向图表示，节点及其一跳邻节点构成一个子图。子图节点总数与边总数的比值作为该节点的聚合度，选择子图中聚合度最大的节点作为簇头，建立网络逻辑簇结构。与传统的最小ID算法和最大连通度算法相比，仿真结果表明该算法建立簇之间的重叠度最低。
|
| 关 键 词： | 无线传感器网络 节点聚合度 网络重叠度 |
| 文章编号： | 1001-9081（2006）04-0948-03 |
| 收稿时间： | 2005-10-08 |
| 修稿时间： | 2005-10-082005-12-14 |
Clustering algorithm based on convergence degree |
| |
| DU Sheng-yong,CHAI Qiao-lin,WANG Hua. Clustering algorithm based on convergence degree[J]. Journal of Computer Applications, 2006, 26(4): 948-950 |
| |
| Authors: | DU Sheng-yong CHAI Qiao-lin WANG Hua |
| |
| Affiliation: | School of Computer Science and Technology, Shandong University,Jinan Shandong 250061, China |
| |
| Abstract: | Wireless sensor network could be described as an undirected graph. The convergence degree of the node was determined by the ratio of the number of sub-graph's vertexes and number of the edges. The node with the greatest convergence degree was selected as the cluster head to build up the logical structure of the network. The experiment results show that the proposed method yields the lowest overlap of the clusters comparing with the LID algorithm and the MAXD algorithm. |
| |
| Keywords: | wireless sensor network convergence degree overlap |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
