期刊文献+

一种改进的无线传感器网络最小加权分簇算法 被引量:1

Improved minimum weighted clustering algorithm in wireless sensor networks
下载PDF
导出
摘要 分簇算法是无线传感器网络领域中一个典型的算法,它在其中扮演着重要的角色。无线传感器网络中传感器节点间分簇的优劣,影响传感器节点的能量消耗与网络的生命周期。文中针对传统分簇算法节点能耗不平衡以及网络寿命短的不足,提出一种改进的最小加权分簇算法,算法综合考虑了节点的剩余能量、节点间的相对距离以及传感器分布密度,基于成本函数和密度的权重来选择簇头,并且使用簇头节点在所有节点间轮转的方法,来确保候选簇头节点的合理性。仿真结果表明,改进的最小加权分簇算法中选择一定比例的传感器作为簇头和簇内传送数据的节点的方法,能够降低信息重复率,提高簇头选择效率,从而可以均衡网络节点能耗,延长网络寿命,验证了所提出的改进的最小加权分簇算法是有效的。 Clustering algorithms are very important in the area of wireless sensor network. The clustering among sensor nodes in wireless sensor networks has an impact on the energy consumption and the network lifetime. To overcome the shortages of unbalanced node energy consumptionand short network lifetime of traditional clustering algorithms, an improvement of minimum weighted clustering algorithm is proposed. The algorithm synthesizes the residual energy of the nodes, the relative distance between the nodes and the distribution density of the sensor nodes. Choosing the cluster heads in the algorithm is based on the cost function and the density. In order to ensure the rationality of the candidate cluster head nodes, the algo- rithm makes the cluster head nodes rotate among all nodes. Experimental results show that the improved algorithm selects a certain proportion of the sensors as the cluster head and the nodes for transmitting the data in the cluster ,which can reduce the repetition rate of the information and improve the efficiency of cluster head selection. The algorithm has the result of better balancing network node energy consumption, thus prolonging the network lifetime. The improvement of minimum weighted clustering algorithm is proved to be effective.
出处 《南京邮电大学学报(自然科学版)》 北大核心 2016年第5期56-63,共8页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金 国家自然科学基金(61170276 61373135) 江苏省高校自然科学研究重大项目(12KJA520003)资助项目
关键词 无线传感器网络 分簇算法 能量消耗 网络寿命 权重 wireless sensor network clustering algorithm energy consumption network lifetime weight
  • 相关文献

参考文献5

二级参考文献34

  • 1[1]Heinzelman W,Chandrakasan A,Balakrishnan H.An application-specific protocol architecture for wireless microsensor networks[J].IEEE Transactions on Wireless Communications,2002,1 (4):660-670. 被引量:1
  • 2[2]Lindsey S,Raghavenda CS.PEGASIS:Power efficient gathering in sensor information systems[C].New York:Proceedings of the IEEE Aerospace Conference,IEEE Press,2002:1125? 1130. 被引量:1
  • 3[3]Tabassum N,Ahsanul Haque AKM,Urano Y,etal.GSEN:An Efficient Energy Consumption Routing Scheme for Wireless Sensor Network[C].Nishi-Tomida:Proceedings of IEEE international conference on systems and international conference on mobile communications and learning technologies (ICNICONSMCL'06),2006:117-122. 被引量:1
  • 4[4]Chatterjee M,Das S,Turgut D.WCA:a weighted clustering algorithm for mobile ad hoc networks[J].Cluster computing journal,2002,4(5):193-204. 被引量:1
  • 5HEINZELMAN W B, CHANDRAKASAN A P, BALAKRISHNAN H. An application-specific protocol architecture for Wireless Micrnsensor Networks [ J ]. IEEE Tran on Wireless Communications, 2002, 1(4) : 660 -670. 被引量:1
  • 6CAO Yongtao, CHEN He. A Distributed Clustering Algorithm with an Adaptive Backoff Strategy for Wireless Sensor Networks[ J]. IEICE Trans on Communications,2006 ( 2 ) :609 - 613. 被引量:1
  • 7LIU Lifei. An Energy-Efficient Routing and Self-Organization Algorithm in Wireless Sensor Networks[ J ]. Journal of China Universities of Posts and Telecommunications, 2005, 12 (2) : 87 - 93. 被引量:1
  • 8MHATRE V, ROSENBERG C. Design guideline for wireless sensor networks: communication, clustering and aggregation [ J ]. Ad Hoc Networks Journal, 2004,2(1 ) : 45 -63. 被引量:1
  • 9MHATRE V, ROSENBERG C. Homogeneous vs Heterogeneous Clustered Sensor Networks: A Comparative Study[J]. Proceeding of IEEE ICC ,2004,27( 1 ) :3646 -3651. 被引量:1
  • 10KUMAR S,LAI T H,BALOGH J. On k-Coverage in a Mostly Sleeping Sensor Network[ C]//Proc of ACM MobiCom. 2004 : 144 - 158. 被引量:1

共引文献22

同被引文献8

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部