• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1085-1092
• /
• 2012

Mobile communication systems define user state transition mechanisms in order to manage radio resources and battery power efficiently. In the state transition mechanism, a state with a higher energy consumption inherently offers a shorter access delay, so there is a tradeoff between the energy and delay performances. In this paper, we analyze the user state transition mechanism of UMTS by considering the bursty traffic attributes of mobile applications. We perform a numerical evaluation for both the energy consumption and the activation delay by Markov modeling of the state transition mechanism, and investigate their tradeoff relationship as functions of operational parameters. The resulting energy-delay tradeoff curves clearly show an achievable performance bound of the user state transition mechanism and also offer an optimal operation strategy to minimize the energy consumption while guaranteeing the delay requirement.

• Smart Media Journal
• /
• v.9 no.3
• /
• pp.18-24
• /
• 2020

Existing energy was a system produced by a specific company and sold to consumers, but it is expected that in the near future, producers will become consumers and consumers will become producers. Recently, the emergence of cloud systems, 5G network construction, and energy reuse, including solar energy, are changing the shape of the energy market. In order to share energy, there are various agent systems, energy networks, and structures that form markets. In this study, we defined the above three and proposed a strategy using the Secure Energy Model (SEM) by applying a blockchain for a safe and fair energy market. The analytical results showed that the trust between the energy producers and consumers participating in the energy trade was formed.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.791-800
• /
• 2009

Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.451-460
• /
• 2005

We present a methodology to design energy-efficient data paths using FPGAs. Our methodology integrates domain specific modeling, coarse-grained performance evaluation, design space exploration, and low-level simulation to understand the tradeoffs between energy, latency, and area. The domain specific modeling technique defines a high-level model by identifying various components and parameters specific to a domain that affect the system-wide energy dissipation. A domain is a family of architectures and corresponding algorithms for a given application kernel. The high-level model also consists of functions for estimating energy, latency, and area that facilitate tradeoff analysis. Design space exploration(DSE) analyzes the design space defined by the domain and selects a set of designs. Low-level simulations are used for accurate performance estimation for the designs selected by the DSE and also for final design selection We illustrate our methodology using a family of architectures and algorithms for matrix multiplication. The designs identified by our methodology demonstrate tradeoffs among energy, latency, and area. We compare our designs with a vendor specified matrix multiplication kernel to demonstrate the effectiveness of our methodology. To illustrate the effectiveness of our methodology, we used average power density(E/AT), energy/(area x latency), as themetric for comparison. For various problem sizes, designs obtained using our methodology are on average $25\%$ superior with respect to the E/AT performance metric, compared with the state-of-the-art designs by Xilinx. We also discuss the implementation of our methodology using the MILAN framework.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.131-134
• /
• 2013

최근 클라우드 컴퓨팅의 발전과 상업적인 성공과 함께 클라우드 자원의 이용률을 최대로 유지하면서 에너지를 효율적으로 사용하기 위한 연구에 대한 관심이 커지고 있다. 자원의 사용률이 최대로 높아지게 되면 에너지 소비량이 급격하게 증가하여 많은 에너지를 사용하게 되므로 자원의 사용율과 에너지 사용은 트레이드오프 관계를 가지게 된다. 따라서 본 논문에서는 자원의 최대 사용 및 효율적인 에너지 사용을 위해 에너지 소비가 최적이 되는 자원 이용률의 임계값을 찾기 위한 연구를 수행하였다. 실험을 위해 자원 중 가장 많은 에너지를 소비하는 CPU를 이용하였고, 전력 측정을 위해 KEM2500 전력계와 ThrottleStop_500 프로그램을 사용하였다. 실험 결과 CPU 사용률이 약 90%일 때 에너지 사용량이 급격하게 증가하였으며, 기존의 평균 자원 이용률과 비교했을 때 12.3% 정도의 전기량이 더 소모됨을 확인하였다. 따라서 클라우드 컴퓨팅에서 CPU 자원의 이용률이 90%일 때 에너지가 최적이라고 할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.528-534
• /
• 2013

The energy consumption problem should be taken into consideration in wireless sensor network. Many studies have been proposed to address the energy consumption and delay problem. In this paper, we propose BISA(Bio-inspired Scheduling Algorithm) to reduce the energy consumption and delay in wireless sensor networks based on biological system. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission by multiplexing data transmission path. Through simulation, we confirm that the proposed scheme guarantees the efficient energy consumption and delay requirement.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.9 no.4
• /
• pp.219-230
• /
• 2011

The nuclear fuel cycle (NFC) analysis is a study to set a NFC policy and to promote systematic researches by analyzing technologies and deriving requirements at each stage of a fuel cycle. System analysis techniques are utilized for comparative analysis and assessment of options on a considered system. In case that NFC is taken into consideration various methods of the system analysis techniques could be applied depending on the range of an interest. This study presented NFC analysis strategies for the development of a domestic advanced NFC and analysis techniques applicable to different phases of the analysis. Strategically, NFC analysis necessitates the linkage with technology analyses, domestic and international interests, and a national energy program. In this respect, a trade-off study is readily applicable since it includes various aspects on NFC as metrics and then analyzes the considered NFC options according to the derived metrics. In this study, the trade-off study was identified as a method for NFC analysis with the derived strategies and it was expected to be used for development of an advanced NFC. A technology readiness level (TRL) method and NFC simulation codes could be utilized to obtain the required metrics and data for assessment in the trade-off study. The methodologies would guide a direction of technology development by comparing and assessing technological, economical, environmental, and other aspects on the alternatives. Consequently, they would contribute for systematic development and deployment of an appropriate advanced NFC.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.20-24
• /
• 2009

sensor node work limited energy. It is undesirable or impossible to replace the batteries that are depleted of energy because of characteristics of the sensor network. Due to the specific energy constrained environment, MAC design for sensor networks generally has to take energy consumption as one of its primary concerns. But in sensor networks, latency has been a key factor affecting the applicability of sensor networks to some delay-sensitive applications. Therefore, we propose MAC protocols based DSMAC in this paper. Which is able to dynamically change the sleeping and duty cycle of sensors is adjusted to adapt to packet amounts in buffer. Proposed MAC has energy efficiency and low latency, compared DSMAC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1057-1059
• /
• 2016

A construction method of energy-efficient data aggregation tree is proposed by considering a tradeoff between acquisition time and energy consumption in wireless sensor networks. This proposed method constructs the data aggregation tree to minimize the link cost between the connected nodes for reducing energy consumption, while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed aggregation tree can be generated with low complexity and achieves high energy efficiency compared to conventional methods.

• The KIPS Transactions:PartA
• /
• v.12A no.4 s.94
• /
• pp.313-320
• /
• 2005

The 2-D discrete cosine transform (DCT) is an integral part of video and image processing; it is used in both the PEG and MPEG enciding standards. As streaming video is brought to mobile devices, it becomes important that it is possible to calculate the DCT in an energy-efficient manner. In this paper, we present a new algorithm the DCT with a linear array PEs. This design is optimized for energy efficiency. We analyze the energy, area, and latency tradeoffs available with this design and then compare its energy dissipation, area, and latency to those of Xilinx's optimized IP core.