Journal of Northeastern University ›› 2007, Vol. 28 ›› Issue (4): 501-504.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Reactive energy-saving dynamic-clustering algorithm in wireless sensor networks

Guo, Bin (1); Li, Zhe (1); Liu, Jun (1); Geng, Rong (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2007-04-15 Published:2013-06-24
  • Contact: Guo, B.
  • About author:-
  • Supported by:
    -

Abstract: A reactive energy-saving dynamic-clustering (REDC) algorithm is proposed according to the field data in network where the nodes are driven by events. All the information is classified by setting local and action thresholds of those nodes from which a temporary cluster-head is selected for the fusion of all the data acquired, according to the similarity and isochronism of local field data. At the same time, two kinds of energy-saving strategies are provided to balance the further network power consumption, thus lengthening the network lifetime considerably. Simulation results revealed that the REDC algorithm is really efficient.

CLC Number: