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

计算机工程 ›› 2012, Vol. 38 ›› Issue (3): 74-76,79. doi: 10.3969/j.issn.1000-3428.2012.03.025

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

基于能量最小路径的WSN分簇算法

龚闻天,樊 镭,施晓秋   

  1. (温州大学物理与电子信息工程学院,浙江 温州 325035)
  • 收稿日期:2011-07-13 出版日期:2012-02-05 发布日期:2012-02-05
  • 作者简介:龚闻天(1983-),男,硕士研究生,主研方向:无线传感器网络,网络拓扑控制;樊 镭,硕士研究生;施晓秋,教授
  • 基金资助:
    国家自然科学基金资助项目“基于迭代测距整合的无线网络可定位性与定位算法研究”(60970118)

Clustering Algorithm for Wireless Sensor Network Based on Minimum Energy Path

GONG Wen-tian, FAN Lei, SHI Xiao-qiu   

  1. (School of Physics and Electronic Information Engineering, Wenzhou University, Wenzhou 325035, China)
  • Received:2011-07-13 Online:2012-02-05 Published:2012-02-05

摘要: 为延长无线传感器网络(WSN)的生存时间,提出一种基于能量最小路径的WSN分簇算法。参照节点的剩余能量与全网动态平均能量的比例关系,决定节点是否成为簇头,并结合簇头间的能量最小路径,实现全网的能耗均衡。仿真结果显示,该算法在网络生存时间、数据吞吐量和网络能耗等指标上性能较优。

关键词: 无线传感器网络, 分簇算法, 网络生存时间, 能量最小路径, 数据转发

Abstract: In order to improve the lifetime of Wireless Sensor Network(WSN), this paper proposes a clustering algorithm for WSN based on minimum energy path. It evaluates the ratio of residual energy of a particular node to the average energy of the network, and uses the ratio to determine whether the node would become a cluster head. It uses the minimum energy paths between the cluster heads to achieve balanced energy consumption of the network. Simulation results show that the proposed algorithm can improve the network lifetime, energy consumption and data throughput.

Key words: Wireless Sensor Network(WSN), clustering algorithm, network lifetime, minimum energy path, data forwarding

中图分类号: