作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (7): 23-25. doi: 10.3969/j.issn.1000-3428.2008.07.008

• 博士论文 • 上一篇    下一篇

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

孙 亭1,2,芦东昕2,3,杨永田1   

  1. (1. 哈尔滨工程大学计算机科学与技术学院,哈尔滨 150001;2. 中兴软件技术(南昌)有限公司,南昌 330029; 3. 中兴软件技术-华北电力大学联合实验室,南昌 330029)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-04-05 发布日期:2008-04-05

Convergence Degree-based Dynamic Hierarchical Routing Algorithm

SUN Ting1,2, LU Dong-xin2,3, YANG Yong-tian1   

  1. (1. School of Computer Science and Technology, Harbin Engineering University, Harbin 150001; 2. ZTE Software Engineering, Nanchang 330029; 3. Lab of ZTE Software Engineering-North China Electric Power University, Nanchang 330029)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-05 Published:2008-04-05

摘要: 讨论无线传感器网络簇的组成问题及其形式化描述,提出节点聚合度的概念并引入簇首的生成过程,给出一种新的优化路由算法。对算法的设计思想和工作过程,包括簇首的选举与簇建立、簇重组与自愈机制进行了分析与讨论。仿真结果显示,与传统的随机簇首生成算法和最小ID算法相比,该算法降低了簇内节点的重叠度,均衡了网络节点的能量消耗,延长了网络的生存时间。

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

Abstract: 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.

Key words: wireless sensor networks, hierarchical routing, convergence degree, self-recovery mechanism

中图分类号: