基于图论聚合度的动态分层路由算法  

Convergence Degree-based Dynamic Hierarchical Routing Algorithm

作　　者：孙亭 芦东昕[3,4] 杨永田[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院 [2]中兴软件技术(南昌)有限公司,南昌330029 [3]中兴软件技术(南昌)有限公司 [4]中兴软件技术-华北电力大学联合实验室,南昌330029

出　　处：《计算机工程》2008年第7期23-25,共3页Computer Engineering

基　　金：中国下一代互联网示范工程项目(CNGI-04-17-2A)

摘　　要：讨论无线传感器网络簇的组成问题及其形式化描述,提出节点聚合度的概念并引入簇首的生成过程,给出一种新的优化路由算法。对算法的设计思想和工作过程,包括簇首的选举与簇建立、簇重组与自愈机制进行了分析与讨论。仿真结果显示,与传统的随机簇首生成算法和最小ID算法相比,该算法降低了簇内节点的重叠度,均衡了网络节点的能量消耗,延长了网络的生存时间。After the discussion of cluster organization and its formalization, a new optimized wireless sensor networks routing algorithm is proposed, which uses convergence degree concept during the foundation of cluster head. It mainly analyses the election of the cluster head, cluster building/re-building and cluster’s self-recovery mechanism. Compared with the traditional random algorithm and least ID algorithm, the simulation shows that new algorithm has a lower overlap, balances the network nodes energy depletion and prolongs the lifetime of whole networks.

关 键 词：无线传感器网络 分层路由 节点聚合度 自愈机制 

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