• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.49-56
• /
• 2007

The IEEE 802.15.4 low rate wireless personal area network is a protocol suitable for wireless sensor networks. Thus there has been growing interest in the IEEE 802.15.4 protocol in the home automation networks. This paper proposes a scheduling scheme obtaining optimal parameters regarding the IEEE 802.15.4 frame and subframes in the home automation networks. Guaranteed time slots (GTS) are exploited for the delivery of real-time traffic. Given a set of the requirements for bandwidths and periods assigned to nodes in the network, the beacon interval and the active/inactive subframe duration satisfying the requirements are selected considering the low duty cycle by the proposed scheme. Based on these parameters, analytic results provide the way to efficient use of network resources including energy.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.2
• /
• pp.95-103
• /
• 2007

Dynamic voltage scaling (DVS) is a well-known and effective power management technique. While there has been research on slack distribution, voltage allocation and other aspects of DVS, its effects on non-voltage-scalable devices has hardly been considered. A DC-DC converter plays an important role in voltage generation and regulation in most embedded systems, and is an essential component in DVS-enabled systems that scale supply voltage dynamically. We introduce a power consumption model of DC-DC converters and analyze the energy consumption of the system including the DC-DC converter. We propose an energy-optimal off-line DVS scheduling algorithm for systems with DC-DC converters, and show experimentally that our algorithm outperforms existing DVS algorithms in terms of energy consumption.

• Journal of Energy Engineering
• /
• v.5 no.1
• /
• pp.87-92
• /
• 1996

This paper formulates dynamic optimization model for Time-Of-Use Rates when a electric power system consists of three generators and a rating period is divided into three sub-periods. We use Pontryagin's Maximum Principle to derive optimal price and investment policy. Particularly the cross-price elasticities of demand are considered in the objective function. We get the following results. First, the price is equal to short-run marginal cost when the capacity is sufficient. However, if the capacity constraint is active, the capacity cost is included in the price. Therefore it is equal to the long-run marginal cost. Second, The length of rating period affects allocation of capacity cost for each price. Third, the capacity investment in dynamic optimization is proportional to the demand growth rate of electricity. However the scale of investment is affected by not only its own demand growth rate but also that of other rating period.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.7
• /
• pp.261-272
• /
• 2003

An Ethernet PON(Passive Optical Network) is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON , the next generation access network, is based on TDMA(Time Division Multiple Access) basically and can classify this protocol into a fixed length slot assignment method suitable for leased line supporting QoS(Quality of Service) and a variable length slot assignment method suitable for LAN/MAN with the best effort. For analyzing the performance of these protocols, we design an Ethernet PON model using OPNET tool. To establish the maximum efficiency of a network, we verify a MAC protocol and determine the optimal number of ONUs(Optical Network Unit) that can be accepted by one OLT(Optical Line Terminal) and propose the suitable buffer size of ONU based on analyzing the end-to-end Ethernet delay, queuing delay, throughput, and utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.477-486
• /
• 2003

In combinatorial auctions buyers nay bid for arbitrary combinations of goods. But determining the winners of combinatorial auctions who maximize the profit of a seller is known to be NP-complete. A branch-and-bound method can be one of practical algorithm for winner determination. However, bid selection heuristics play a very important role in the efficiency of a branch-and-bound method. In this paper, we designed and implemented an algorithm which used a branch-and-bound method and Linear Programming for winner determination in combinatorial auctions. We propose new bid selection heuristics which consider a branching bid and conflicting bids simultaneously to select a branching bid in the algorithm. In addition, upper bounds are reused to reduce the running time in specific cases. We evaluated the performance of the algorithm by experiments with five data distributions and compared our method with others. The algorithm using heuristics showed a superior efficiency in two data distributions and a similar efficiency in three distributions.

• Journal of Power Electronics
• /
• v.18 no.3
• /
• pp.702-713
• /
• 2018

Power loss reduction and total harmonic distortion(THD) minimization are two important goals of improving three-level inverters. In this paper, an optimized pulse width modulation (PWM) strategy that can reduce switching losses and balance the neutral point with an optional THD of three-level neutral-point-clamped inverters is proposed. An analysis of the two-level discontinuous PWM (DPWM) strategy indicates that the optimal goal of the proposed PWM strategy is to reduce switching losses to a minimum without increasing the THD compared to that of traditional SVPWMs. Thus, the analysis of the two-level DPWM strategy is introduced. Through the rational allocation of the zero vector, only two-phase switching devices are active in each sector, and their switching losses can be reduced by one-third compared with those of traditional PWM strategies. A detailed analysis of the impact of small vectors, which correspond to different zero vectors, on the neutral-point potential is conducted, and a hysteresis control method is proposed to balance the neutral point. This method is simple, does not judge the direction of midpoint currents, and can adjust the switching times of devices and the fluctuation of the neutral-point potential by changing the hysteresis loop width. Simulation and experimental results prove the effectiveness and feasibility of the proposed strategy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.950-958
• /
• 2007

This paper presents an efficient packet loss resilient scheme for real-time video transmission over the Internet. By analyzing the temporal and spatial dependencies in inter- and intra-frames, we assign forward error correction codes (FEC) across video packets for minimizing the effect of error concealment and error propagation from packet loss. To achieve optimal allocation of FEC codes, we formulate the effect of packet loss on video quality degradation as packet distortion model. Then we propose an unequal FEC assignment scheme with low complexity based on packet correction rate, which uses the packet distortion model and includes channel status information. Simulation results show that the proposed FEC assignment scheme gives substantial improvement for the received video quality in packet lossy networks. Furthermore the proposed scheme achieves relatively smaller degradation of video quality with higher packet loss rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.4
• /
• pp.229-239
• /
• 2013

Recently, device-to-device (D2D) communications have been highlighted to improve the spectral efficiency and offer various user experiences in cellular networks. In this paper, we survey standards and literatures related to the D2D technology and address various advantages of D2D technology, and the problems to be resolved before practically implemented. Especially, by considering an important interference issue between cellular and D2D links, five resource allocation and interference management scenarios are provided and their performances are evaluated through the system level simulations. The simulation results show that the use of D2D significantly improve the cell capacity and the D2D user rate due to the effects of frequency reuse and data off-loading. Notably, it is also shown that an optimal D2D communication range exists to maximize the system performance.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.719-725
• /
• 2017

To reduce management costs and improve performance, the European Telecommunication Standards Institute (ETSI) introduced the concept of network function virtualization (NFV), which can implement network functions (NFs) on cloud/datacenters. Within the NFV architecture, NFs can share physical resources by hosting NFs on physical nodes (commodity servers). For network service providers who support NFV architectures, an efficient resource allocation method finds utility in being able to reduce operating expenses (OPEX) and capital expenses (CAPEX). Thus, in this paper, we analyzed the network service chain embedding problem via an optimization formulation and found a close-optimal solution based on the Markov approximation framework. Our simulation results show that our approach could increases on average CPU utilization by up to 73% and link utilization up to 53%.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.