Power-aware Routing Algorithm Research Articles

Power aware routing algorithms (PARA) in wireless mesh networks for emergency management.

Wireless Mesh Networks (WMNs) integrate the advantages of WLANs and mobile Ad Hoc networks, which have become the key techniques of next-generation wireless networks in the context of emergency recovery. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. These capabilities make WMNs a promising technology for incident and emergency communication. An incident area network (IAN) needs a reliable and lively routing path during disaster recovery and emergency response operations when infrastructure-based communications and power resources have been destroyed and no routes are available. Power aware routing plays a significant role in WMNs, in order to provide continuous efficient emergency services. The existing power aware routing algorithms used in wireless networks cannot fully fit the characteristics of WMNs, to be used for emergency recovery. This paper proposes a power aware routing algorithm (PARA) for WMNs, which selects optimal paths to send packets, mainly based on the power level of next node along the path. This algorithm was implemented and tested in a proven simulator. The analytic results show that the proposed power node-type aware routing algorithm metric can clearly improve the network performance by reducing the network overheads and maintaining a high delivery ratio with low latency.

Achieving Energy Efficiency in Data Centers Using an Artificial Intelligence Abstraction Model

Today’s data center networks are usually over-provisioned for peak workloads. This leads to a great waste of energy since in practice traffic rarely ever hits peak capacity resulting in the links being under-utilized most of the time. Furthermore, the traditional non-traffic-aware routing mechanisms worsen the situation. From the perspective of resource allocation and routing, this paper aims to implement a green data center network and save as much energy as possible. With the benefit of blocking island paradigm, we present a general framework trying to maximize the network power conservation and minimize sacrifices of network performance and reliability. The bandwidth allocation mechanism together with power-aware routing algorithm achieve a bandwidth guaranteed green tighter network. Moreover, our fast efficient heuristics for allocating bandwidth enable the system to scale to large sized data centers. The evaluation result shows that achieving up to more than 50 percent power savings are feasible while guaranteeing network performance and reliability.

RRect: A Novel Server-Centric Data Center Network with High Power Efficiency and Availability

In this paper, we propose a novel server-centric network for data centers, called RRect. Compared to existing server-centric networks, RRect provides a more graceful degradation performance in the presence of component failure. Meanwhile, RRect enjoys a linear diameter to the network order and multiple parallel paths. We present algorithms to find paths and to construct all parallel paths between any pair of servers in RRect. We also show that without using any power-aware routing algorithm, RRect behaves more power efficient in its interconnection network. To meet today's stringent high availability requirement, RRect can be configured into redundancy and failover scheme. In particular, RRect can be configured into both symmetric and asymmetric redundancy modes to cater different applications’ needs, which cannot be implemented in existing server-centric networks. Moreover, RRect gives more flexibility to adjust the network size. Given the same switches, by fine tuning the parameters, RRect provides numerous structures with different sizes, while preserving the properties of short diameter and multiple parallel paths. Our comprehensive simulations show that RRect gives much better graceful degradation performance in the presence of component failure, and RRect saves much energy in the interconnection network. Meanwhile, RRect can maintain the same performance on many critical metrics as BCube, including short diameter and excellent aggregate throughput. All these features make RRect a very empirical structure for enterprise dater center network products.

Achieving energy efficiency in data centers with a performance-guaranteed power aware routing

Nowadays, data centers are designed to offer the highest performance in case of high traffic load and peak utilisation of the network. However, in a realistic data center environment, the peak capacity of the network is rarely reached and the average utilisation of devices varies between 5% and 25% which results into a huge loss of energy since most of the time links and servers are idle or under-utilized. The high impact of this wasted power on environmental effects, energy needs and electricity costs raised the concerns to seek for an efficient solution to make data centers more power effective while keeping the desired quality of service. In this paper, we propose a power-aware routing algorithm that saves a considerable amount of energy with a negligible trade-off on the performance of the network and a guaranteed reliability of the system. The key idea is to keep active only the vital and critical nodes participating in the communication traffic and ensuring the reliability while the unneeded devices are turned-off. Vital nodes between clusters (parts of the network) are calculated only once during the initialization of the system and consequently used with a constant time complexity. Besides its short computation time, our routing algorithm guarantees over 50% of energy saving by maintaining the minimum number of needed devices and over 20% when adding backup routes. This power efficiency is accompanied by a guaranteed performance and reliability against failures.

PTNet: An efficient and green data center network

In recent years, data centers have witnessed an exponential growth for hosting hundreds of thousands of servers as well as to accommodating a very large demand for resources. To fulfill the required level of demand, some approaches tackled network aspects so to host a huge number of servers while others focused on delivering rapid services to the clients by minimizing the path length between any two servers. In general, network devices are often designed to achieve 1:1 oversubscription. Alternatively, in a realistic data center environment, the average utilization of a network could vary between 5% and 25%, and thus the energy consumed by idle devices is wasted. This paper proposes a new parameterizable data center topology, called PTNet. PTNet offers a gradual scalability that interconnects small to large networks covering different ranges of sizes. This new interconnection network provides also a small path length between any two servers even in large sized data centers. PTNet does not only reduce path length and latency, it also uses a power-aware routing algorithm which saves up to 40% of energy with an acceptable computation time. In comparison to existing solutions (e.g. Flatnet, BCube, DCell and Fat-tree), PTNet shows substantial improvements in terms of capacity, robustness, cost-effectiveness and power efficiency: this improvement reaches up to 50% in some cases.

PALS: Saving Network Power With Low Overhead to ISPs and Applications

Power saving in the network infrastructure has received great attention in recent years. Power-aware traffic management is proposed in many works, in which a subset of routers/links are preferentially used to carry traffic while other links are activated only when traffic load is high. However, it remains challenging how to minimize the overhead to both ISPs and applications, which is important to the successful deployment of power-aware traffic management in a real network. This paper presents PALS, a new Power-Aware Link State routing based traffic management protocol. Compared with previous solutions, PALS remarkably reduces the overheads to ISPs and applications by the following innovations. First, PALS minimizes the forwarding table expansion due to dynamic power-aware routing, by using destination based routing instead of pairwise routing (e.g., MPLS). Second, PALS limits packet reordering for applications, by never splitting traffic between an IE (ingress-egress) router pair to multiple paths. Third, PALS significantly reduces the computation complexity of the power-aware routing algorithm, by running a simple path selection algorithm at each ingress router with the knowledge of local traffic information as well as global link utilization, which are much easier to obtain than global traffic matrix required by the state-of-the-art solutions (e.g., Zhang , IEEE ICNP 2010). Extensive simulations and testbed experiments show that, although bearing the simplicities to minimize the overhead, PALS saves satisfactory network power, with quick response to traffic variance and negligible impact on the packet delivery performance for applications.

An Efficient Position based Power Aware Routing Algorithm in Mobile Ad-hoc Networks

An Efficient Position based Power Aware Routing Algorithm in Mobile Ad-hoc Networks

Implementing a new power aware routing algorithm based on existing dynamic source routing protocol for mobile ad hoc networks

Energy consumption is a crucial design concern in mobile ad hoc networks (MANETs), since nodes are powered by batteries with limited energy, whereas in existing dynamic source routing (DSR) does not take the energy limitation of MANET nodes into account. In this study, the authors propose an efficient algorithm for MANETs, which maximises the network lifetime by minimising the power consumption while establishing path with the help of modified DSR. The proposed work minimises the energy consumption per packet and maximises the network lifetime. The design objective of modifying DSR is to select energy-efficient paths. The main features of modified DSR are: (i) minimise energy consumed per packet (ii) maximise network lifetime for network and (iii) minimise maximum node cost. However, some intermediate nodes might act selfish and drop the packets for other nodes in order to save their own battery power. The proposed algorithm can find selfish nodes and deal with them by using a modified DSR protocol, which we call as an efficient DSR (EDSR). The simulation results show an increase in the packet delivery ratio in the network. The average node lifetime of proposed EDSR model is 45–60% longer than that of DSR model.

A Mutual Algorithm for Optimizing Distributed Source Coding in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are composed of small wireless nodes equipped with sensors, a processor, and a radio communication unit, all normally powered by batteries. For most WSN applications, the network is expected to function for several months or years. In the common monitoring application scenario, adjacent nodes in a WSN often sense spatially correlated data. Suppressing this correlation can significantly improve the lifetime of the network. The maximum possible network data compression can be achieved using distributed source coding (DSC) techniques when nodes encode at Slepian-Wolf rates. This paper presents contributions to the lifetime optimization problem of WSNs in the form of two algorithms: the Updated-CMAX (UCMAX) power-aware routing algorithm to optimize the routing tree and the Rate Optimization (RO) algorithm to optimize the encoding rates of the nodes. The two algorithms combined offer a solution that maximizes the lifetime of a WSN measuring spatially correlated data. Simulations show that our proposed approach may significantly extend the lifetime of multihop WSNs with nodes that are observing correlated data.

Power savings versus network performance in dynamically provisioned WDM networks

The role of the ICT sector in our daily life is causing a significant growth of the power consumed by the network equipment. In this context, transparent WDM networks represent a promising solution for reducing the power consumption of telecom networks. For this reason transparent WDM networks attract a lot of interest and several power-aware routing and wavelength assignment algorithms are available in the literature. These approaches, however, seem to consider power minimization as the only parameter to be optimized. Little or no attention is given to other important network aspects, e.g., connection requests blocking. Such approaches may not always be advisable, especially in core WDM networks where high performance levels must be considered in the first place. This article aims at providing a different insight to the PA-routing problem. It follows the intuition that in some cases relaxing the power minimization constraint can have beneficial effects on the overall network performance, especially on the blocking probability. A novel approach, referred to as Weighted Power-Aware Lightpath Routing (WPA-LR), is proposed and evaluated using two continental core networks. Our results confirm the presence of a trade-off between power savings and blocking probability.

Efficient power aware routing algorithm for mobile ad hoc networks

AbstractIf the battery of a node is drained out, then it cannot be communicated with other nodes and the number of dead‐nodes makes the network partition. In order to overcome this problem, we propose a new routing algorithm for mobile ad hoc networks. It uses the residual battery capacity, transmission power, and hop‐count to route the data packet. Here the proposed model has simulated with the help of 100 mobile nodes using the network simulator and has tested under various conditions. It compares with the ad hoc on‐demand distance vector protocol, minimum total transmission power, and min–max battery cost routing models. The proposed model has shown better results in terms of node lifetime and network lifetime. The mobile nodes start to die at 400, 420, 440, 470, and 508 s for AODV, MTPR, MMBCR, CMMBCR, and proposed models, respectively. If the system has 145 J, then the AODV model transmits 38 000 of data packets, whereas the MTPR, MMBCR, CMMBCR, and proposed models will transmit 37 600, 47 240, 41 580, 42 700, and 42 955 of data packets, respectively. Copyright © 2009 John Wiley & Sons, Ltd.

Energy Efficient, Power Aware Routing Algorithm for Sensor Network

Energy Efficient, Power Aware Routing Algorithm for Sensor Network

Network connectivity based power-aware routing algorithm for Mobile Ad Hoc Networks

Mobile Ad Hoc Network (MANET) is a decentralised network, which consists of mobile nodes. In this paper, we propose an efficient routing algorithm for the MANETs. Here, we use two metrics namely minimum total transmission power and network connectivity over the network. The proposed work has been simulated using .Net and has compared with the existing algorithms such as DSR, Minimum Total Transmission Power Routing (MTPR) and Min-Max Battery Cost Routing (MMBCR). The simulation results have proved that the proposed model has reached at top position in terms of the number of nodes with zero-remaining energy and throughput. If the mobility of the node is 25 m/s, then the proposed model, MTPR model, MMBCR model and AODV model have transmitted 68%, 50%, 59% and 62% of the data packets, respectively. At 700 s, the number of nodes with zero-remaining energy in the proposed model is 5, whereas in the AODV model, MTPR model and MMBCR model the number of nodes with zero-remaining energy was 39, 22 and 7, respectively.

A Transmission Range Optimization Algorithm to Avoid Energy Holes in Wireless Sensor Networks

The many-to-one communication nature of wireless sensor networks (WSNs) leads to an unbalanced traffic distribution, and, accordingly, sensor nodes closer to the base station have to transmit more packets than those at the periphery of the network. This problem causes the nodes closer to the base station to deplete their energy prematurely, forming a hole surrounding the base station. This phenomenon is called the energy hole problem, and it severely reduces the network lifetime. In this paper, we present a cooperative power-aware routing algorithm for uniformly deployed WSNs. The proposed algorithm is based on the idea of replacing the constant transmission range of relaying sensor nodes with an adjusted transmission range, in such a way that each individual node consumes its energy smoothly. We formulate the dynamic transmission range adjustment optimization (DTA) problem as a 0-1 Multiple Choice Knapsack Problem (0-1 MCKP) and present a dynamic programming method to solve the optimization problem. Simulations confirm that the proposed method helps to balance the energy consumption of sensor nodes, avoiding the energy hole problem and extending the network lifetime.

An efficient online‐battery aware geographic routing algorithm for wireless sensor networks

AbstractWireless sensor networks (WSNs) are being used in a wide variety of critical applications such as military and health‐care applications. Such networks, which are composed of sensor nodes with limited memory capacity, limited processing capabilities, and most importantly limited energy supply, require routing protocols that take into consideration these constraints. The aim of this paper is to provide an efficient power aware routing algorithm for WSNs that guarantees QOS and at the same time minimizes energy consumption by calculating the remaining battery capacity of nodes and taking advantage of the battery recovery process. We present an online‐battery aware geographic routing algorithm. To show the effectiveness of our approach, we simulated our algorithm in ns2 and compared it with greedy perimeter stateless routing for wireless networks and battery‐aware routing for streaming data transmissions in WSNs. Copyright © 2009 John Wiley & Sons, Ltd.

Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks

Due to the limited lifetime of the nodes in ad hoc network, energy efficiency needs to be an important design consideration in any routing algorithm for ad hoc and sensor networks. In most of the existing position-based routing algorithms the nodes use the maximum transmission power to discover neighbors, which may cause excessive power consumption. This paper presents several localized power-aware 3D position-based routing algorithms that increase the lifetime of a network by maximizing the average lifetime of its nodes. New algorithms are semi-beaconless, using for neighbor discovery an optimal transmission range (OR) for control packets, and, if needed, maximal transmission range (MR) during routing process, and using adjusted transmission radius for message transmission. PAGR algorithm selects neighbor closest to destination among those within OR if any exists providing progress, or otherwise among those within MR. If greedy progress is not possible, PAGR: CFace(1) variant resorts to face routing on projected network in coordinate plane until recovery is possible, at which point PAGR algorithm resumes. We evaluate our algorithms and compare their power savings with the current power-aware routing algorithms. The simulation results show a significant improvement in the overall network lifetime.

Timer-based broadcasting for power-aware routing in power-controlled wireless ad hoc networks

We propose a new cross-layer design method for minimizing the total consumed power in power-controlled wireless ad hoc networks. In contrast to previous research, we consider not only a power-aware routing algorithm, but also a MAC layer algorithm that is adequate to optimize its performance. Computer simulations show that the proposed scheme outperforms the conventional schemes with respect to the average total consumed power, while maintaining a similar average success rate. Moreover, the proposed scheme approximates the optimal solution calculated by CPLEX, and is scalable, since each node operates in a distributed manner.

Power-aware localized routing in wireless networks

A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d/sup /spl alpha// dependence for /spl alpha/ /spl ges/ 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis, of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.