T-LEACH: The method of threshold-based cluster head replacement for wireless sensor networks

In wireless sensor networks, power is the most essential resource because each sensor node has limited batteries. Many kinds of existing clustering protocols have been developed to balance and maximize lifetime of the sensor nodes in wireless sensor networks. These protocols select cluster heads periodically, and they considered only ‘How can we select cluster heads energy-efficiently?’ or ‘What is the best selection of cluster heads?’ without considering energy-efficient period of the cluster heads replacement. Unnecessary head selection may dissipate limited battery power of the entire sensor networks. In this paper, we present T-LEACH, which is a threshold-based cluster head replacement scheme for clustering protocols of wireless sensor networks. T-LEACH minimizes the number of cluster head selection by using threshold of residual energy. Reducing the amount of head selection and replacement cost, the lifetime of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that T-LEACH outperformed LEACH in terms of balancing energy consumption and network lifetime.     

An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks

Due to the limitation of energy resources, energy efficiency is a key issue in wireless sensor networks (WSNs). Clustering is proved to be an important way to realize hierarchical topology control, which can improve the scalability and prolong the lifetime of wireless sensor networks. In this paper, an energy-driven unequal clustering protocol (EDUC) for heterogeneous wireless sensor networks is proposed. EDUC includes an unequal clustering algorithm and an energy-driven adaptive cluster head rotation method. The unequal size of clusters can balance the energy consumption among clusters, and the energy-driven cluster head rotation method can achieve the balance of energy consumption among nodes within a cluster, which reduces the waste of energy. Simulation experiments show that EDUC balances the energy consumption well among the cluster heads and prolongs the network lifetime.     

一种基于网格的无线传感器网络分簇路由协议

为延长网络生存时间,提出了一种基于网格的无线传感器网络分簇路由协议.整个网络分成若干个虚拟网格,每个虚拟网格形成一个簇,采用唯一簇头选举法产生簇头,且簇内成员可以根据局部的信息调整簇的大小,达到节省能量的目的.仿真实验和分析表明:该协议能均衡网络能量,延长网络的生存时间.     

基于分簇机制的移动无线传感器网络数据采集协议*

为了均衡无线传感器网络的能量消耗,提出了一种基于分簇机制的移动无线传感器网络数据采集协议。该协议中,整个网络使用网格均匀分簇,节点根据加权能量—邻居规则选出分布在簇中间区域的簇头,簇头负责收集簇内兴趣事件并进行数据融合,移动sink依次运动到簇的中心点位置收集簇内兴趣事件。仿真结果表明,该协议有效地均衡了网络的能量消耗,延长了网络的生存时间。     

一种基于非均匀分簇的无线传感器网络路由协议

在路由协议中利用分簇技术可以提高无线传感器网络的可扩展性.当簇首以多跳通信的方式将数据传输至数据汇聚点时,靠近汇聚点的簇首由于转发大量数据而负载过重,可能过早耗尽能量而失效,这将导致网络分割.该文提出一种新颖的基于非均匀分簇的无线传感器网络多跳路由协议.它的核心是一个用于组织网络拓扑的能量高效的非均匀分簇算法,其中候选簇首通过使用非均匀的竞争范围来构造大小不等的簇.靠近汇聚点的簇的规模小于远离汇聚点的簇,因此靠近汇聚点的簇首可以为簇间的数据转发预留能量.模拟实验结果表明,该路由协议有效地平衡了簇首的能量消耗,并显著地延长了网络的存活时间.     

无线传感器网络中基于节点密度的簇算法

能量有效的路由协议对于无线传感器网络至关重要,它能够延长整个网络的生存时间.首先简要介绍了无线传感器网络中的路由算法,分析了Leach算法的优缺点.在Leach的基础上,结合节点密度,提出了一种基于节点密度的簇算法.算法在选举簇头的过程中,能够根据节点密度均衡划分各个簇的规模,从而平衡各簇的网络负载,降低网络中能量分布的不均.仿真表明,与Leach相比,该算法延长了网络生存时间,降低了能耗.     

PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks

The main goal of this research is concerning clustering protocols to minimize the energy consumption of each node, and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols consume large amounts of energy, incurred by cluster formation overhead and fixed-level clustering, particularly when sensor nodes are densely deployed in wireless sensor networks. In this paper, we propose PEACH protocol, which is a power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks. By using overhearing characteristics of wireless communication, PEACH forms clusters without additional overhead and supports adaptive multi-level clustering. In addition, PEACH can be used for both location-unaware and location-aware wireless sensor networks. The simulation results demonstrate that PEACH significantly minimizes energy consumption of each node and extends the network lifetime, compared with existing clustering protocols. The performance of PEACH is less affected by the distribution of sensor nodes than other clustering protocols.     

基于能耗的无线传感器网络最优簇首数研究

在无线传感器网络中,如何减少系统能耗、延长网络生存时间是最具挑战性的问题之一。LEACH路由协议通过网络分簇和簇首循环,使网络能量负载平衡,从而达到降低能耗的目的。该协议的关键是簇首数的选择,其最优值可使网络能耗降到最低。在深入研究LEACH协议及其能量模型的基础上,提出了一种最优簇首数的估算算法,并通过蒙特卡洛仿真验证了该算法的正确性。所得结论对无线传感器网络结构和路由协议的设计具有指导作用。     

改进的无线传感器网络LAC分簇路由协议

无线传感器网络的路由协议是无线传感器网络研究的关键技术,在延长网络寿命,减少节点能耗方面有着重要的作用。提出一种基于LAC的改进分簇路由协议。该协议中,对LAC的簇头选择机制进行了改进,考虑了节点的能量和连通性。同时,对于LAC中的处于同一区域的节点,根据节点的分布形成不同大小的簇,使得簇头的负载更均匀,从而延长网络的生存时间。仿真结果显示：本协议能更好地延长网络的寿命。     

一种能量高效的无线传感器网络分簇路由算法

无线传感器网络中节点的能量有限,提高能量的有效性便成为无线传感器网络路由协议设计的首要目标。设计了一种能量高效的分簇路由算法,它提出让候选节点在一定的覆盖范围内以剩余能量为标准来竞选簇头,以使簇头分布均匀;处于簇类交界的节点则根据能量和距离来选择归属的簇头,以平衡网络负载;新算法还采用多跳的簇间通信方式来降低大部分簇头节点的通信负载。仿真结果表明:新算法能够有效降低网络能耗,延长网络生存时间。     

多级能量异构无线传感器网络的能量预测和可靠聚簇路由协议

传感器网络技术是普通计算中实现位置感知和上下文感知的主要技术手段,有着广泛的应用前景.文中提出了一种适合普适计算环境下多级能量异构尢线传感器网络的新的剩余能量预测REP模型和可靠聚簇路由RCR协议.协议中节点通过建立相邻节点剩余能量预测机制,使选举簇头节点的概率与节点当前剩余能晕直接相关,以优化数据传输路径.均衡节点的能量消耗.延长网络寿命.此外还通过多簇头方法.采用每个簇由多簇头节点共同承担簇头节点的作用,提高数据传输可靠件.仿真实验结果表明,RCR协议能获得比LEACH协议和HEED协议等主要聚簇协议更长的生存时间、更高的能量利用率和更高的数据传输可靠性.     

能量异构的无线传感器网络分簇协议

无线传感器网络分簇协议通常假定网络是同构的,即网络中所有节点具有相同的初始能量,这些协议不能充分利用异构网的特点。提出了一种适合于异构网的分布式分簇协议（EHCP）,该协议优先选择剩余能量较多的节点作为簇首以平衡节点的能量,并在簇间采用多跳通信以节省能量。仿真实验结果表明：与同类协议相比,EHCP协议能显著地延长网络稳定工作的时间,具有良好的性能。     

基于混合分簇的无线传感器网络路由协议

提出一种基于混合分簇的无线传感器网络路由协议(EEHCRP).该协议综合了集中式和分布式分簇的优点,使得簇头分布更加均匀并减少了簇重构的开销.在此分簇的基础上,使用改进的多路径路由树建立簇问路由,使其不但可以减少重传次数,提高数据传输的稳定性,还缓解了簇头的能耗.然后使用CMMBCR算法建立一条能量高效的簇内路由.仿真结果表明:该协议较之经典的分簇路由协议不仅有效地均衡了网络能量消耗、显著地延长了网络生命周期,而且具有较强的鲁棒性.     

基于相对距离的多级能量异构传感器网络成簇算法

延长网络寿命并获得更好的监控质量是无线传感器网络成簇算法的重要性能指标。在分析现有主要成簇算法的基础上,提出了一种适应于多级能量异构传感器网络的基于相对距离的成簇算法RDCA(Relative Distance Clus-tering Algorithm)。算法中,节点根据通信范围内其他节点与自身的平均距离、节点自身与基站的距离以及节点当前剩余能量来确定节点成为簇头的概率。所有节点轮流成为簇头,以分摊能量消耗。仿真实验结果表明,与现有主要聚簇算法相比,在多级能量异构环境下,新的成簇算法拥有更长的生存时间和更优的网络监测质量。     

An energy-saving routing architecture with a uniform clustering algorithm for wireless body sensor networks

Wireless body sensor networks are expected to extend human-centered applications in large-scale sensing and detecting environments. Energy savings has become one of the most important features of the sensor nodes to prolong their lifetime in such networks. To provide reasonable energy consumption and to improve the network lifetime of wireless body sensor network systems, new and efficient energy-saving schemes must be developed. An energy-saving routing architecture with a uniform clustering algorithm is proposed in this paper to reduce the energy consumption in wireless body sensor networks. We adopted centralized and cluster-based techniques to create a cluster-tree routing structure for the sensor nodes. The main goal of this scheme is to reduce the data transmission distances of the sensor nodes by using the uniform cluster structure concepts. To make an ideal cluster distribution, the distances between the sensor nodes are calculated, and the residual energy of each sensor node is accounted for when selecting the appropriate cluster head nodes. On the basis of the uniform cluster location, the data transmission distances between the sensor nodes can be reduced by employing an adaptive multi-hop approach. The energy consumption is reduced, and the lifetime is extended for the sensor nodes by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the energy consumption and the network lifetime for the wireless body sensor networks.     

一种综合能量和节点度的传感器网络分簇算法

针对无线传感器网络分簇过程中簇首耗能过快问题,提出了一种综合节点剩余能量和节点度数进行簇首选取的分簇算法ENCA(energy and node degree synthesized clustering algorithm).该算法在每轮的簇首选取中考虑了每个簇内所有节点的剩余能量和平均剩余能量,并在每个簇中依据节点的度数优化簇首的选择.在算法运行过程中,在保证网络连通的同时,避免了能量较低的节点当选为簇首.仿真结果表明,与LEACH算法和ACE算法相比,ENCA算法均衡了网络中节点的能量消耗,有效延长了网络寿命.     

基于非均匀分簇与路径优化的WSN路由协议

在无线传感网络中,传感节点的能量有限性,使得能量有效利用成为其"热点"问题。针对LEACH协议簇头的随机选择,导致成簇不合理或簇头节点加速死亡,簇首与基站直接通信能量消耗大的问题。提出了一种高能效路由协议UCPO。该协议根据最佳簇头个数划分区域,综合考虑簇内能量消耗和节点剩余能量选择簇头,以多跳方式完成数据的发送。仿真表明,改进协议显著减少整个网络能量消耗,延长了网络的生存周期。     

IRPL: An energy efficient routing protocol for wireless sensor networks

This study aims to overcome the disadvantages of the original RPL (IPv6 Routing Protocol for Low power and Lossy networks) routing protocol (RPL including problems with energy consumption and energy load balance). We developed a relatively balanced RPL – the improved protocol (IRPL). This protocol is based on an efficient clustering algorithm and an effective topology control model of the loop domain communication route. The clustering algorithm can be used to calculate the optimal number of cluster heads by assumption of the network model. Combined with the clustering probability model and the node competition mechanism, the cluster head node in the wireless sensor network was used to complete the clustering process. In the topology control model, the wireless sensor network was divided into concentric rings with equal areas. Nodes determined the best network route, depending on different levels of ring domain and the optimal forwarding communication area defined in this study. Simulation results indicate that the IRPL routing protocol can reduce overall network energy consumption, balance network energy consumption, and prolong network lifetime.     

C-DTB-CHR: centralized density- and threshold-based cluster head replacement protocols for wireless sensor networks

Advances introduced to electronics and electromagnetics leverage the production of low-cost and small wireless sensors. Wireless sensor networks (WSNs) consist of large amount of sensors equipped with radio frequency capabilities. In WSNs, data routing algorithms can be classified based on the network architecture into flat, direct, and hierarchal algorithms. In hierarchal (clustering) protocols, network is divided into sub-networks in which a node acts as a cluster head, while the rest behave as member nodes. It is worth mentioning that the sensor nodes have limited processing, storage, bandwidth, and energy capabilities. Hence, providing energy-efficient clustering protocol is a substantial research subject for many researchers. Among proposed cluster-based protocols, low-energy adaptive clustering hierarchy (LEACH) and threshold LEACH (T-LEACH), as well as modified threshold-based cluster head replacement (MT-CHR) protocols are of a great interest as of being energy optimized. In this article, we propose two protocols to cluster a WSN through taking advantage of the shortcomings of these protocols (i.e., LEACH, T-LEACH, and MT-CHR), namely centralized density- and threshold-based cluster head replacement (C-DTB-CHR) and C-DTB-CHR with adaptive data distribution (C-DTB-CHR-ADD) protocols that mainly aim at optimizing energy through minimizing the number of re-clustering operations, precluding cluster heads nodes premature death, deactivating some nodes located at dense areas from cluster’s participation, as well as reducing long-distance communications. In particular, in C-DTB-CHR protocol, some nodes belong to dense clusters are put in the sleeping mode based on a certain node active probability, thereby reducing the communications with the cluster heads and consequently prolonging the network lifetime. Moreover, the base station is concerned about setting up the required clusters and accordingly informing sensor nodes along with their corresponding active probability. C-DTB-CHR-ADD protocol provides more energy optimization through adaptive data distribution where direct and multi-hoping communications are possible. Interestingly, our simulation results show impressive improvements over what are closely related in the literature in relation to network lifetime, utilization, and network performance degradation period.     

基于控制的低能耗多跳分簇路由协议

针对无线传感器网络(WSN)的多跳分簇协议中,Sink节点附近的簇头能量消耗过快,簇头分布不够均匀,多跳链路不够高效等关键问题,提出了基于控制的低能耗多跳分簇路由协议。通过控制成簇数量与大小、多跳链路能耗、轮数与每一轮中的数据传输量来解决以上问题。仿真结果表明：所提协议与低功耗自适应分簇(LEACH)协议和基于非均匀分簇的无线传感器网络路由协议(EEUC)相比,网络稳定期分别延长了138%和13%,网络生命期分别延长了13%和8%,因此能够有效地降低网络能耗,均衡网络负载,延长网络生存时间。