›› 2016, Vol. 29 ›› Issue (6): 47-.

• Articles • Previous Articles     Next Articles

Dynamic Partitioned Clustering Routing Algorithm Based on Energy and Density for WSNs

SHI Yuyu,YU Jinming,LI Xue   

  1. (College of Information Science & Technology, Donghua University, Shanghai 201620, China)
  • Online:2016-06-15 Published:2016-06-22

Abstract:

Aiming at problems such as unreasonable clustering and imbalance of energy consumption, which exist in traditional hierarchical network, a dynamic partitioned clustering routing algorithm based on energy and density(DPC-ED) was proposed. In DPCED, the entire network is divided dynamically according to the distance between normal nodes and the sink node, making the regions closer to the sink node with smaller nodes to reduce the cluster heads burden and energy consumption. By considering factors such as residual energy and density to optimize the clusters uneven partition and the selection of cluster heads, and information is transmitted with mode of multiple hops based on data aggregate. Simulation results show that compared with the classical routing algorithm LEACH, DPCED can balance the nodes energy consumption and prolong lifetime of the network effectively.

Key words: wireless sensor networks;dynamic partition;energy;density;LEACH

CLC Number: 

  • TN926