Electronic Science and Technology ›› 2019, Vol. 32 ›› Issue (8): 27-32.doi: 10.16180/j.cnki.issn1007-7820.2019.08.006

Previous Articles     Next Articles

A Modified Routing Algorithm Based on Time Competition Clustering

SUN Zhen1,WANG Kai2,WANG Yagang1   

  1. 1. School of Optical-Electrical and Computer Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China
    2. Shanghai Publishing and Printing College,University of Shanghai for Science and Technology,Shanghai 200093,China
  • Received:2018-08-09 Online:2019-08-15 Published:2019-08-12
  • Supported by:
    National Natural Science Foundation of China(61074087)


To balance load of cluster heads in wireless sensor networks and reduce extra energy consumption, this paper proposed a modified routing algorithm based on time competition clustering. Firstly, the algorithm limited sensors closed to base station into cluster to avoid that clustering energy saving benefits could not compensate for the cluster energy consumption. Secondly, the algorithm used base station broadcast common messages and clustered with time competition to reduce energy consumption for basic information exchange. Thirdly, the algorithm chose nodes according to optimal hops and high residual energy in candidates of cluster-heads as next relay node. In this way, the algorithm could balance load of cluster heads and save more energy. As shown in the simulation experiment, compared with LEACH and DEBUC, the algorithm prolonged network lifetime which used 30% nodes death as network failure, indicating the algorithm was valid in decreasing energy consumption and balancing load.

Key words: wireless sensor networks, routing algorithm, clustering, LEACH, optimal hops, candidates of cluster-head

CLC Number: 

  • TN926