Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (12): 1713-1715.DOI: -

• OriginalPaper • Previous Articles     Next Articles

A clustering algorithm based on multiple coverage for wireless sensor networks

Tan, Xiao-Bo (1); Zhao, Hai (1); Zhang, Wen-Bo (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) School of Information Science and Engineering, Shenyang Ligong University, Shenyang 110159, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Tan, X.-B.
  • About author:-
  • Supported by:
    -

Abstract: In traditional clustering algorithms for wireless sensor networks, the remaining energy of the elected cluster heads is not considered. Moreover, the service failure ratio that the cluster heads provided for nodes in clusters is not considered either. A new multiple coverage clustering algorithm is proposed. In this algorithm the ratio of cluster head node residual energy to its initial energy is set to the service failure rate. Based on the service failure rate above, the elected cluster heads provide multiple coverage to key nodes to ensure reliable communication. The simulation experimental results show that the proposed algorithm is correct and effective.

CLC Number: