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

无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期.     

一种基于能量和区域密度的LEACH算法的改进

本文在LEACH算法的基础上,引入节点剩余能量、节点到汇聚节点的距离和区域内节点密度等因素.利用网络最小能量来求解出最佳的簇首节点个数,动态设置每个节点的选举阈值.仿真实验表明,本文改进算法相较于LEACH算法和其它改进算法可以有效地降低网络能耗,延长网络生命周期,提高汇聚节点接收数据包量.     

基于扇形分簇的无线传感器网络路由算法

无线传感网络中低功耗自适应聚类分簇(LEACH)路由算法等概率选取簇首节点,容易导致整个网络节点能量损耗出现极端化,减少网络生存时间。为此,提出一种针对簇首节点选取和分簇的改进LEACH算法。该算法把整个网络区域分为四个扇形区域,在每个区域内独立进行分簇路由;然后基站根据节点剩余能量和与基站的距离进行簇首节点选择,节点根据簇首节点和基站接收信号强度选择路由方式,以均衡网络能量消耗。仿真结果表明,改进LEACH算法的网络寿命是原有LEACH算法的150%,数据吞吐量提升了3倍。     

基于剩余能量与最小邻近簇半径的成簇算法

针对LEACH算法在选举簇首时没有考虑节点的剩余能量,并且簇首的分布不均匀,簇内节点与簇首采取单跳通信,从而影响网络生命期的问题,提出了利用剩余能量和最小邻近簇半径调整节点成为簇首的概率,并在簇内对部分节点采取多跳通信的成簇算法.仿真结果表明,该算法有效延长了网络生命期,均衡了簇首的分布,并且改善了簇内的结构.     

基于能量和密度的WSNs动态分区成簇路由算法

针对传统的层次型网络存在的分簇不合理和能耗不均衡等问题,提出了一种基于能量和密度的动态非均匀分区成簇路由算法。该算法先根据节点与基站之间的距离将网络合理地进行动态的区域划分,在区域内成簇,使靠近基站的簇规模小于距离基站较远的簇,减少靠近基站的簇首负担和能量消耗;通过综合考虑节点剩余能量和节点密度等因素来优化簇的非均匀划分和簇首的选择,簇首间采取基于数据聚合的多跳传输机制。仿真结果表明,与经典路由算法LEACH相比,该算法能有效均衡节点能耗,延长网络生命周期。     

一种新的无线可充电传感器网络分簇算法

为了弥补现有无线可充电传感器网络充电效率低下和节点能量冗余并存的问题,提出了一种基于节点信息的分簇算法。首先,根据传感器节点的剩余能量状态,选择候选簇首。其次,计算候选簇首集合中节点之间的距离,并与基于节点密度的距离阈值比较,最终筛选出合适的簇首。其他节点根据就近原则选择簇首,形成对应的簇。该算法由于同时考虑节点剩余能量和簇首之间的距离,可以使得具有较多剩余能量的节点成为簇首,且簇首均匀分布整个网络中。仿真结果表明,提出的算法可以提高充电效率,减少节点的能量冗余或节点能量消耗过快而死亡的现象,从而有效延长整个网络的寿命。     

基于半固定分区的无线传感器网络分簇算法

经典分簇路由算法在每轮的数据采集过程中均需要重新选举簇头和簇的划分,使得网络的拓扑结构极不稳定以及增加了不必要的网络开销,因此提出了一种基于半固定分区的无线传感器网络分簇算法.该算法在首轮,对传感器网路进行簇头的随机选举和簇的划分且其它轮不再重新分簇,然后在各个簇内依据节点的剩余能量和到汇聚节点的距离进行簇头的选举.实验结果表明,与传统分簇协议中的全网广播簇头选举机制相比,该算法不仅拥有稳定的簇结构,而且网络工作稳定期延长了约69.62%,有效地提高了无线传感器网络的可靠性.     

一种基于剩余能量的LEACH算法改进

分析了LEACH(Low-EnergyAdaptiveClusteringHierarchy)路由协议,提出了一种改进算法。该算法在LEACH协议的基础上,同时考虑到节点剩余能量与初始能量的比值,对簇首的选举概率加以改进,修正了原协议的簇首选举概率公式。在改进公式中选择不同的调节参数,分别进行了模拟仿真试验。结果表明,改进后的算法降低了整个网络能量消耗,延长了网络的生存周期。     

一种传感器网络跨层能量优先成簇算法

文中提出CLEEC跨层能量优先成簇算法,基于节点剩余能量来选举簇头节点,使网络能量均匀消耗,延长网络的生存时间.模拟实验结果显示,与现有的典型成簇方案相比,新的成簇算法在传感器网络下提供了更长的网络生存时间和更大的网络吞吐量.     

基于抽样估计的能量异构无线传感器网络分簇算法

提出一种基于抽样估计的能量异构无线传感器网络分簇算法.采取对网络中节点抽样的办法估计出网络中的平均剩余能量,节点根据剩余能量与网络平均能量的比例来进行簇首竞争,使簇首选择更加合理.仿真实验表明:该算法可以更好地实现负载均衡,延长的网络生存时间.     

无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

基于双簇头非均匀分簇的LEACH协议的改进

在无线传感器网络中的LEACH协议是一种自适应聚类路由算法．由于LEACH协议存在着无法控制簇首在网络中的分布位置、簇首选择方式限制条件不够等缺点导致能量消耗太大．基于簇头能量限制和双簇头路由方式,对LEACH协议进行了改进,设计了一种降低能耗的双簇头非均匀分簇路由协议．双簇头非均匀分簇路由协议采用NS2进行网络仿真实验,通过仿真结果的分析以及与LEACH协议的对比,证明双簇头非均匀分簇路由协议有效提高了网络能耗的均衡性．     

一种无线传感器网络异构分簇模型的簇头调度方案

将无线传感器网络划分成簇会有效利用系统资源,近来提出的基于异构分簇模型的无线传感器网络,是指网络中存在多种不同能力的节点,能力强的节点自动成为簇头,这种网络避免了复杂的簇头选举过程并有效降低了普通节点的硬件复杂性和成本。但是,固定簇头的方法会削弱系统的负载均衡以及健壮性。为了解决这个问题,提出了一种基于自适应退避策略的簇头调度方案,该方案通过适当增加冗余度实现传感节点的k覆盖,增强了网络的健壮性。同时,依赖于地理信息和剩余电池能量信息,簇头节点通过自主周期性睡眠来保证系统负载的均衡分配,延长网络生存期。     

认知无线电网络自适应能量驱动双门限簇头轮换算法研究

 为了延长基于分簇结构的认知无线电网络的网络寿命,需要采用簇头轮换的方法来平衡认知无线电网络的能耗.通过分析网络中簇头节点与普通节点之间的能耗差异,建立能量消耗模型,并提出了一种基于簇头节点实时负载来估计其启动簇头轮换的双门限自适应簇头轮换算法(Double Thresholds Adaptive Cluster Rotation Algorithm,DTACRA).仿真结果表明,与现有算法LEACH和EDAC算法等比较,DTACRA算法可以有效提高节点能量利用效率,延长了网络生存时间.     

Achieving Energy Conservation by Cluster Based Data Aggregation in Wireless Sensor Networks

In Wireless Sensor Networks (WSN), one of the major issues is to maximize the network lifetime. Since all sensor nodes directly send the data to the Base station, the energy requirement is very high. This reduces the lifetime of the network. One of the solutions is to partition the network into various clusters which avoids direct communication. In this paper we propose an Energy efficient Cluster Based Data Aggregation (ECBDA) scheme for sensor networks. In this algorithm, Cluster members send the data only to its corresponding local cluster head, there by communication overhead is reduced. Data generated from neighboring sensors are often redundant and highly correlated. So the cluster head performs data aggregation to reduce the redundant packet transmission. In our approach, clusters are formed in a non-periodic manner to avoid unnecessary setup message transmissions. Re-clustering is performed only when CH needs to balance the load among the nodes. The simulation results show that our approach effectively reduces the energy consumption and hence the network lifetime is also increased.     

基于多级能量阈值的簇头更新策略

簇路由是节省无线传感网络(WSNs)能量的有效策略。簇头的选择是簇路由的关键。然而,传统的簇路由是采用固定周期更新簇头,并没有考虑到簇头的剩余能量。为此,针对稳定簇头选择协议(SEP)进行改进,提出基于多级能量阈值的簇头更新策略,记为I-SEP。I-SEP路由考虑三类节点,这三类节点的初始能量不同。并针对三类节点的能量以及比例,计算它们成为簇头的概率和阈值。同时,每轮计算簇头的剩余能量,只有簇头剩余能量小于预定的阈值,才进行簇头更新,否则原来的簇头仍作为簇头,进而减少了更换簇头所带来的能耗。仿真结果表明,相比于SEP,提出的I-SEP路由有效地降低了能耗,延长了网络寿命。     

Multi‐hop medium access control protocol for low energy critical infrastructure monitoring networks using wake‐up radio

The IEEE 802.15.4K Task Group was formed recently to address the low energy critical infrastructure monitoring networks. The aim is to collect scheduled and event data from a large number of non‐mains powered endpoints that are widely dispersed. The application requirements include reliable data transfer, energy efficiency, and long deployment lifetime. To meet the low energy critical infrastructure monitoring network requirements, we propose a multihop medium access control protocol where the scheduled or event data are routed to the coordinator through the cluster heads. The power consumption of the cluster heads is critical as they use more power than the normal endpoints. Our protocol uses the wake‐up radio approach from cluster head to cluster head communication and an efficient guaranteed time slots allocation scheme to minimize the power consumption of the cluster heads. We derive analytical expressions for the average power consumption of cluster heads as well as ordinary endpoints. The results show that our proposed protocol outperforms the IEEE 802.15.4 MAC and SCP MAC in terms of power consumption. High power efficiency is achieved in both the cluster heads and normal endpoints. Copyright © 2012 John Wiley & Sons, Ltd.     

基于移动Agent和WSN的突发事件场景数据收集算法研究

该文针对无线传感器网络应用于突发事件监测场景的能量消耗和网络延迟问题,提出了基于移动Agent的无线传感器网络簇式数据收集算法.动态成簇过程基于事件严重程度,并由其决定簇的生命周期和覆盖范围.Sink和簇头之间形成以Sink节点为簇头的虚拟簇.移动Agent迁移路径规划过程中下一跳节点的选取基于节点剩余能量、路径损耗及受刺激强度.移动Agent通过节点遍历的方式完成对所有簇内成员节点信息的收集.仿真结果表明,相对于C/S数据收集模型,基于移动Agent的模型具有更好的节能效果,并能一定程度地减少网络延迟,尤其适用于大规模无线传感器网络应用.     

Squirrel Search Optimization-Based Cluster Head Selection Technique for Prolonging Lifetime in WSN’s

The rapid advancement of technologies of wireless sensor network is gaining maximized attentioned across the scientific community due to its reliable coverage in real life applications. It has evolved as an indispensable technology with diverisifed capabilities as it facilitates potential information to the end users regarding a region of target under real time monitoring process. However, the characteristics of WSNs such as resource-constrained nature and infrastructure-less deployment has the possibility of introducing diversified problems that influences the network performance. Moreover, the process of handling the issues of suitable cluster head selection, energy stability and network lifetime improvement are still considered as herculean task of concern. In this paper, a Squirrel Search Optimization-based Cluster Head Selection Technique (SSO-CHST) is proposed for prolonging the lifetime in the sensor networks by utilizing a gliding factor that aids in the better determination of cluster head selection during the process of data aggregation and dissemination. It estimates the fitness value of sensor nodes and arranges them in ascending order, such that the node with least fitness value is identified as the cluster memner. On the other hand, the sensor nodes with high fitness value is confirmed as the potential cluster head. The simulation results of the proposed SSO-CHST with minimum number of rounds used for selecting cluster head confirmed better throughput of 13.48% and improved network lifetime of 17.92% with minimized energy consumptions of 15.29%, remarkable to the benchmarked schemes.

     

Joint Routing and Resource Allocation for Cluster Based Isolated Nodes in Cognitive Radio Wireless Sensor Networks

Clustering is an effective way to increase network lifetime but it leads to formation of isolated nodes in the wireless sensor network. These isolated sensor nodes forward data directly to sink and consume more energy which significantly reduces the network lifetime. In this article, we present how to maximize the network lifetime through joint routing and resource allocation with isolated nodes technique (JR-IN) between cluster head and isolated nodes in a cognitive based wireless sensor networks. In JR-IN technique the network area is divided into different layers and cluster size is formulated in each layer such that the size of the cluster remains unequal when it moves towards sink. Hence the cluster size is lager in the outermost layer compared to the cluster size in the inner most layer. To avoid inter cluster collision, we proposed different fixed channel to all the cluster heads in the network. For the intra cluster communication, the cluster member (sensor nodes) will lease the spectrum from the cluster head and forward data to their respective cluster head using TDMA technique. The periodical data gathering of cluster heads and forwarding the data to one hop cluster head may tend to lose energy faster and dies out quickly. We also propose in the JR-IN technique, the isolated nodes in the layer will take charge as a cluster head node and utilizes the resource allocated to the respective cluster head and forward the data to next hop cluster head. Simulation result shows that JR-IN outperforms the existing techniques, maximizes network lifetime and throughput and reduces the end to end delay.