Energy-aware Routing Strategy Research Articles

KEFSAR: A Solar-Aware Routing Strategy For Rechargeable IoT Based On High-Accuracy Prediction

Abstract The high energy density of solar energy gives wireless sensor networks advantages in outdoor monitoring applications. However, long-term stable monitoring is challenging due to frequent weather changes, shading by buildings and trees, etc. The existing research usually uses two technologies to solve the above problems: (1) the energy prediction algorithm, and (2) the energy-aware routing strategy. However, in an actual deployment, frequent weather changes can significantly reduce the accuracy of the existing prediction algorithms. When using the algorithms as the support for energy-aware routing, the network lifetime is less than ideal. The existing routing strategies are in need of further improvement. Because of its lack of environmental adaptability, nodes consume energy quickly and have a high mortality rate. Therefore, aiming at the long-term stability of solar wireless sensor networks, this paper proposes a prediction algorithm based on classification and recurrent neural networks, and integrates the shadow judgement method from our previous research to correct the predicted values. Furthermore, we propose a routing optimization model that can flexibly adjust the target according to the solar intensity. The experimental results show that the prediction and routing scheduling algorithm can significantly improve the energy prediction accuracy (30–50%) and prolong the network lifetime (10–42%) in outdoor small sensor scenarios.

Multicast Energy Aware Routing in Wireless Networks

Multicasting is a service for disseminating data to a group of hostsand it is of paramount importance in applications with a close collabo-ration of network hosts. Due to limited energy available in the wirelessdevices, energy management is one of the most important problems inwireless networks. Energy aware routing strategies help us to mini-mize the energy costs for communication as much as possible and toincrease the network lifetime. In this paper, we address the problemof energy efficient routing to increase the lifetime of the network. Wepresent three new strategies for online multicast energy aware routingin wireless networks to increase the network lifetime.

Adaptive Power-Control Based Energy-Efficient Routing in Wireless Sensor Networks

Efficient utilization of energy is a hot topic of research in the field of wireless sensor networks. Limited battery resource at a sensor node coupled with the hostile multi-path fading propagation environment makes the task of the network to provide reliable data services with an enhanced lifetime, challenging. In order to achieve this goal, a number of efforts have been made by the researchers; one such key strategy is an energy-aware routing embedded with transmission power control mechanism. In this strategy, every sensor node in a network transmits at a lowest possible power level to maintain on one hand reliable wireless links with other neighboring nodes and saves the energy on the other. In this paper, we propose a novel routing technique embedded with transmission power control for wireless sensor networks while considering a realistic radio fading environment. The proposed strategy considers channel fading in the propagation environment and mitigate it through transmission power control mechanism. The main aim of the proposed protocol, APCEER, is to reduce the communication interference among sensor nodes, establish energy-efficient routes from source to sink and thus, to save energy of each and every sensor node in the network. This results in an overall increase of network lifetime, transmission throughput, energy saving and reduce communication interference and collision. Simulation and experimental results show that the proposed scheme outperforms the existing energy-aware routing strategies that are not equipped with a power control mechanism. The proposed protocol thus utilizes in urban applications of wireless sensor networks that need ultra efficient utilization of energy by power-constrained nodes operating in severe fading conditions.

Joint flow routing-scheduling for energy efficient software defined data center networks: A prototype of energy-aware network management platform

Data centers are a cost-effective infrastructure for hosting Cloud and Grid applications, but they do incur tremendous energy cost and CO2 emissions. Today׳s data center network architectures such as Fat-tree and BCube are over-provisioned to guarantee large network capacity and meet peak performance requirement. Networks suffer from inefficient power usage when data center traffic is not high. A solution to this problem is the adoption of network management platform such as OpenNaaS, which can be augmented with energy-aware capabilities. We developed a component for energy monitoring and routing in OpenNaaS. Energy-aware OpenNaaS can support different types of OpenFlow controller; it inherits and enhances network management capabilities, e.g. dynamically obtaining power and topology.In this paper we also discuss the evaluation and selection of energy-aware routing strategies based on an initial prototype of energy-aware OpenNaaS. The target strategies are fine-grained as they combine flow routing algorithms that make routing decisions for the flows and flow scheduling algorithms that schedule the flows on the same link. Differently from previous routing work which focuses on power-minimization problem in data center networks, we aim to optimize energy consumption. Our simulation shows that the combination of priority-based shortest routing and exclusive flow scheduling achieves about 5%–35% higher energy efficiency without performance degradation.

Performance Analysis of AODV on the Basis of Network Survivability over MANET using NS2

In Mobile Ad-Hoc Networks (MANETs), mobile devices are equipped with power (energy). In order to utilize this energy equipped devices efficiently for transmission of data packets, many energy aware routing strategies are followed. Effective transmission power control is a critical issue in the design and performance of wireless ad hoc networks. Transmission Power affects the Survivability of the Network. Today, the design of packet radios and protocols for wireless ad hoc networks are primarily based on common-range transmission control. Mobility speed of the nodes and extension of ad hoc network affects the performance as well. In this paper, one of the widely used routing protocol AODV with varying transmission range, mobility speed and number of nodes is analyzed. Data transmitted by a node is received by all the nodes within its communication range. This paper focuses on the analysis of varying the range of the transmission in terms of distance, mobility speed and number of nodes in the network. The proposed work has been simulated using NS2.34.The performance metrics comprises of Network Survivability has been analyzed in this paper.

Energy-aware routing in wireless sensor networks: a complex networks based approach

Wireless Sensor Networks WSNs have practical application in various fields. Routing in WSNs focuses on reduction of energy consumption and extension of the network lifetime owing to the limited energy, storage space and computing ability. In recent years, complex network-based approaches, which attempt to exploit the structure of WSNs to make better routing decision, are becoming increasingly popular. Since data transmission in WSNs follows a multi-hop pattern, the selection of the best forwarding sensor node is very important in routing. In order to let all sensor nodes take part in routing as evenly as possible and extend the network lifetime of WSNs, an energy-aware routing strategy is proposed with the aid of complex network theory. The proposed routing algorithm introduces node degree deviation as an indicator of high-or low-degree nodes, and adopts a combination of the distance and consumed energy as the forwarding criterion. By shifting traffic from high-degree to low-degree nodes, the proposed routing algorithm extends the network lifetime and balances the energy consumption between the two node types. Simulation results show that the proposed algorithm dramatically extends the network lifetime and balances the network energy consumption compared with local betweenness centrality-based energy-aware routing algorithm and the shortest path routing algorithm.

Energy-aware routing in wireless sensor networks: a complex networks based approach

Wireless Sensor Networks (WSNs) have practical application in various fields. Routing in WSNs focuses on reduction of energy consumption and extension of the network lifetime owing to the limited energy, storage space and computing ability. In recent years, complex network-based approaches, which attempt to exploit the structure of WSNs to make better routing decision, are becoming increasingly popular. Since data transmission in WSNs follows a multi-hop pattern, the selection of the best forwarding sensor node is very important in routing. In order to let all sensor nodes take part in routing as evenly as possible and extend the network lifetime of WSNs, an energy-aware routing strategy is proposed with the aid of complex network theory. The proposed routing algorithm introduces node degree deviation as an indicator of high- or low-degree nodes, and adopts a combination of the distance and consumed energy as the forwarding criterion. By shifting traffic from high-degree to low-degree nodes, the proposed routing algorithm extends the network lifetime and balances the energy consumption between the two node types. Simulation results show that the proposed algorithm dramatically extends the network lifetime and balances the network energy consumption compared with local betweenness centrality-based energy-aware routing algorithm and the shortest path routing algorithm.

Maximise lifetime of wireless sensor networks via a distributed cooperative routing algorithm

ABSTRACTCombining cooperative diversity, truncated automatic repeat request scheme and distributed energy‐aware routing strategy, a novel cooperative routing algorithm adopting decode‐and‐forward fashion is proposed to maximise the lifetime of wireless sensor networks from the cross‐layer design perspective. In this algorithm, the transmission power is optimally allocated while satisfying the per‐link symbol error rate or the end‐to‐end throughput requirement. The average total consumed power weighted by the normalised remaining energy of every participating node is used as the link cost to avoid the overuse of certain nodes with extremely little energy. With the use of the traditional distributed shortest path algorithm, the best route that includes a cascade of single‐relay building blocks is constructed with polynomial complexity. In contrast to the non‐cooperative routing schemes, this cooperative routing algorithm can significantly prolong the network lifetime and improve the energy efficiency by reducing the total network residual energy. Copyright © 2012 John Wiley & Sons, Ltd.

A wireless sensor network for precision agriculture and its performance

ABSTRACTThe use of wireless sensor networks is essential for implementation of information and control technologies in precision agriculture. We present our design of network stack for such an application where sensor nodes periodically collect data from fixed locations in a field. Our design of the physical layer consists of multiple power modes in both the receive and transmit operations for the purpose of achieving energy savings. In addition, we design our MAC layer to use these multiple power modes to improve the energy efficiency of wake‐up synchronization phase. Our MAC protocol also organizes all the sender nodes to be synchronized with the receiver simultaneously and transmit their data in a time scheduled manner. Next, we design our energy aware routing strategy that balances the energy consumption over the nodes in the entire field and minimizes the number of wake‐up synchronization overheads by scheduling the nodes for transmission in accordance with the structure of the routing tree. We develop analytical models and simulation studies to compare the energy consumption of our MAC protocol with that of the popular S‐MAC protocol for a typical network topology used in our application under our routing strategy. Our MAC protocol is shown to have better energy efficiency as well as latency in a periodic data collection application. We also show the improvements resulting from the use of our routing strategy, in simulations, compared with the case when the next hop is chosen randomly from the set of neighbors that are closer to the sink node. Copyright © 2011 John Wiley & Sons, Ltd.

Online energy aware routing in wireless networks

Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flows. To maximize network lifetime, the paths for message flows are chosen in such a way that the total energy consumed along the path is minimized while avoiding energy depleted nodes. Finding paths which consume minimum energy and finding paths which do not use energy depleted nodes lead to conflicting objectives. In this paper, we propose two-phased energy aware routing strategies that balance these two conflicting objectives by transforming the routing problem into a multi-metric widest path problem. We find that the proposed approaches outperform the best-known algorithms in the literature. We also demonstrate a simple but insightful relationship between the total energy required along a path and the minimum remaining energy of a node along the path. We further exploit this relationship to show that staying within the solution space of paths with high residual energy and low total energy provides much improved lifetimes in general.