Energy Aware Routing Protocol Research Articles

Energy-Efficient and Fast Data Gathering Protocols for Indoor Wireless Sensor Networks

Wireless Sensor Networks have become an important technology with numerous potential applications for the interaction of computers and the physical environment in civilian and military areas. In the routing protocols that are specifically designed for the applications used by sensor networks, the limited available power of the sensor nodes has been taken into consideration in order to extend the lifetime of the networks. In this paper, two protocols based on LEACH and called R-EERP and S-EERP with base and threshold values are presented. R-EERP and S-EERP are two efficient energy aware routing protocols that can be used for some critical applications such as detecting dangerous gases (methane, ammonium, carbon monoxide, etc.) in an indoor environment. In R-EERP, sensor nodes are deployed randomly in a field similar to LEACH. In S-EERP, nodes are deployed sequentially in the rooms of the flats of a multi-story building. In both protocols, nodes forming clusters do not change during a cluster change time, only the cluster heads change. Furthermore, an XOR operation is performed on the collected data in order to prevent the sending of the same data sensed by the nodes close to each other. Simulation results show that our proposed protocols are more energy-efficient than the conventional LEACH protocol.

An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks

Primitive routing protocols for ad-hoc networks are “power hungry” and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous drainage of energy degrades battery performance as well. If a battery is allowed to intermittently remain in an idle state, it recovers some of its lost charge due to the charge recovery effect, which, in turn, results in prolonged battery life. In this paper, we use the ideas of naturally occurring ants’ foraging behavior (Dorigo and Stuetzle, 2004) [1] and based on those ideas, we design an energy-aware routing protocol, which not only incorporates the effect of power consumption in routing a packet, but also exploits the multi-path transmission properties of ant swarms and, hence, increases the battery life of a node. The efficiency of the protocol with respect to some of the existing ones has been established through simulations. It has been observed that the energy consumed in the network, the energy per packet in the case of EAAR are 60% less compared to MMBCR and the packets lost is only around 12% of what we have in AODV, in mobility scenarios.

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.

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.

GRAdient Cost Establishment (GRACE) for an Energy-Aware Routing in Wireless Sensor Networks

In Wireless Sensor Network (WSN), the nodes have limitations in terms of energy-constraint, unreliable links, and frequent topology change. In this paper we propose an energy-aware routing protocol, that outperforms the existing ones with an enhanced network lifetime and more reliable data delivery. Major issues in the design of a routing strategy in wireless sensor networks are to make efficient use of energy and to increase reliability in data delivery. The proposed approach reduces both energy consumption and communication-bandwidth requirements and prolongs the lifetime of the wireless sensor network. Using both analysis and extensive simulations, we show that the proposed dynamic routing helps achieve the desired system performance under dynamically changing network conditions. The proposed algorithm is compared with one of the best existing routing algorithms, GRAB. Moreover, a modification in GRAB is proposed which not only improves its performance but also prolongs its lifetime.

An Energy-Aware Routing Protocol in Wireless Sensor Networks

The most important issue that must be solved in designing a data gathering algorithm for wireless sensor networks (WSNS) is how to save sensor node energy while meeting the needs of applications/users. In this paper, we propose a novel energy-aware routing protocol (EAP) for a long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all the nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely, intra-cluster coverage to cope with the area coverage problem. We use a simple temperature sensing application to evaluate the performance of EAP and results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.

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.

Ant-Based Reliable Multi-Constrained Anycast Routing for Sensor Networks

Wireless sensor networks (WSNs) are task-specific where the tasks are specified by the users or applications. Energy and delay constraints have had a great impact on the design and operation of the WSNs. As routing plays an important role in data-centric WSNs, there are numerous energy aware routing protocols proposed for WSNs with single sink, generally using multi-hop paths to use the energy more efficiently. But most of them do not consider the communication delay carefully. As many applications of WSNs require real-time communication, the end-to-end delivery delay is another point to be considered, especially for urgent events. When considering the multiple QoS constraints such as the delivery delay and the minimal energy required, the multi-constrained routing is NP-hard. Moreover, WSNs also suffer from a scalability problem as the total number of nodes can reach hundreds or thousands. Thus, sensors located near the sink consume large amounts of energy. The sink is then isolated once they deplete their batteries, and the network fails to function. To cope with the scalability problem, multi-sink configuration is adopted for large-scale WSNs. How to select the optimum sink for packets with different delay and energy constraints in large-scale WSNs is the main problem to be resolved in this paper, which is called the multi-constrained anycast (MCA) problem. Obviously, it is NP-hard. We investigate the MCA problem in resource-constrained WSNs with multiple sinks and two-tier architecture, where the source cluster-heads send collected data to only one optimum sink. To reduce the energy consumption and shorten the delivery delay, a distributed anycast algorithm ARMCA inspired by swarm intelligence of ants is proposed, which can also achieve reliable data gathering during the deployment period. The scheme takes advantage of beneficial clustering and routing emerging in a self-organized way from the positive interaction of ants. The idea of the ACO-based routing is adopted to achieve the good performance of energy-efficiency and delivery delay. Meanwhile, the ant-based clustering is utilized to ensure the reliability. By the combination of the ant-based routing and clustering models, the ARMCA protocol can solve the MCA problem efficiently and flexibly. The simulation results demonstrated that the proposed algorithm can reliably deliver collected events to the optimum sinks efficiently, and has self-recovery capabilities to deal with failures of sensors including the sinks. Not only is the energy cost reduced, but also the delivery delay is shortened significantly when transmitting packets of the named events to the sinks.

Voice transmission over ad hoc network adapting optimum approaches to maximize the performance

Although a lot of research and implementations have been performed for voice transmission over regular network and internet, a little is done for mobile ad hoc network (MANET). Like other computer networks, in MANET voice transmission is also very much demanding and necessary. Since the wireless links in an ad hoc network are highly error prone and may go down frequently because of node mobility, interference, channel fading, and the lack of infrastructure, it is very difficult and challenging to implement voice transmission over MANET. In this research, to maximize the performance of MANET during voice transmission we choose some parameters and methodological approaches e.g. Method of media access, selection of audio codec, selection of routing protocol etc in efficient and optimum way. Since voice applications consume more energy than typical applications, we use an energy aware routing protocol known as WEAC for the study. During the selection process of routing protocol we have a performance comparison study between Improved DSR and WEAC, where WEAC performs better consuming less energy in case of larger network. We also have a comparative study among several audio codecs (G.711, G.729 and G.723.1) where by simulation we show that the G.729 codec is more suitable to use for voice transmission over MANET in terms of latency. Finally, we show that it is possible to launch voice transmission with acceptable quality and throughput over MANET using G.729 and WEAC protocol.

Energy-aware and quality of service-based routing in wireless sensor networks and vehicular ad hoc networks

Wireless Sensor Networks (WSNs) have increasingly been used for remote monitoring tasks. Limited capabilities of sensor nodes in terms of communication, computation, and storage, present challenges to protocols designed for WSNs. Due to the severe energy constraint of sensor nodes, among the major concerns is the problem of designing efficient energy-aware routing protocols. Numerous routing protocols have been proposed in the literature. Cluster-based routing protocols for large-scale WSNs have some advantages as compared to a flat network topology. Clustering results in a reduced number of messages that propagate through the network in order to accomplish a sensing task. It also offers improved power control. Quality of Service (QoS) is becoming an important feature of data routing in WSNs. QoS is required for real-time data transmission when the result of a sensing task is dependent not only on the correct sensing of the environment but also on the timely delivery of the event notification to the monitoring center, the Sink. The emergency preparedness and response class of applications, for instance, impose delay requirements on the delivery of event notification messages. Transmitting video and imaging data poses certain bandwidth, delay, and jitter requirements on the routing protocols. Vehicular Ad Hoc Networks (VANETs) are envisioned to improve intervehicle coordination and become a part of intelligent transport systems with an ultimate goal of increasing safety on the roads and improving travel comfort. VANETs may include WSNs that are placed along the sides of roads and provide monitoring of road conditions. Routing protocols for VANETs also aim at satisfying end-to-end QoS requirements. This paper first discusses energy-efficient clustering routing protocols for WSNs, followed by approaches aimed at satisfying QoS in WSNs and VANETS. Lastly, a discussion and comparison of features of the selected routing protocols and QoS-based approaches is presented.

Reliable energy-efficient routing with novel route update in wireless sensor networks

In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the received signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the waypoints. One distinct advantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two waypoint nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simultaneous packet forwarding.

An Energy Aware Multi-Path Routing Algorithm for Mobile Ad Hoc Networks

Due to the new technology development, mobile ad hoc networks are becoming very important. The nodes that make up the mobile ad hoc network are battery powered. The problem of conserving energy at nodes is very important and a challenging one. In this article we present an Energy Aware Multi-path Dynamic Source Routing protocol (EAMPDSR). This protocol is based on the existing on-demand Dynamic Source Routing protocol (DSR). It is energy aware and uses a multi-path technique. EA-MPDSR reduces the energy consumed per received data bytes as well as prolongs the network lifetime, which leads to improvement in the performance of the network. The simulation results show the EA-MPDSR protocol performs better than conventional DSR and maximum of minimum energy DSR (MME-DSR) protocols.

Lifetime Prediction Routing Protocol for Wireless Sensor Networks

We propose LPDD (Lifetime Prediction Directed Diffusion), a novel energy-aware routing protocol for sensor networks that aims at increasing network survivability without a significant increase in latency. The key concept behind the protocol is the adaptive selection of routes by predicting the battery lifetime of the minimum energy nodes along the routes.

Energy-Aware Data Aggregation for Grid-Based Wireless Sensor Networks with a Mobile Sink

Wireless sensor networks (WSNs) are made up of many small and highly sensitive nodes that have the ability to react quickly. In WSNs, sink mobility brings new challenges to large-scale sensor networks. Almost all of the energy-aware routing protocols that have been proposed for WSNs aim at optimizing network performance while relaying data to a stationary gateway (sink). However, through such contemporary protocols, mobility of the sink can make established routes unstable and non-optimal. The use of mobile sinks introduces a trade-off between the need for frequent rerouting to ensure optimal network operation and the desire to minimize the overhead of topology management. In this paper, in order to reduce energy consumption and minimize the overhead of rerouting frequency, we propose an energy-aware data aggregation scheme (EADA) for grid-based wireless sensor networks with a mobile sink. In the proposed scheme, each sensor node with location information and limited energy is considered. Our approach utilizes location information and selects a special gateway in each area of a grid responsible for forwarding messages. We restrict the flooding region to decrease the overhead for route decision by utilizing local information. We conducted simulations to show that the proposed routing scheme outperforms the coordination-based data dissemination scheme (CODE) (Xuan, H. L., & Lee, S. Proceedings of the Sensor Networks and Information Processing Conference, pp. 13---18, 2004).

An unequal cluster-based routing protocol in wireless sensor networks

Clustering provides an effective method for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spot problem in multihop sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavier relay traffic and tend to die much faster, leaving areas of the network uncovered and causing network partitions. To mitigate the hot spot problem, we propose an Unequal Cluster-based Routing (UCR) protocol. It groups the nodes into clusters of unequal sizes. Cluster heads closer to the base station have smaller cluster sizes than those farther from the base station, thus they can preserve some energy for the inter-cluster data forwarding. A greedy geographic and energy-aware routing protocol is designed for the inter-cluster communication, which considers the tradeoff between the energy cost of relay paths and the residual energy of relay nodes. Simulation results show that UCR mitigates the hot spot problem and achieves an obvious improvement on the network lifetime.

On-Demand Utility-Based Power Control Routing for Energy-Aware Optimization in Mobile Ad Hoc Networks

In this paper, we propose a novel on-demand energy-aware routing protocol, UBPCR [utility-based power control routing], which reduces the trade-offs that arise in the other energy-aware route selection mechanisms that have recently been proposed for mobile ad hoc networks. Our approach is based on an economic framework that represents the degree of link's satisfaction (utility). With UBPCR, the utility function for any transmitter-receiver pair is defined as a measure of the link's preference regarding the signal-to-interference-and-noise ratio (SINR), the transmit power, and the transmitter's residual battery capacity. During a route-searching process, each intermediate node between the source and the destination is executed via two consecutive phases: the scheduling phase and the transmit power control phase. The scheduling algorithm finds the proper qualified data slot for the receiving channel so that the transmissions of independent transmitters can be coordinated. The transmit power control determines the optimal power, if one exists, that maximizes the corresponding link's utility. Extensive simulations show that the UBPCR protocol can achieve incompatible goals simultaneously and fairly.

FloodNet: Coupling Adaptive Sampling with Energy Aware Routing in a Flood Warning System

We describe the design of FloodNet, a flood warning system, which uses a grid-based flood predictor model developed by environmental experts to make flood predictions based on readings of water level collected by a set of sensor nodes. To optimize battery consumption, the reporting frequency of sensor nodes is required to be adaptive to local conditions as well as the flood predictor model. We therefore propose an energy aware routing protocol which allows sensor nodes to consume energy according to this need. This system is notable both for the adaptive sampling regime and the methodology adopted in the design of the adaptive behavior, which involved development of simulation tools and very close collaboration with environmental experts.

Energy Efficient AODV Routing in CDMA Ad Hoc Networks Using Beamforming

We propose an energy aware on-demand routing protocol for CDMA mobile ad hoc networks, for which improvements in the energy consumption are realized by both introducing an energy-based routing measure and by enhancing the physical layer performance using beamforming. Exploiting the cross-layer interactions between the network and the physical layer leads to a significant improvement in the energy efficiency compared with the traditional AODV protocol, and provides an alternative solution of link breakage detection in traditional AODV protocol. Several performance measures are considered for evaluating the network performance, such as data energy consumption, latency, and overhead energy consumption. An optimum SIR threshold range is determined experimentally for various implementation scenarios.

Energy-aware on-demand routing protocols for wireless ad hoc networks

Energy use is a crucial design concern in wireless ad hoc networks since wireless terminals are typically battery-operated. The design objectives of energy-aware routing are two folds: Selecting en...

An energ-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 energy-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.