无线传感器网中一种按需加权分簇算法

AN ON-DEMAND WEIGHTED CLUSTERING ALGORITHM IN WIRELESS SENSOR NETWORKS

针对无线传感器网络节点能量受限的特点,提出一种按需加权分簇算法。该算法通过节点间的信息交互,获得较多的局部网络信息,综合考虑节点的当前能量值、度数和发射功率等因素,根据不同的网络应用背景做出不同的分簇决策。仿真结果表明,与具有代表性的分簇算法LEACH(Low-Energy Adaptive Clustering Hierarchy)相比,分簇更合理,减少了能量消耗,延长了网络的生存周期。

According to the characteristic of limited energy supply of nodes in wireless sensor networks, an on-demand weighted clustering algorithm was proposed. The algorithm acquires more local network information through the interaction of information between nodes, takes the factors of the nodes such as current energy, degree and transmission power into consideration comprehensively, and makes different clustering decision according to different network application background. Comparing with the representative clustering algorithm LEACH, the results of simulation demonstrated that the proposed algorithm was more reasonable in clustering, the energy consumption was reduced, and the network lifetime was prolonged.