Aware Power Research Articles

Changing computing paradigms towards power efficiency.

Power awareness is fast becoming immensely important in computing, ranging from the traditional high-performance computing applications to the new generation of data centric workloads. In this work, we describe our efforts towards a power-efficient computing paradigm that combines low- and high-precision arithmetic. We showcase our ideas for the widely used kernel of solving systems of linear equations that finds numerous applications in scientific and engineering disciplines as well as in large-scale data analytics, statistics and machine learning. Towards this goal, we developed tools for the seamless power profiling of applications at a fine-grain level. In addition, we verify here previous work on post-FLOPS/W metrics and show that these can shed much more light in the power/energy profile of important applications.

Optimized ASIC/FPGA design flow for energy efficient network nodes

This paper describes the ENERSAVE research project, which is funded by the German ministry of research. The project target is a 30 percent power reduction for network nodes via introduction of a holistic, energy-aware design flow for application-specific integrated circuit (ASIC) and field programmable gate array (FPGA) design. Using today's state of the art design methods, advanced calculation of system power budgets is a major challenge since current methods do not offer sufficient means for supporting energy awareness and efficiency throughout the complete component design process. The ENERSAVE project is developing a methodology to support power awareness and provides the ability to target power constraints from the system level all the way down to the silicon. It introduces formal tools for power optimizations and demonstrates, on an optical transmission system card, how using this new design methodology enables the envisioned power target to be achieved. The paper presents methodology improvement results to date and offers a preview of expected demonstrable results by project completion in 2014.

Improving The Scalability by Contact Information Compression in Routing

The existence of reduced scalability and delivery leads to the development of scalable routing by contact information compression. The previous work dealt with the result of consistent analysis in the performance of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with decreases in the routing performance. This paper focuses on improving the scalability and delivery through contact information compression algorithm and also addresses the problem of power awareness routing to increase the lifetime of the overall network. Thus implementing the contact information compression (CIC) algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more improved during multipath multicasting, which delivers the information to a collection of target concurrently in a single transmission from the source

Flat and hierarchical epidemics in P2P systems: Energy cost models and analysis

In large scale distributed systems, epidemic or gossip-based communication mechanisms are preferred for their ease of deployment, simplicity, robustness against failures, load-balancing and limited resource usage. Although they have extensive applicability, there is no prior work on developing energy cost models for epidemic distributed mechanisms. In this study, we address power awareness features of two main groups of epidemics, namely flat and hierarchical. We propose a dominating-set based and power-aware hierarchical epidemic approach that eliminates a significant number of peers from gossiping. To the best of our knowledge, using a dominating set to build a hierarchy for epidemic communication and provide energy efficiency in P2P systems is a novel approach. We develop energy cost model formulations for flat and hierarchical epidemics. In contrast to the prior works, our study is the first one that proposes energy cost models for generic peers using epidemic communication, and examines the effect of protocol parameters to characterize energy consumption. As a case study protocol, we use our epidemic protocol ProFID for frequent items discovery in P2P systems. By means of extensive large scale simulations on PeerSim, we analyze the effect of protocol parameters on energy consumption, compare flat and hierarchical epidemic approaches for efficiency, scalability, and applicability as well as investigate their resilience under realistic churn.

Stochastically power‐minimum scheduling of real‐time multicore systems with leakage power awareness

The proposed scheduling scheme minimises the mean power consumption of real-time tasks with probabilistic computation amounts on multicore processors. To reduce leakage power consumption of idle cores, the scheme activates a part of available cores while turning off the power of unused cores, and determines the instant speed of activated cores so that the expected power consumption of real-time tasks would be minimised.

A New Approach of Secure Power Aware Routing for Mobile Ad-Hoc Network

In order to assist communication within a mobile Ad-Hoc network, a well-organized routing protocol is required to determine routes between mobile nodes. Power is one of the most important design criteria for Ad-Hoc networks as batteries provide inadequate working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment alongside making the node secure. Limited resource availability such as battery power and security are the major issues to be handled with mobile Ad-Hoc networks. By using Efficient secure routing protocol for mobile ad hoc networks that achieves secrecy of data message and secure the routing operation. The security schemes aims at preventing attacks by malicious node that intentionally disrupt the route discovery process. The protocol also assures a source node generates a route discovery request is able to identify and authenticate the route reply from destination. In mobile Ad-Hoc networks, an attacker can easily disrupt the functioning of the network by attacking the underlying routing protocol. Packets are secure during source to destination transmission by using Two Fish Encryption algorithm. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and PAR, by simulation it is observed that proposed algorithm’s performance is better as compare to AODV and PAR in terms of packet delivery ratio and network lifetime for different network scenarios.

Improved Power Aware Location Based Routing

With rapid growth in wireless Ad Hoc networks, Quality of service factor has drawn a great attention of researchers. Whereas network topology of wireless networks constantly changes, resources like bandwidth and energy are also limited. As power is very important factor for the proper working of Ad Hoc networks, need of the time is to research about efficient utilization of power. In the paper, we improve LAR (Location-Aided Routing), one of the most famous location based routing methods, which uses GPS technique to get information about the location of mobile node. Our new protocol considers both areas of routing and power. At first, propose a more efficient routing method which finds more stable paths .Secondly, a power aware method is proposed to have a prior knowledge about the remaining battery backups of all the intermediate nodes so that the nodes with battery backups equal to or greater than the minimum threshold power are the part of path between source and destination. This work presents an efficient approach for providing QOS in power aware scenario.

Performance Comparison on Trust Based Power Aware Reliable On Demand Routing Protocol in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a collection of mobile wireless nodes, which communicate to each other without any centralized administration. Trust and Power consumption is the most challenging task in routing protocol design for Mobile ad hoc networks (MANETs), since the highly dynamic nature of MANET coupled with limited bandwidth and battery power imposes severe restrictions on routing protocols especially on achieving the routing. Furthermore replacing and recharging batteries and making nodes co-operative are often impossible in significant environments. In this paper, we effort to study the performance of three on- demand routing protocols (AODV, DSR, DYMO) in terms of number of hop counts, number of routes selected, number of RREQ packets, number of RREP packets and power consumption in transmit, received and ideal modes. During route discovery, nodes are more trust to find reliable route for communication and utilizing maximum energy capacity for selection of route. Route based selection of nodes called 'Reliability'. Route request from the source is accepted by a node only if its reliability is high. Otherwise, the route request is discarded. This approach forms a reliable route from source to destination thus increasing network life time, improving power utilization and decreasing number of packet loss during transmission. To solve the above problem here we describe the three on demand routing and it is simulated using QualNet 5.0 simulator.

Improved Power Aware Location Based Routing

Improved Power Aware Location Based Routing

Power and Delay Aware Management of Packet Switches

Due to increasing circuit densities and data throughput rates, power consumption has become a significant concern in the design and operation of high-performance packet switches. We extend the idea of Dynamic Power Management (DPM) to input queued switches, allowing operators to tradeoff power and delay in a useful way. We frame the problem as a dynamic program and solve a relaxation using techniques from Linear Quadratic Regulation (LQR). This optimal policy is combined with existing, nonpower-aware switch controls to generate two novel scheduling algorithms: 1) LQR Power Aware Maximum Weight Matching (LQR PA MWM) and 2) LQR Power Aware Projective Cone Scheduling (LQR PA PCS). Simulation results suggest that our algorithms result in significant power savings compared to MWM and previous power control schemes with little performance degradation.

A Survey of Power Aware Routing Schemes for Mobile Ad Hoc Networks

power aware routing schemes for mobile ad hoc networks have been developed for increasing network life time by isolating low power nodes from the routing process. This paper presents a survey of some recently proposed power aware routing schemes based on certain characteristics such as multipath support, quality of service support, mobility support and reliability support. It has been learnt that the majority of the proposed power aware routing schemes are not suitable for real-time applications, as they don't support the establishment of multiple simultaneous paths, provision of guaranteed quality of service, and random node mobility. Reliability has also been an important concern in those schemes, which needs to be incorporated in order to find trust aware energy efficient paths.

Fuzzy Cost based Power Aware QoS Routing Protocol with Mobility Prediction in Mobile Ad Hoc Networks

Fuzzy Cost Based Power Aware QoS Routing (FCPAQR) protocol proposed to select an optimal path by considering multiple independent QoS metrics. Fuzzy inference rule which is used to calculate the QoS based fuzzy cost of each link to forward the data packets effectively and efficiently. Fuzzy cost is calculated based on various QoS Constraints. QoS constraints can be classified as Time Constraint (Delay and Jitter), Space Constraint (System Buffer), Frequency Constraint (System Bandwidth) Reliability Constraint (Error rate) [9]. Link Expiry Time(LET) and Energy Level are also additionally taken into account. Considering multiple QoS Constraints provide better result than taking single constraint into account. General Terms

Secured Power Aware Routing Protocol (SPARP) for Wireless Sensor Networks

Several wireless sensor network applications ought to decide the intrinsic variance between energy efficient communication and the requirement to attain preferred quality of service (QoS) such as packet delivery ratio, delay and to reduce the power consumption of wireless sensor nodes. Also the intended protocols that are developed aims in providing better QoS with compromising security aspect. In order to address this challenge, we propose the Secured Power Aware Routing Protocol (PARP), which attains application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions along with incorporating a novel cryptosystem. Through extensive simulation in NS2 the results prove that the proposed SPARP attains better QoS and reduced power consumption. Cryptool is used to test the novel proposed cryptosystem.

Mixed Integer Non-Linear Programming models for Green Network Design

The paper focuses on Network Power Management in telecommunication infrastructures. Specifically, the paper describes four energy aware network design problems, with the related mathematical models, for reducing the power consumption of the current and future Internet. Each problem is based on a different characterization and power awareness of the network devices, leading to either Mixed Integer Linear Programming or Mixed Integer Non-Linear Programming models. We have assessed the effectiveness of the proposed approaches under different real core network topology scenarios by evaluating the impact of several network parameters. To the best of our knowledge, this is the first work that deeply investigates the behavior of a pool of diverse Network Power Management approaches, including the first Mixed Integer Non-Linear Programming model for the Power Aware Network Design with Bundled Links.

Enhancing DSR maintenance with power awareness

A power-aware route maintenance protocol for Mobile Ad Hoc Networks (MANETs) is introduced. Termed Dynamic Path Switching (DPS), the new protocol puts an overloaded node to sleep before a route link breaks because that node runs out of energy, and brings other suitable nodes into play instead. When the battery charge of a node reaches a stated level, the node can advance a request to change to a sleep state for a while. The request is honoured unless survival of some path rests on the forwarding activity of that very node. All nodes are assumed to be collaborative. The DPS protocol is fully backward compatible, as it can be implemented within existing routing protocols such as Dynamic Source Routing (DSR). The new protocol has been extensively simulated with the established network simulator NS2. The findings indicate a much improved power awareness of the updated routing protocol with respect to the unadorned one. Power saving is particularly effective during long-lived sessions.

<I>A Special Issue on</I> Power, Parasitics, and Process-Variation (P3) Awareness in Mixed-Signal Design

<I>A Special Issue on</I> Power, Parasitics, and Process-Variation (P3) Awareness in Mixed-Signal Design

Enhance Location Based Power Aware Routing Protocol in Ad-Hoc Network

In wireless ad-hoc networks, there areseveral characteristics different with wired networks. Thedifferences are changing of network topology, limitedresources like bandwidth and energy and so on. In thesedays as the bandwidth issue becomes more important, it isrequired to research about the efficient resource allocationmethods optimized in wireless network ks. In the paper,we improve LAR (Location-Aided Routing) which is oneof the most famous location based routing methods. Thiskind of technique uses information about the location ofmobile node through GPS technique. Our new protocolconsiders both areas of routing and bandwidth. At first,propose a more efficient routing method which improvesthe quality of services .Secondly, a bandwidth awaremethod is proposed to select proper transmissionbandwidth node by using a threshold value of bandwidth

Secure Power Aware Routing to Support Real Time Traffic in Mobile Adhoc Networks

A mobile Ad hoc network (MANET) is a collection of wireless nodes that forms a network without central administration. The nodes in such kind of network serve as routers as well as hosts. The nodes can forward packets on behalf of other nodes and run user applications. These devices are operated on battery which provides limited working capacity to the mobile nodes. Power failure and the energy consumption of the nodes is a critical factor in the operation of a mobile ad hoc network. The performance of the node can be hampered by power failure, which affects the ability of node to forward the packet and hence affects the

Power Aware Routing Protocol (PARP) for Wireless Sensor Networks

Several wireless sensor network applications ought to decide the intrinsic variance between energy efficient communication and the requirement to attain preferred quality of service (QoS) such as packet delivery ratio, delay and to reduce the power consumption of wireless sensor nodes. In order to address this challenge, we propose the Power Aware Routing Protocol (PARP), which attains application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions. Extensive simulation results prove that the proposed PARP attains better QoS and reduced power consumption.

Power Aware QoS Multipath Routing Protocol for Disaster Recovery Networks

Mobile communication plays an important role in disaster recovery management during emergency situations. It is helpful in situations where the system has less robust and less flexible fixed infrastructure. The Disaster recovery management systems require timely interaction and coordination in order to save lives and property. Energy consumption in heterogeneous network is a major issue , whether they operate within a base station infrastructure , fixed network or in a free-standing Mobile Ad Hoc Network (MANET). The lifetime of network will be improved by suitably reducing the requirement of power for connections. There is a challenge to provide Quality of Service (QoS) solutions to wired cum wireless domains and maintain end-to-end QoS in ad hoc network. In this paper we propose a new protocol Power Aware QoS Multipath Routing protocol (PAQMR) for disaster recovery network. This protocol is the enhanced protocol of Ad-Hoc On Demand Multipath Distance Vector protocol (AOMDV). This routing protocol is used to avoid the loop formation in network so that it reduces congestion in the channel. The Network Simulator (NS-2.34) tool is utilized to measure the performance of AODV, AOMDV and PAQMR protocols in hybrid environment. The metrics for the simulation are energy consumption, average end to end delay and packet delivery ratio by varying the traffic load and pause time in the network. The results shows that the proposed protocol minimize the power, delay, congestion and maximize the packet delivery ratio.