使用部署知识的异构传感器网络有效成簇算法

成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间。异构传感网络在能量节约方面的性能更好。提出一种适应异构无线传感器网络的分布式能量有效的成簇方案DEECUDK。该方案首先利用部署知识部署节点,使能量在整个监测区域分布比较均匀,然后以节点的剩余能量与传感半径之内的节点的剩余覆盖能量为主参数,其相邻节点个数为辅参数来选举簇头节点。较高初始能量、剩余能量和相邻节点数多的节点比其他节点拥有更多的机会成为簇头节点,并引入活动节点判别式,不需要增加任何开销来减少簇内冗余数据量,从而使网络能量均匀消耗,延长网络的生存时间。通过模拟实验结果,与现有的异构传感网络成簇算法相比,新的算法在网络生存时间与网络吞吐量方面有着更好的性能。     

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

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

基于节点剩余能量的能量异构网络分簇算法

针对无线传感器网络中如何利用有限能量延长网络生存时间的问题,研究了分簇算法在能量异构传感器网络环境下的性能特点,设计出一种基于节点剩余能量,适用于多级能量异构网络的分簇算法。在该算法的网络簇头选举加权概率中引入了参量γ,使得在簇头选举过程中,具有较高的初始能量和剩余能量的节点在簇头选举过程中当选簇头的机会增多。避免了剩余能量较小的节点担任簇头引起节点过早死亡使网络覆盖度降低的问题,从而均衡消耗网络中的各节点能量,延长网络的生存时间。同时,引入簇头管理机制保证了网络每轮簇头数目的稳定,进而提高了网络的传输质量。实验仿真结果表明,该算法在多级能量异构网络下比LEACH、SEP和DEEC具有较长的网络生存时间和稳定的数据传输能力。     

基于EAD 协议的无线传感器网络高效成簇算法

在无线传感器网络中,成簇算法是减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络生存时间.本文提出了一种基于EAD 协议的无线传感器网络高效成簇算法（EC-EAD）。 EC-EAD算法在确立簇头节点时,将节点能量,节点之间距离与轮回次数综合加权,决定节点发送延迟。剩余能量高且距离较远的节点成为簇头节点,降低了网络内的簇头数目,也保证了网络能量的均匀消耗,延长了网络的生存时间。模拟实验结果表明,EC-EAD 算法在延长网络生存期方面比EAD 具有一定的优越性。     

非均匀分布异构传感器网络动态多簇头成簇算法

延长网络寿命、提高监控质量是无线传感器网络成簇算法的重要设计目标,在对现有主要成簇算法进行研究的基础上,提出一种适应于节点非均匀分布环境下多级能量异构传感器网络的动态多簇头成簇算法.算法中,节点根据网络最优簇头数确定节点邻居感知半径.通过节点间的广播,每个节点获得感知半径内的邻居节点密度,节点根据邻居节点密度和节点当前能量确定节点成为主簇头的概率.根据主簇头的能耗,各簇独立判断是否选举辅助簇头以分摊主簇头的能耗.仿真结果表明,与现有主要成簇算法相比,新的成簇算法拥有更长的生存时间和更优的网络监测质量.     

无线传感器网络路由算法改进及仿真研究

由于无线传感器能量消耗影响网络的寿命,传感器节点的能量无法更新且种能量受限,传统路由算法忽略簇头剩余能量情况,使剩余能量低的节点成为簇头而过早死亡,导致整个网络能量不均衡,网络生存时间过短。为了有效延长网络生存时间,提出一种改进的LEACH路由算法。在簇头选择阶段,采用剩余能量的簇头节点优先选择机制,避免剩余能量低的节点成为簇头,然后在数据传输阶段,用单跳和多跳的混合传输模式,使整个网络能量尽量均衡。仿真结果表明,相对于传统LEACH路由算法,改进算法更加均衡了网络中各节点的能量消耗,有效地防止剩余能量低的节点成为簇头,可延长整个网络的生存寿命。     

基于能量分布的异构传感器网络分簇算法

针对能量异构的无线传感器网络,提出一种分簇算法。该算法采用基于节点剩余能量分布状况的簇头竞争参数,降低成簇过程中的通信能耗,实现簇头的均匀分布。在簇间综合考虑簇头剩余能量及其与基站的通信能耗,以选择合适的下一跳路由节点。仿真结果表明,该算法可以均衡网络能量消耗,提高节点能量利用效率,延长网络寿命。     

多级能量异构传感器网络的负载均衡成簇算法

在多级能量异构无线传感器网络中,节点的初始能量在一定的范围内随机分布,负载均衡和降低能耗是能量异构网络成簇算法的一个重要挑战.现有的分布式成簇算法主要是针对能量同构或二级异构网络设计的,无法实现节点能量多级异构时的负载均衡,因此提出了适用于多级能量异构传感网络的负载均衡成簇算法LBCA(load balance clustering algorithm).LBCA根据传感器网络的能量分布情况选择簇头节,最和实现负载均衡,可以有效地延长网络的稳定周期.簇头选择过程中,当探测区域能量分布均衡时,拥有较低平均通信能耗的节点将优先成为簇头节点,有利于降低探测区域内的总通信能耗;当探测区域能量分布不均衡时,具有较高剩余能量的节点将优先成为簇头节点,有利于实现探测区域内的负载均衡.将LBCA与主要的分布式成簇方案进行了比较,模拟实验结果显示,在多级能量异构传感器网络中,LBCA可以更好地实现负载均衡,极大地提高网络的稳定周期.     

基于LEACH协议的簇头多跳(LEACH-M)算法

为了延长网络的生存时间,需要设计能量有效的协议,适应传感器网络的特点.成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间.早先提出的LEACH协议是无线传感网中的低功耗自适应分层路由算法,但节点通过一跳通信将数据传送给簇头,簇头也通过一跳通信将聚合后的数据传送给基站,这样会造成簇头节点负载过重,在LEACH协议中引入簇头多跳算法,使得簇头之间形成一个多跳的最优路径通向基站,从而减少了簇头节点能量的消耗,延长了传感网的寿命.实验表明此方法行之有效.     

一种改进的无线传感器网络LEACH协议

利用成簇算法延长无线传感器网络的生命周期是一个研究热点.LEACH就是一种基于簇的协议.提出一种改进方案,成簇过程考虑传感器节点剩余能量和簇头与非簇头节点之间的距离,并增加了自我维护和局部成簇的特性,有效地提高了生命周期.     

Research of energy efficient clustering algorithm for multilayer wireless heterogeneous sensor networks prediction research

In designing wireless sensor networks of image transmitting, it is important to reduce energy dissipation and prolong network lifetime. This paper presents the research on existing clustering algorithm applied in heterogeneous sensor networks and then puts forward an energy-efficient prediction clustering algorithm, which is adaptive to sensor networks with energy and objects heterogeneous. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residual energy, so that the network energy can be dissipated uniformly. In order to reduce energy consumption when broadcasting in clustering phase and prolong network lifetime, an energy consumption prediction model is established for regular data acquisition nodes. Simulation results and the application in image clustering show that compared with current clustering algorithms, this algorithm can achieve longer sensor network lifetime, higher energy efficiency, and superior network monitoring quality.     

一种异构传感器网络下的节能分簇路由算法

无线传感器网络存在着严重的能量约束,传统同构的传感网络路由协议和算法不适合异构网络,因此,设计异构传感网络下的节能路由算法具有现实意义。研究两种不同类型传感器节点构成的,具有不同的初始能量和不同感知数据能力的异构网络中基于簇头预测的节能分簇路由算法ECAH。根据簇内节点的剩余能量、能量消耗速率和跟上一轮簇头的距离预测出下一轮簇头,有效地减少了控制报文数量,降低了系统开销,节约了能量。仿真结果显示,在异构的网络中采用ECAH路由算法比LEACH算法网络生存时间大约提高了23%。     

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.     

EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks

In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network’s life time. Each clustering algorithm is composed of two phases, the setup phase and steady state phase. The hot point in these algorithms is the cluster head selection. In this paper, we study the impact of heterogeneity of nodes in terms of their energy in wireless sensor networks that are hierarchically clustered. We assume that a percentage of the population of sensor nodes is equipped with the additional energy resources. We also assume that the sensor nodes are randomly distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. Homogeneous clustering protocols assume that all the sensor nodes are equipped with the same amount of energy and as a result, they cannot take the advantage of the presence of node heterogeneity. Adapting this approach, we introduce an energy efficient heterogeneous clustered scheme for wireless sensor networks based on weighted election probabilities of each node to become a cluster head according to the residual energy in each node. Finally, the simulation results demonstrate that our proposed heterogeneous clustering approach is more effective in prolonging the network lifetime compared with LEACH.     

无线传感器/执行器网络中能量有效的实时分簇路由协议

无线传感器/执行器网络(WSANs)主要应用于自动控制领域,实时性问题是其面临的首要挑战.根据实际环境中的节点部署情况,建立了系统模型;研究了分簇策略与功率控制技术对于自组织网络实时性的影响,提出了一种可适用于WSANs的能量有效的实时分簇路由协议--RECRP协议.该协议采用二级成簇策略使网络中的各类节点稳定分簇.分簇后的各类节点具有不同发射功率,利用执行器节点的强大通信能力有效降低网络延时.采用能量有效性算法使网络中的传感器节点轮换担任簇首,从而使网络能量均匀消耗,延长网络的生存时间.实验结果证明,在WSANs中RECRP协议可使网络稳定分簇,并且在网络的实时性与能量有效性方面与现有典型路由协议相比具有更优越的性能.     

基于节能的无线传感器网络LEACH协议改进

由于传感器节点电池电量有限,因此在无线传感器网络中如何节能是一个关键问题。对经典的LEACH(Low En-ergy Adaptive Clustering Hierarchy)协议做出改进:提出了一种新型的簇首选择机制。算法通过综合考虑候选节点的剩余能量、地理位置等参数来优化簇首的选择,从而有效地降低了低能量与位置不佳的节点被选为簇首的可能性,进一步保证网络内节点能量负载的均衡性。仿真结果表明,新型的簇首选择机制能够有效平衡节点的能量消耗分布,延长节点与网络的寿命。     

Dynamic cluster head for lifetime efficiency in WSN

Saving energy and increasing network lifetime are significant challenges in wireless sensor networks （WSNs）. In this paper, we propose a mechanism to distribute the responsibility of cluster-heads among the wireless sensor nodes in the same cluster based on the ZigBee standard, which is the latest WSN standard. ZigBee supports ad hoc on-demand vector （AODV） and cluster-tree routing protocols in its routing layer. However, none of these protocols considers the energy level of the nodes in the network establishing process or in the data routing process. The cluster-tree routing protocol supports single or multi-cluster networks. However, each single cluster in the multi-cluster network has only one node acting as a cluster head. These cluster-heads are fixed in each cluster during the network lifetime. Consequently, using these cluster-heads will cause them to die quickly, and the entire linked nodes to these cluster-heads will be disconnected from the main network. Therefore, the proposed technique to distribute the role of the cluster head among the wireless sensor nodes in the same cluster is vital to increase the lifetime of the network. Our proposed technique is better in terms of performance than the original structure of these protocols. It has increased the lifetime of the wireless sensor nodes, and increased the lifetime of the WSN by around 50% of the original network lifetime.     

HDEEC：面向异构网络的一种基于簇路由协议

有效地使用传感节点的能量进而延长网络寿命成为设计无线传感网路由协议的一项挑战性的工作.为了延长网络,现存的多数簇方案是面向同构网络.为此,面向异构网络,提出基于簇的分布式能量有效路由HDEEC(heterogeneous WSN distributed energy-efficient clustering)协议.HDEEC协议首先提出异构网络模型,考虑了普通节点、特优节点和超特优节点三级能量节点;然后,提出能量消耗模型;最后依据这两个模型,提出了簇头选择方案.HDEEC协议以平衡、有效方式动态改变节点被选为簇头的概率.仿真结果表明,提出的HDEEC协议能够有效延长网络寿命,比DEEC、DDEEC的网络寿命分别提高了72％、68％.     

CRPD: a novel clustering routing protocol for dynamic wireless sensor networks

A wireless sensor network (WSN) consists of a large number of static or mobile, low-cost, and low-power sensor nodes. And energy is one of the most important factors that should be considered. In this paper, we propose clustering-based routing protocol for dynamic networks (CRPD) to reduce energy consumption and improve energy efficiency through clustering and routing algorithms. The basic idea is to periodically update the network topology and select the node with larger degree and high residual energy as the cluster head to be responsible for data aggregation and transmission. With the nodes moving, joining, and choosing the optimal clustering radius, the energy load of the whole network can be evenly distributed to each sensor node, which can significantly prolong the network lifetime. Extensive simulations show that CRPD is more energy-efficient than the existing protocols.     

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.