Hierarchical Clustering Routing Algorithm for Wireless Sensor Network
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, a hierarchical clustering routing algorithm (HCRA) is proposed for time-driven data collection methods, in which different types of sensors have different data collection period. In heterogeneous Wireless Sensor Networks, the energy consumption of all kinds of sensor nodes should be balanced. In the choice of cluster head node, the data acquisition cycle between different nodes is adequately considered in the HCRA algorithm. The algorithm uses a hierarchical threshold, and the probability and frequency of nodes with higher acquisition cycle becoming cluster head nodes is increased, so it can prolong the life time of nodes with lower acquisition cycle. Compared with the LEACH and LEACH-MAC algorithm, the simulation shows that, in the multilevel heterogeneous network model, the HCRA algorithm provides longer network survival time, and the stability period of the network is improved.

    Reference
    Related
    Cited by
Get Citation

徐世武.无线传感器网络分级成簇路由算法.计算机系统应用,2017,26(2):129-133

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 04,2016
  • Revised:June 12,2016
  • Adopted:
  • Online: February 15,2017
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063