An energy efficient hierarchical clustering algorithm for wireless sensor networks
An energy efficient hierarchical clustering algorithm for wireless sensor networks
复制标题
DOI：
10.1109/infcom.2003.1209194
复制
发表时间：
2003-07
期刊：
影响因子：
--
通讯作者：
S. Bandyopadhyay;E. Coyle
中科院分区：
文献类型：
--
作者：
S. Bandyopadhyay;E. Coyle
由大量具有低功耗收发器的小型传感器组成的无线网络可以成为在各种环境中收集数据的有效工具。每个传感器收集的数据通过网络传送到单个处理中心，该处理中心使用所有报告的数据来确定环境的特征或检测事件。通信或消息传递过程必须被设计成节省传感器的有限能量资源。将传感器聚类成组，使得传感器仅向簇头传送信息，然后簇头将聚合的信息传送到处理中心，可以节省能量。本文提出了一种分布式、随机分簇算法，将无线传感器网络中的传感器组织成簇。然后，我们扩展该算法生成一个层次的簇头，并观察到，在层次结构中的级别的数量增加的能量节省。在随机几何的结果是用来推导出我们的算法，最大限度地减少网络中所花费的总能量时，所有传感器的数据报告，通过簇头的处理中心的参数值的解决方案。
A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.