An Energy-Efficient Clustering Solution for Wireless Sensor Networks

An Energy-Efficient Clustering Solution for Wireless Sensor Networks
复制标题

DOI:
10.1109/twc.2011.092011.110717
复制
发表时间:
2011-11-01
影响因子:
10.4
通讯作者:
Tafazolli, Rahim
Tafazolli, Rahim
中科院分区:
计算机科学1区
文献类型:
--
作者:
Wei, Dali;Jin, Yichao;Tafazolli, Rahim

文献摘要

被引文献

相似文献

无线传感器网络中的热点是指网络流量较大的区域。这些地区的节点会迅速耗尽能源,导致网络服务中断。这个问题是常见的数据收集场景中,集群头(CH)有一个沉重的负担,收集和中继信息。随着到汇点的距离减小,CH上的中继负载尤其加剧。为了平衡网络中的流量负载和能量消耗,CH角色应该在网络的不同部分之间轮换,簇的大小应该在网络的不同部分仔细确定.本文提出了一种分布式的分簇算法--能量有效的分簇算法(EC),它根据到数据宿的跳距来确定合适的簇大小,同时实现节点寿命的近似均衡和降低的能耗水平。我们还提出了一个简单的节能多跳数据收集协议来评估EC的有效性并计算该协议的端到端能耗;但EC适合任何注重节能的数据收集协议。性能测试结果表明,EC延长网络的生命周期,实现能量均衡更有效地比两个著名的聚类算法,HEED和UCR。
Hot spots in a wireless sensor network emerge as locations under heavy traffic load. Nodes in such areas quickly deplete energy resources, leading to disruption in network services. This problem is common for data collection scenarios in which Cluster Heads (CH) have a heavy burden of gathering and relaying information. The relay load on CHs especially intensifies as the distance to the sink decreases. To balance the traffic load and the energy consumption in the network, the CH role should be rotated among all nodes and the cluster sizes should be carefully determined at different parts of the network.This paper proposes a distributed clustering algorithm, Energy-efficient Clustering (EC), that determines suitable cluster sizes depending on the hop distance to the data sink, while achieving approximate equalization of node lifetimes and reduced energy consumption levels. We additionally propose a simple energy-efficient multihop data collection protocol to evaluate the effectiveness of EC and calculate the end-to-end energy consumption of this protocol; yet EC is suitable for any data collection protocol that focuses on energy conservation. Performance results demonstrate that EC extends network lifetime and achieves energy equalization more effectively than two well-known clustering algorithms, HEED and UCR.