计算机应用

• 网络与通信 •    下一篇

传感器网络中一种基于质心的分布式成簇算法

姜少峰杨明花宋瀚涛吴正宇王捷民   

  1. 北京理工大学 计算机科学技术学院,北京 100081
  • 收稿日期:1900-01-01 修回日期:1900-01-01 发布日期:2007-01-01 出版日期:2007-01-01

Centroid-based distributed clustering scheme for wireless sensor networks

JIANG Shao-feng, YANG Ming-hua, SONG Han-tao, WU Zheng-yu, WANG Jie-min   

  1. School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-01-01 Published:2007-01-01

摘要: 在LEACH的基础上,提出了一种适合无线传感器网络的基于质心的分布式成簇算法——CDCS。在CDCS中,每一个节点首先基于最优簇首概率popt自主确定自己是否为临时簇首。然后临时簇首根据收集到的簇内节点信息,确定簇内近似质心,并由此动态调整簇内结构,使得调整后的簇内通信总能耗尽可能小。理论分析和模拟实验表明,CDCS在保持LEACH算法简单性的同时,可以获得比LEACH更好的性能,优化后的簇首选择策略可以在不同场景下有效延长网络生存时间达32%~38%。

关键词: 无线传感器网络, 成簇算法, 质心

Abstract: Based on LEACH, we proposed a novel clustering algorithm Centroidbased Distributed Clustering Scheme(CDCS) for Wireless Sensor Networks(WSNs). In CDCS, each sensor firstly decided whether it was local tentative clusterheads on its own at any given time with a certain probability popt. The tentative clusterhead computed the centroid of cluster based on information of sensors within cluster; and then dynamically adjusted the structure of cluster, so that the total energy dissipation within the cluster was minimized. Theoretical analysis and simulation results show that CDCS prolong the lifetime of a sensor network by 32%~38% over that of LEACH in different scenes while still maintaining the simplicity of LEACH.

Key words: wireless sensor network, clustering algorithm, centroid