基于节点相对密度的无线传感器网络成簇算法

摘要

Reducing the energy consumption of sensor nodes and prolonging the life of the network are the central topics for research on wireless sensor networks routing protocols. According to the characteristics of LEACH anduneven distribution of network nodes, this paper introduces a new strategy of cluster-head selection based on the relative density of nodes in the novel algorithm-LEACH-D. In this algorithm, the distribution of nodes is considered in selection of cluster-heads and cluster tree routing mechanism is used to complete multi-hop communication in data transmission. The result of MATLAB simulation suggests that the improved algorithm has a significant improvement both on prolonging the cycle of life and reducing the energy loss compared with other algorithms.%降低传感器节点的能量损耗,延长网络生命周期,一直是无线传感器网络路由协议研究的重点.根据LEACH算法的特点以及网络节点可能出现簇头分布不均匀的状况,提出一种基于节点相对密度选取簇头的成簇算法LEACH-D.在该算法中簇头的选择考虑了节点分布密度,同时在数据传输中采用建立簇树路由的机制来完成多跳通信.并且通过MATLAB的仿真证明了改进算法在能量损耗和延长生命周期方面比原有算法有了比较大的提高.