Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.

BEAR: A Balanced Energy-Aware Routing Protocol for Wireless Sensor Networks

Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.

An Energy-Aware Routing Protocol Based on Effective Transmission in Sensor Networks

In order to minimize the energy consumption in the discovery of the routing path, this paper introduces a novel concept of effective transmission （ET） that ensures each forwarding node is not only farther from the source node, but also nearer to the destination node with respect to its sender, An energ-aware routing protocol based on ET is proposed. It enables the energy consumption for each hop to be the least for the transmission. The simulation results show the routing protocol is effective in the performance of energy consumption comparing with some other routing protocols.

FEAR: Fuzzy-Based Energy Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are used in different civilian, military, and industrial applications. Recently, many routing protocols have been proposed attempting to find suitable routes to transmit data. In this paper we propose a Fuzzy Energy Aware tree-based Routing (FEAR) protocol that aims to enhance existing tree-based routing protocols and prolong the network’s life time by considering sensors’ limited energy. The design and implementation of the new protocol is based on cross-layer structure where information from different layers are utilized to achieve the best power saving. Each node maintains a list of its neighbors in order to use neighbors’links in addition to the parent-child links. The protocol is tested and compared with other tree-based protocols and the simulation results show that FEAR protocol is more energy-efficient than comparable protocols. According to the results FEAR protocol saves up to 70.5% in the number of generated control messages and up to 55.08% in the consumed power.

Energy Aware Routing Protocol for Cognitive Radio Networks

In this article, a routing protocol EARP (Energy Aware Routing Protocol) with the terminal node is proposed, to deal with the impact of the limited energy resources of Cognitive Radio Networks on the whole network routing. The protocol allows choosing the route from the neighbor nodes in different transmission paths, according to energy consumption of a single node and the full path. If the path breaks, the protocol will increase local routing maintenance strategy. It effectively reduces the retransmission caused by the situation, and improves the routing efficiency. It also can prevent the link transmission process selecting the fault route due to the energy depletion. Through simulation experiments compared with the LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, the results showed that in the same experimental environment, the proposed EARP could obviously balance the load, protect low energy nodes, prolong the network survival time and reduce packet loss rate and packet delay of data delivery. So it can improve the energy consumption of sensing node and provide routing capabilities.

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

An Energy-Aware Clustering Approach for Wireless Sensor Networks

Energy conservation is an essential and critical requirement for a wireless sensor network with battery oper-ated nodes intended for long term operations. Prior work has described different approaches to routing protocol designs that achieve energy efficiency in a wireless sensor network. Several of these works involve variations of mote-to-mote routing (flat routing) while some make use of leader nodes in clusters to perform routing (hierarchical routing). A key question then arises as to how the performance of an energy-aware, flat routing protocol compare with that of one based on hierarchical routing. This paper demonstrates a hierarchical routing protocol design that can conserve significant energy in its setup phase as well as during its steady state data dissemination phase. This paper describes the design of this protocol and evaluates its performance against existing energy-aware flat routing protocols. Simulation results show that it exhibits competitive performance against the flat routing protocols.

无线传感器网络中时效性优化的GEAR路由协议

在无线传感器网络中,数据路由是各种应用的基础,基于能量感知的地理路由协议(GEAR)虽然可以在一定程度上均衡节点间的能量负载,但不适用于节点初始能量不同的异构网络,而且其折线效应会显著增加数据路由的延时。文章提出一种改进型GEAR路由协议,基于节点的剩余能量进行路由选择,同时对代价函数引入自适应调整策略,从而使协议同时适用于同构和异构网络,消除折线效应,提高数据路由的时效性,仿真结果证明了协议的有效性。

信任评价的低能耗安全GEAR路由协议的研究

针对GEAR路由协议所面临的安全威胁和节点能量有限的不足,利用信任评价机制和数据融合技术对其进行改进,提出了一种新的协议T-GEAR(Trust-GEAR,T-GEAR)。该协议通过为节点增加信任度参数,使节点在选择下一跳节点时考虑了其信任值,降低了下一跳节点是攻击节点的可能性。此外,该协议还对目标区域内的信息传递进行了数据融合,在一定程度上降低了网络的能耗。实验仿真结果表明,与GEAR协议相比,T-GEAR协议延长了网络的生命周期,具有较高的包传输率和较低的丢包率,提高了网络的安全性。

地理位置路由协议GEAR的分析与改进

以WSN位置路由协议GEAR为改进对象,针对该协议在数据传输过程中存在的路由空洞及能量浪费问题,提出了一种新的位置路由协议——GEAR+。通过使节点拥有相邻两跳或更多跳节点的位置信息来降低路由空洞产生的概率,以及在对节点采集的数据进行必要的数据融合的同时,适当地改变节点的状态来避免无谓的能量消耗。利用NS2进行仿真,结果表明改进后的算法具有更好的性能。

求解路由空洞问题的GEAR改进算法

针对无线传感网络中地理位置路由(GEAR)算法产生的路由空洞,GEAR算法通过改变自身和邻居节点的代价来解决该问题,但同一节点可能会再次遇到同一路由空洞。该文提出一种改进算法,通过解决节点自身的代价问题,避免了上述情况。在ns2上的仿真结果表明,改进后的GEAR算法在平均能量消耗和节点发送数据分组的数量上都优于GEAR算法。

无线传感器网络GEAR算法的改进

针对无线传感器网络中地理位置路由(GEAR)算法在转发查询消息和解决路由空洞问题存在局限性,提出了一种改进的方案。改进的GEAR算法从均衡网络流量出发,根据规则建立了从源节点到目标区域的多条路径,并且避免了同一节点重复面临同一路由空洞问题。用NS2对GEAR算法和改进后的算法进行仿真,结果表明,改进的算法能够较好的平衡网络负载,增加网络生命周期。

无线Ad Hoc网络能量感知地理路由协议研究进展

无线Ad Hoc网络(以下简称为Ad Hoc网络)能量感知地理路由协议深度影响网络性能,具有降低网络能量消耗、延长网络寿命等功效,受到越来越多的关注.系统阐述了Ad Hoc网络能量感知地理路由协议的研究进展.首先介绍了Ad Hoc网络地理路由,进而详细概述了能量感知地理路由协议形成的背景、度量指标、节点选择规则、研究意义及分类;然后,详细介绍了典型能量感知地理路由协议,并从多角度对其进行了归纳总结与比较;最后,阐述了能量感知地理路由协议研究存在的问题,指出了未来需要研究的内容,并在此基础上进行总结.

无线网络中基于编码感知的能量优化路由算法

由电池供应电量的无线通信网络中,数据需要通过作为路由的中间节点进行传输,所以这些中间节点的能量消耗对整个网络的生存有很大的影响。本文从延长网络生存时间的目的出发,提出了一种能量优化的编码感知路由协议COER(Coding-aware based Optimal Energy Routing),利用能量门限值以及相对剩余能量来均衡网络节点能量的消耗,同时用网络编码来减少能量的消耗,并将两者统一来实现网络能量的优化。仿真结果表明:COER能够减少传输能耗,均衡网络能量消耗,延长网络生存时间。

一种基于前向感知因子的WSN能量均衡路由方法

无线传感网络由于受能量和通信能力的限制,为了保证感知数据的有效送达,路由方法(协议)的设计显得尤为关键.本文提出了一种基于前向感知因子的能量均衡路由协议FAF-EBRP,它通过感知链路权重和前向区域内的能量密度来决定下一跳节点,并设计了相应的局部拓扑自发重构机制.通过实验对FAF-EBRP和LEACH、EEUC两个典型路由方法(协议)进行了比较,结果表明,FAF-EBRP能使无线传感网络表现出更好的能量均衡性和更长的有效工作时间.

一种节能的无线传感器网络路由算法的研究

针对已有的无线传感器网络(WSN)路由算法在具体的实际应用中存在的问题,提出了适合实际应用的路由算法的目标,并设计了一种能量敏感的路由算法,以节省能量消耗从而达到延长整个网络生命周期的目的。该算法在已有的分簇算法基础上加入休眠机制,使未承担传输数据的节点进入休眠状态,从而达到节能目的。在GAINZ节点组网环境中实现了基于该路由算法的原型系统,并对该算法的性能和效率进行了测试。研究结果表明,在实际应用过程中该算法能有效地提高网络的生命周期。

无线传感器网络能量多路径路由研究

研究了无线传感器分层网络模型及能量多路径路由机制.为解决现有协议的缺陷,提出了改进型能量多路径路由协议(IMP-EA),建立了路由算法.以网络寿命和丢包率作为评价指标,对改进型能量多路径路由协议和其它3种路由协议进行了仿真实验.仿真结果表明,改进后的协议有效地延长了网络的生存时间,提高了数据转发效率.*

基于能量感知的无线传感器网络层次型路由协议

为了有效平衡负载,满足大规模网络的需要,提出了一种基于能量感知的无线传感器网络层次型路由协议。该协议基于能量消耗模型,根据节点与基站的距离将网络中的节点划分为不同的层次。每层次内的节点轮流当选负责收集该层内所有节点数据的汇聚节点。汇聚节点的数据逐层转发和聚合,最后传送到剩余能量较大的一个汇聚节点——超节点,由其将数据发送到基站。汇聚节点变迁、超节点变迁机制用于均衡节点能量消耗,延长网络生命周期。NS2仿真结果表明,该协议可以有效节省能量,延长网络生存时间。

基于能量有效的逆向AODV路由协议研究

为了解决AODV协议在能耗性能上的不足,提高协议能量有效性,实现协议在多种网络环境中传输有效性与能量有效性的灵活折中,提出了一种改进的基于能量有效性的路由协议(energy-aware reverse AODV,ERAODV)。ER-AODV协议采用基于逆向AODV并结合最小功率以及能量均衡的设计方案,提出了一种改进的链路代价函数用来选择最佳传输路径。仿真结果表明,当代价函数中加权系数固定时,ER-AODV协议较AODV协议在能量有效性方面有着显著提高;当代价函数采用动态可调整的加权系数时,ER-AODV协议可以实现多种网络环境中传输有效性与能量有效性的灵活折中。