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

• 论文 • 上一篇    下一篇

基于能量和密度的WSNs动态分区成簇路由算法

史雨雨,郁进明,李雪   

  1. (东华大学 信息科学与技术学院,上海 201620)
  • 出版日期:2016-06-15 发布日期:2016-06-22
  • 作者简介:史雨雨(1990-),女,硕士研究生。研究方向:ZigBee无线通信系统,路由算法与协议等。

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

摘要:

针对传统的层次型网络存在的分簇不合理和能耗不均衡等问题,提出了一种基于能量和密度的动态非均匀分区成簇路由算法。该算法先根据节点与基站之间的距离将网络合理地进行动态的区域划分,在区域内成簇,使靠近基站的簇规模小于距离基站较远的簇,减少靠近基站的簇首负担和能量消耗;通过综合考虑节点剩余能量和节点密度等因素来优化簇的非均匀划分和簇首的选择,簇首间采取基于数据聚合的多跳传输机制。仿真结果表明,与经典路由算法LEACH相比,该算法能有效均衡节点能耗,延长网络生命周期。

关键词: 无线传感器网络, 动态区域划分, 能量, 密度, LEACH

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

中图分类号: 

  • TN926