无线传感器网络中一种能量有效的簇内通信方案

为了提高簇内通信的能耗均衡性,提出了一种能量有效的分簇无线传感器网络簇内空分通信方案——近簇头节点采用单跳传输,远簇头节点多跳传输,给出了空分通信方案的工程实现。仿真结果验证了空分混合通信方案在能量有效性和能耗均衡分配方面的优势。     

无线传感网络中能耗均衡的混合通信算法研究

基于经典的低能耗自适应分簇算法(LEACH),提出了一种能耗均衡的混合通信算法(EEHCA).由基站根据节点剩余能量和簇头之间的距离选举簇头,节点用单跳模式和多跳模式交替与簇头进行通信且概率分别是p和1-p,从而使簇头的分布更均匀,节点的负载更均衡.仿真结果表明该算法有效地平衡了节点的能量消耗,在延长生命周期方面明显好于LEACH.     

WSN中一种基于剩余能量级别的负载均衡路由协议

文中提出了一种WSN中基于剩余能量级别的负载均衡的分簇路由协议REICRP.在簇的建立阶段,RELCRP采用了基于优先级的簇头选取策略,高优先级的节点能更早地广播簇头竞选通告,从而避免剩余能量低的节点成为簇头.簇间通信采用单跳一多跳混合传输模式,簇头节点根据剩余能量级别切换传输方式,以缓解"热点"问题.仿真结果表明:RELCRP有效地均衡了网络中节点的能量消耗,延长了网络的生存时间.     

一种无线传感器网络分簇路由算法研究

在分析LEACH协议的基础上提出一种基于能量和距离的多跳路由算法（CAED）。由基站依据节点剩余能量和簇头与基站的距离分别选出二层簇头,簇内节点利用单跳和多跳模式与簇头进行通信。仿真实验表明,新算法有效地平衡了节点的能量消耗,并显著地延长了网络的生命周期。     

非变换簇的WSN分簇路由算法

针对LEACH算法簇头选取及能量消耗方面的不足,提出一种基于能量、距离和节点度的分簇路由算法CMEDD,通过均匀分簇减少重建过程,对簇头选举公式进行改进,合理选择簇头,从而均衡节点能耗。采用基于代价因子的单跳和多跳相结合的方式建立最优路径进行数据传输。仿真结果表明,与LEACH算法和RMCRW算法相比,CMEDD算法能够有效均衡节点能耗,可相对延长网络生存周期。     

分布式能量均衡的WSN动态数据转发策略

针对无线传感器网络中存在的能量空洞问题,该文提出一种能量均衡的层次型数据转发策略。根据节点可用能量、节点之间相对位置及不同网络区域簇头能量消耗速率构建非均匀层次化结构。进而,综合考虑节点簇内通信开销和节点关系选取中继转发节点,并在多跳簇间数据转发时执行数据融合进一步降低转发数据量以实现簇间多跳通信的能量有效性。数值结果表明,所提机制可以有效地均衡网络负载,延长网络生命周期,改善网络数据转发性能。     

无线传感器网络能量均衡路由算法

设计了一种能量均衡的路由算法.路由的建立分两个阶段,在簇头建立阶段,让候选节点在覆盖范围内以剩余能量的多少和所处位置为标准来竞选簇头,以使簇头分布均匀,平衡网络覆盖;在通信阶段,根据簇头节点的剩余能量大小和其距离基站的远近,采用多跳的簇间通信方式建立路由,以此来降低簇头节点的通信负载.仿真结果表明该算法能够有效降低网络能耗和延长网络生存时间.     

无线传感器网络功率路由算法研究

无线传感器网络的应用越来越广泛,主要是军事、工业、医疗等方面。然而无线传感器网络具有节点能量、存储和计算能力非常有限等特点,文中在传统的LEACH（低功耗自适应集簇分层型）协议的基础上进行了改进,并提出了一种新的无线传感器网络路由算法LEACH-N。新算法沿用了LEACH协议簇的结构,在簇头选择方法上基于传统DCHS算法的簇头选择算法,簇内成员与簇头之间直接通信,簇头与基站之间轮流进行单跳和多跳通信;多跳通信则是采用一种改进的MTE（最小传输能量）路由算法。通过NS2仿真软件对LEACH-N协议与LEACH协议分别进行了性能测试。实验结果表明,相比LEACH协议,LEACH—N协议系统能耗低、网络生命周期长,且具有更好的规模可扩展性。     

一种响应型无线传感器网络路由算法

提出一种节能型无线传感器网络路由算法——TEENNEW.该算法利用能量模型确定了最优簇头数,在簇头选取阶段考虑了节点剩余能量;在数据传输阶段,该算法根据距离和能量建立簇头与基站之间的多跳通信路径.与传统的TEEN协议相比,TEENNEW算法延长了网络的生命周期,有效均衡了节点能耗.     

UCRP—一种能量有效的WSN非均匀分簇路由协议

提出了一种新的能量有效的非均匀分簇路由协议—UCRP.根据距离基站的远近将网络分为大小不同的簇;簇内数据传输根据簇范围的大小采用单跳或多跳;簇间数据传输构建多跳路由,簇首选择下一跳节点时将能量与最小跳数路由算法相结合;最后在能量有效的前提下对LEACH协议易受到HELLO flooding攻击提出了安全设想.仿真结果表明:该协议能够有效地均衡簇首和全网能耗,延长网络生存时间.     

Design guidelines for wireless sensor networks: communication, clustering and aggregation

When sensor nodes are organized in clusters, they could use either single hop or multi-hop mode of communication to send their data to their respective cluster heads. We present a systematic cost-based analysis of both the modes, and provide results that could serve as guidelines to decide which mode should be used for given settings. We determine closed form expressions for the required number of cluster heads and the required battery energy of nodes for both the modes. We also propose a hybrid communication mode which is a combination of single hop and multi-hop modes, and which is more cost-effective than either of the two modes. Our problem formulation also allows for the application to be taken into account in the overall design problem through a data aggregation model.     

Reliable and Energy Efficient Communication Algorithm in Hierarchical Wireless Sensor Networks

Wireless sensor networks are data centric networks, which transmit gathered data to sink nodes. Considering energy constraints, how to make full use of the limited energy to reliably transmit data as much as possible becomes a main research region in sensor networks. In this paper, we focus on energy consumption and reliability of different communication modes. Single hop communication mode is simple and easy to implement, but the distant cluster members, especially those on the edge of the networks, need to enlarge transmission power. On the other hand multi-hop communication is not constrained by the communication distance. The relay communication mode guarantees data transmission to a remote cluster head. Considering of the reliability and energy consumption, we propose a voting based clustering communication algorithm. And the optimal cluster number is calculated based on the geometry locations. Finally, several experiments have been done to validate the analysis in this paper.     

Topology control for fault-tolerant communication in wireless ad hoc networks

Fault-tolerant communication and energy efficiency are important requirements for future-generation wireless ad hoc networks, which are increasingly being considered also for critical application domains like embedded systems in automotive and aerospace. Topology control, which enables multi-hop communication between any two network nodes via a suitably constructed overlay network, is the primary target for increasing connectivity and saving energy here. In this paper, we present a fault-tolerant distributed topology control algorithm that constructs and continuously maintains a k-regular and k-node-connected overlay for energy-efficient multi-hop communication. As a by-product, it also builds a hierarchy of clusters that reflects the node density in the network, with guaranteed and localized fault-tolerant communication between any pair of cluster members. The construction algorithm automatically adapts to a dynamically changing environment, is guaranteed to converge, and exhibits good performance as well.     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

基于数据融合的无线传感器网络路由算法

在分簇协议LEACH和链状协议PEGASIS的基础上,提出一种新的基于数据融合的分簇路由算法.簇首节点采用多跳方式传输数据,并根据周围节点的密集程度构造不同大小的簇;簇内节点计算上行和下行节点构造数据融合树,采用时分复用调度算法进行多跳路由.NS2仿真结果表明该路由算法均衡了各个节点的能量消耗,延长了网络存活时间,并降低了网络延迟.     

Two-Level Linear Clustering Protocol Based on Wireless Sensor Networks

Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes.     

Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks

This paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes a principal vector projection approach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers an average‐cluster‐size‐based rule (ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.     

An unequal cluster-based routing scheme for multi-level heterogeneous wireless sensor networks

In wireless sensor networks (WSNs), clustering can significantly reduce energy dissipation of nodes, and also increase communication load of cluster heads. When multi-hop communication model is adopted in clustering, “energy hole” problem may occur due to unbalanced energy consumption among cluster heads. Recently, many multi-hop clustering protocols have been proposed to solve this problem. And the main way is using unequal clustering to control the size of clusters. However, many of these protocols are about homogeneous networks and few are about heterogeneous networks. In this paper, we present an unequal cluster-based routing scheme for WSNs with multi-level energy heterogeneity called UCR-H. The sensor field is partitioned into a number of equal-size rectangular units. We first calculate the number of clusters in each unit by balancing energy consumption among the cluster heads in different units. And then we find the optimal number of units by minimizing the total energy consumption of inter-cluster forwarding. Finally, the size of clusters in each unit is elaborately designed based on node’s energy level and the number of clusters in this unit. And a threshold is also designed to avoid excessive punishment to the nodes with higher energy level. Simulation results show that our scheme effectively mitigates the “energy hole” problem and achieves an obvious improvement on the network lifetime.