• Title/Summary/Keyword: energy-aware design

Search Result 61, Processing Time 0.038 seconds

DVFS Algorithm Exploiting Correlation in Runtime Distribution

  • Kim, Jung-Soo;Yoo, Sung-Joo;Kyung, Chong-Min
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.9 no.2
    • /
    • pp.80-84
    • /
    • 2009
  • Dynamic voltage and frequency scaling (DVFS) is an effective method to achieve low power design. In our work, we present an analytical DVFS method which judiciously exploits correlation information in runtime distribution while satisfying deadline constraints. The proposed method overcomes the previous distribution-aware DVFS method [2] which has pessimistic assumption on which runtime distributions are independent. Experimental results show the correlation-aware DVFS offers 13.3% energy reduction compared to existing distribution-aware DVFS [2].

Adaptive Streaming System for Improving Energy Efficiency over IEEE 802.11e U-APSD (IEEE 802.11e U-APSD 환경에서 에너지 효율 향상을 위한 적응적인 스트리밍 시스템)

  • Lee, Sung-Hee;Chung, Kwang-Sue
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1066-1070
    • /
    • 2010
  • In wireless network, energy efficiency is an important design consideration for continuous multimedia streaming service. This paper proposes a new streaming system, called BACASS (Buffer-Aware and Content-Aware Streaming System) that working on the 802.11e U-APSD (Unscheduled Automatic Power Save). The BACASS leads the DP (Doze Period) of U-APSD for improving energy efficiency by utilizing the PSNR based on content-aware and client buffer occupancy that is hinged on a network-aware streaming system using SVC. The simulation results demonstrate the effectiveness of the proposed streaming system.

An Energy Efficient Data Delivery Scheme based on Cross-Layer Design in Wireless Sensor Networks (무선 센서네트워크에서 교차계층 설계 기반의 에너지 효율적인 데이터 전송 기법)

  • Shin, Jong-Whoi;Kim, Jae-Hyun;Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.177-184
    • /
    • 2008
  • The design goal of protocols in wireless sensor networks (WSN) is mainly energy efficiency because of their stringent resource and energy constraints. In this paper, we propose a simple cross-layered protocol for WSNs, so called EATD(Energy-Aware Tree based Delivery scheme). EATD is a tree-based energy aware data delivery algorithm by using a SYNC packet with link and node cost to maximize the network lifetime. Our simulation results show significant improvements compared with existing schemes in terms of energy efficiency and delay.

  • PDF

Energy Aware Task Scheduling for a Distributed MANET Computing Environment

  • Kim, Jaeseop;Kim, Jong-Kook
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.987-992
    • /
    • 2016
  • This study introduces an example environment where wireless devices are mobile, devices use dynamic voltage scaling, devices and tasks are heterogeneous, tasks have deadline, and the computation and communication power is dynamically changed for energy saving. For this type of environment, the efficient system-level energy management and resource management for task completion can be an essential part of the operation and design of such systems. Therefore, the resources are assigned to tasks and the tasks may be scheduled to maximize a goal which is to minimize energy usage while trying to complete as many tasks as possible by their deadlines. This paper also introduces mobility of nodes and variable transmission power for communication which complicates the resource management/task scheduling problem further.

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

Energy-Aware Virtual Data Center Embedding

  • Ma, Xiao;Zhang, Zhongbao;Su, Sen
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.460-477
    • /
    • 2020
  • As one of the most significant challenges in the virtual data center, the virtual data center embedding has attracted extensive attention from researchers. The existing research works mainly focus on how to design algorithms to increase operating revenue. However, they ignore the energy consumption issue of the physical data center in virtual data center embedding. In this paper, we focus on studying the energy-aware virtual data center embedding problem. Specifically, we first propose an energy consumption model. It includes the energy consumption models of the virtual machine node and the virtual switch node, aiming to quantitatively measure the energy consumption in virtual data center embedding. Based on such a model, we propose two algorithms regarding virtual data center embedding: one is heuristic, and the other is based on particle swarm optimization. The second algorithm provides a better solution to virtual data center embedding by leveraging the evolution process of particle swarm optimization. Finally, experiment results show that our proposed algorithms can effectively save energy while guaranteeing the embedding success rate.

Voltage-Frequency-Island Aware Energy Optimization Methodology for Network-on-Chip Design (전압-주파수-구역을 고려한 에너지 최적화 네트워크-온-칩 설계 방법론)

  • Kim, Woo-Joong;Kwon, Soon-Tae;Shin, Dong-Kun;Han, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.8
    • /
    • pp.22-30
    • /
    • 2009
  • Due to high levels of integration and complexity, the Network-on-Chip (NoC) approach has emerged as a new design paradigm to overcome on-chip communication issues and data bandwidth limits in conventional SoC(System-on-Chip) design. In particular, exponentially growing of energy consumption caused by high frequency, synchronization and distributing a single global clock signal throughout the chip have become major design bottlenecks. To deal with these issues, a globally asynchronous, locally synchronous (GALS) design combined with low power techniques is considered. Such a design style fits nicely with the concept of voltage-frequency-islands (VFI) which has been recently introduced for achieving fine-grain system-level power management. In this paper, we propose an efficient design methodology that minimizes energy consumption by VFI partitioning on an NoC architecture as well as assigning supply and threshold voltage levels to each VFI. The proposed algorithm which find VFI and appropriate core (or processing element) supply voltage consists of traffic-aware core graph partitioning, communication contention delay-aware tile mapping, power variation-aware core dynamic voltage scaling (DVS), power efficient VFI merging and voltage update on the VFIs Simulation results show that average 10.3% improvement in energy consumption compared to other existing works.

Design and Performance Analysis of Energy-Aware Distributed Detection Systems with Two Passive Sonar Sensors (수동 소나 쌍을 이용한 에너지 인식 분산탐지 체계의 설계 및 성능 분석)

  • Do, Joo-Hwan;Kim, Song-Geun;Hong, Sun-Mog
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.139-147
    • /
    • 2009
  • In this paper, optimum design of energy-aware distributed detection is considered for a parallel sensor network system consisting of a fusion center and two passive sonar nodes. AND rule and OR rule are employed as the fusion rules of the sensor network. For the fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is investigated that maximizes the probability of detection under a constraint on energy consumption due to false alarms. It is also investigated through numerical experiments how signal strength, an energy constraint, and the distance between two sensor nodes affect the system detection performances.

An Energy Efficient Interference-aware Routing Protocol for Underwater WSNs

  • Khan, Anwar;Javaid, Nadeem;Ali, Ihsan;Anisi, Mohammad Hossein;Rahman, Atiq Ur;Bhatti, Naeem;Zia, Muhammad;Mahmood, Hasan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4844-4864
    • /
    • 2017
  • Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

Energy-aware Tree Routing Protocol for Wireless Sensor Networks (센서 네트워크에서 에너지 효율성을 고려한 트리 라우팅 프로토콜)

  • Hwang, So-Young;Jin, Gwang-Ja;Shin, Chang-Sub;Kim, Bong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.624-629
    • /
    • 2008
  • Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.