一种WSN中分簇路由算法的改进

在无线传感器网络中,基于分簇的路由协议对提高网络的寿命有着重要作用,LEACH是一种应用比较广泛的层次路由协议。本文提出一种新的基于最优分簇的无线传感器网络分簇路由（LEACH-O）算法,在簇的形成过程考虑到节点的集中程度和节点的剩余能量,从而减少传感器节点的能量消耗,优化资源利用率。仿真实表明,与传统的LEACH算法相比,该算法配传感器节点间数据传输提供了高效路由,从而延长网络的生命周期。     

基于剩余能量和睡眠控制的改进LEACH算法

无线传感器网络（WSN）路由协议研究的一个重要的目标是如何在有限的能源下降低整个网络的能耗,提高网络的生存时间。以分簇路由协议LEACH为研究基础,提出了一种改进算法。该算法改进了簇首选择规则,引入协调件协议算法,通过在成簇阶段降低剩余能量低的节点被选择成为簇首的概率,在稳定运行阶段使簇首节点尽可能多的保持睡眠状态,从而降低了网络能耗。仿真结果表明,与原LEACH算法相比,改进的算法能够明显地延长网络生存时间。     

有效降低无线网络节点能量的LEACH新算法

LEACH是一种低功耗自适应按簇分层路由算法.为了降低节点能耗,在LEACH协议的基础上提出了在选举簇头时,改变阈值T(n)的大小以降低节点成为簇头的概率,从而节省网络因分簇而消耗的能量.同时又提出了一种基于节点剩余能量的二层簇头的算法,该算法能使节点减少将冗余信息传输到基站,从而达到降低节点消耗能量的目的.通过实验仿真,表明这些方法能使网络节点能量的消耗减少,达到了延长网络生命周期的目的.     

大规模无线传感网中基于能耗均衡的按需QoS协议

为满足大规模无线传感器网络局部区域信息收集时的QoS需求,在保证网络连通性的条件下最大限度降低网络能耗与控制开销,本文提出一种基于能耗均衡的按需QoS协议OQBED.该协议采用近似静态分簇和按需信息收集策略减少控制开销,通过有效选择工作节点数目以及执行簇头轮换机制来保障能耗均衡,并在簇头间选取满足QoS条件的最优能源路由来实现数据融合与传送.仿真结果表明,OQBED协议能有效减小控制开销,显著延长网络生命期,大幅度提高信息传输成功率.     

大规模无线传感器网络分簇路由协议改进方案

本文对大规模无线传感器网络的路由协议进行了研究,提出一种全新的高能效分簇路由协议.根据节点数目以及分布区域大小,通过数学公式推导得出最优的簇首节点数目.对簇首进行改进,均衡网络的负载,减少节点的过早死亡,延长整个网络的寿命.离基站较远的簇首利用多跳来传输数据,减少远距离簇首的能量消耗,延长网络寿命,使网络规模不受限.使用Matlab软件进行仿真实验,实验结果表明新协议能够均衡网络节点能耗,延长网络生命时间,且能适用于大规模的网络.     

基于能量均衡的LEACH协议的研究

无线传感器网络节点能量有限,因此为了避免由于节点的能量不足而造成网络瘫痪,在组网过程中必须要充分考虑到节点能量的情况,Leach协议是其中一种典型的网络分簇路由协议。针对传统leach协议在分簇过程中未能考虑网络内节点能量以及簇首数量的基础上,提出一种新的簇首选取优化算法,旨在达到均衡网络能量、延长网络生命周期的结果。经OPNET仿真表明,该算法能快速选择簇首、节省节点能量以及均衡网络的能量分布,最后有效地延长网络的生命周期。     

基于分簇的无线传感器网络协议

本文针对目前无线传感器网络中传统MAC协议在动态性、低时延方面的不足,在前人研究的基础上,提出一种基于分簇的自适应AMAC协议.该协议将簇分为簇首节点和簇内成员节点,簇内成员节点可以根据自身的状态向簇首节点提出时隙申请,簇首节点对这些申请信息进行仲裁,从而及时调整时间帧的长度,使其能更符合当前网络的负载情况和拓扑结构....     

无线传感器网络中簇首选择算法研究

传统的低功耗自适应集簇分层型协议（LEACH）算法在选择簇首时未能考虑到节点剩余能量对网络寿命的影响,使得簇首分布不够合理。为了克服该问题,在完全分布式成簇算法（HEED）协议的基础上,设计了一种根据节点剩余能量选择簇首的算法。在该算法中,剩余能量越大的节点越有可能成为簇首,进而承担更多数据传输责任,能量消耗更加平均,增强了算法的健壮性。仿真结果证实,提出的算法可以有效提高网络能量的使用效率,减少功耗,延长网络生存时间。     

一种基于AODV路由协议的分簇算法研究

基于距离向量的按需路由协议AODV是AdHoc网络研究的热点之一。该协议有效减少了建立和维护路由所需要的开支,但是随着网络节点发送数据量的增加,网络性能会迅速下降。为了提高AdHoc网络的路由效率和可靠性,文章提出了一种基于AODV路由协议的分簇算法。经仿真研究分析表明,该算法提高了网络节点的平均每跳吞吐率,减少了节点的平均每跳时延。     

基于布隆过滤器的分簇式复制节点检测协议研究

针对传统的CBDM复制节点检测协议中簇头节点存储开销大,基站和基站附近节点通信开销大的问题,文章提出了一种基于布隆过滤器的分簇式复制节点检测协议。每一轮周期检测,簇头节点不再单纯地利用自身的存储空间来存储节点信息,而是通过携带存储空间利用率较高的布隆过滤器来储存信息,减轻了簇头节点的存储开销;与CBDM相比,该协议通过选择能量较高的簇头节点进行复制节点的判定、分析和广播,减轻了基站和基站附近的网络开销。仿真实验表明,该协议在保证网络复制节点检测率的情况下,提高了网络的生命周期。     

A Novel Energy Efficient and Lifetime Maximization Routing Protocol in Wireless Sensor Networks

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

Maximizing the lifetime of energy‐constrained cooperative spectrum sensing sensor network

Adding the cognitive capability to wireless sensor networks allows the sensors to monitor the spectrum and identify the spectrum holes to operate in different frequencies according to the radio environment which result in better spectrum utilization. Spectrum sensing is a main component in any cognitive radio network. In this paper, we propose a new cooperative sensing scheme based on energy detection for cognitive sensor networks which is constrained by the energy limitation of the wireless sensor elements. The proposed scheme minimizes the sensing energy for individual sensor and carefully selects the suitable participant sensors in each cooperative sensing process. This results in maximizing the lifetime of energy‐constrained wireless sensor networks. The proposed scheme also takes into consideration the constraints on the detection accuracy. The simulation results show that the proposed scheme prolonged the lifetime of the cognitive network, makes efficient usage of available spectrum by secondary users, and satisfy the target detection performance.     

A Tabu search based routing algorithm for wireless sensor networks

In this paper, a Tabu search based routing algorithm is proposed to efficiently determine an optimal path from a source to a destination in wireless sensor networks (WSNs). There have been several methods proposed for routing algorithms in wireless sensor networks. In this paper, the Tabu search method is exploited for routing in WSNs from a new point of view. In this algorithm (TSRA), a new move and neighborhood search method is designed to integrate energy consumption and hop counts into routing choice. The proposed algorithm is compared with some of the ant colony optimization based routing algorithms, such as traditional ant colony algorithm, ant colony optimization-based location-aware routing for wireless sensor networks, and energy and path aware ant colony algorithm for routing of wireless sensor networks, in term of routing cost, energy consumption and network lifetime. Simulation results, for various random generated networks, demonstrate that the TSRA, obtains more balanced transmission among the node, reduces the energy consumption and cost of the routing, and extends the network lifetime.     

一种基于无交集节点分组的无线传感器网络覆盖算法

无线传感器网络是一种无线自组织网络,它由大量能量有限的传感器节点组成.能量消耗和网络覆盖是无线传感器网络的两个核心问题,网络覆盖决定了无线传感器网络对物理世界的监测能力,能量消耗则决定了无线传感器网络的生存时间.本文研究了一种改进的基于无交集节点分组算法,针对随机选取节点实现无交集节点分组方式获得的分组个数少且节点通信...     

一种无线传感器网络全连通群的休眠调度算法

该文针对无线传感器网络的覆盖性和连通性问题,在假设传感器节点地理位置信息已知的条件下,设计了一种包含全连通群的建立和维护以及群内节点休眠调度的全新算法。该算法采用保证群内节点彼此一跳可达的全连通群分群方法,以及分布式节能的休眠调度策略,最大程度上减少传感器网络的能量消耗,延长了网络寿命。仿真结果表明:该算法能较好地保证无线传感器网络的覆盖性和连通性,且能耗较低。     

EARQ: Energy Aware Routing for Real-Time and Reliable Communication in Wireless Industrial Sensor Networks

Wireless industrial sensor networks are wireless sensor networks which have been adapted to industrial applications. Most techniques for wireless sensor networks can be applied to wireless industrial sensor networks. However, for industrial applications of wireless industrial sensor networks, new requirements such as real-time, reliable delivery need to be considered. In this paper, we propose EARQ, which is a novel routing protocol for wireless industrial sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In EARQ, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that EARQ is suitable for industrial applications, due to its capability for energy efficient, real-time, reliable communications.      

基于GAF的无线传感器网络MAC协议

节能是无线传感器网络介质访问控制(MAC)协议的首要目标,综合近年来MAC协议的研究成果,针对S-MAC、T-MAC等几种典型协议进行分析,研究出将拓扑结构控制机制引入MAC协议,可进一步降低能耗。给出了一种基于GAF拓扑控制思想的MAC协议、GS-MAC协议。GS-MAC协议可以降低处于空闲侦听状态的节点数量,是一种高效节能的协议。仿真表明,引入拓扑控制后可以达到进一步节约能耗的目的。     

链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

一种用于无线传感器网的协作接收方案

无线传感器网中,能量效率是系统设计首要考虑的因素.基于提高无线传感器网能量效率的目的,本文提出了一种简单的协作接收方案并分析了其能量效率,理论分析及仿真结果表明,当通信距离大于某一门限值时采用该接收方案可以有效提高无线传感器网的能量效率.