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

计算机工程 ›› 2010, Vol. 36 ›› Issue (14): 87-89. doi: 10.3969/j.issn.1000-3428.2010.14.032

• 网络与通信 • 上一篇    下一篇

WSN中能量有效的分区聚簇多跳路由算法

段翠琴1,孙晶晶1,周 端1,张剑贤2,高 翔2   

  1. (1. 西安电子科技大学计算机学院,西安 710071;2. 西安电子科技大学微电子学院,西安 710071)
  • 出版日期:2010-07-20 发布日期:2010-07-20
  • 作者简介:段翠琴(1984-),女,硕士研究生,主研方向:无线传感器网络;孙晶晶,硕士研究生;周 端,教授;张剑贤、高 翔,博士研究生
  • 基金资助:
    国家部委基金资助项目

Energy-efficient Region-partitioned Clustering Multihop Routing Algorithm in WSN

DUAN Cui-qin1, SUN Jing-jing1, ZHOU Duan1, ZHANG Jian-xian2, GAO Xiang2   

  1. (1. School of Computer Science and Technology, Xidian University, Xi’an 710071; 2. School of Microelectronics, Xidian University, Xi’an 710071)
  • Online:2010-07-20 Published:2010-07-20

摘要: 针对无线传感器网络中节点能量及通信半径有限的特点,提出一种分区聚簇多跳路由算法。通过将网络进行分区使网络中簇的数量固定且分布比较均匀,通过构建树状结构及有序邻居列表选择路由节点,以多跳的方式进行通信,从而减少网络的能耗。仿真结果表明,该算法可以有效节省能量,延长网络的生命周期。

关键词: 分区, 树状结构, 有序邻居列表, 多跳路由

Abstract: Aiming at the characteristics of limited energy of sensor nodes and limited communication range in Wireless Sensor Network(WSN), this paper proposes an energy-efficient region-partitioned clustering multihop routing algorithm. By compartmentalizing the network to several regions, the total number of clusters is constant and the clusters can distribute evenly. By constructing tree structures and sequential neighbor lists to select routing nodes, nodes communicate with each other in manner of multihop, so that energy consumption is decreased. Simulation results show that the algorithm can save energy effectively and prolong network lifetime.

Key words: region-partitioned, tree structure, sequential neighbor list, multihop routing

中图分类号: