• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5744-5764
• /
• 2018

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.113-116
• /
• 1997

In this paper, we present a robust $H^{\infty}$ controller design method for parameter uncertain time-varying systems with disturbance and that have time-varying delays in both state and control. It is found that the problem shares the same formulation with the $H^{\infty}$ control problem for systems without uncertainty. Through a certain differential Riccati inequality approach, a class of stabilizing continuous controller is proposed. For parameter uncertainties, disturbance and time varying delays, proposed controllers the plant and guarantee an $H^{\infty}$ norm bound constraint on disturbance attenuation for all admissible uncertainties. Finally a numerical example is given to demonstrate the validity of the results.ts.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.9 no.13
• /
• pp.29-32
• /
• 1986

A decision procedure to determine when computer software should be released after testing is described. This paper extends optimum release policies minimizing the total expected software cost with a scheduled software delivery time under reliability requirement constraint. Such cost considerations enable us to make a release decision as to when transfer a software system from testing phase to operational phase. The underlying model is software reliability growth model described by a nonhomogeneous poisson process. It is assumed that the penalty cost function due to delay for a scheduled software delivery time is linearly proportional to time. Numerical examples are shown to illustrate the results.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.246-251
• /
• 1998

The basic requirement of a distributed multimedia system are intramedia synchronization which asks the strict delay and jitter for the check period of media buffer and the scaling duration with periodic continuous media such as audio and video media, and intermedia synchronization that needs the constraint for relative time relations among them when several media are presented in parallel. In this paper, a distributed multimedia synchronization algorithm based on the fuzzy logic is presented and the performance is evaluated through simulation. Intramedia synchronisation algorithm uses the media scaling techniques and intermedia synchronization algorithm uses variable service rates on the basis of fuzzy logic to solve the multimedia synchronization problem.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.216-226
• /
• 2008

This paper proposes a novel transport network architecture for the next generation network (NGN) based on the optical burst switching technology. The proposed architecture aims to provide efficient delivery of various types of network traffic by satisfying their quality-of-service constraints. To this end, we have developed a soft-state bandwidth reservation mechanism, which enables NGN transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of numerical analysis and NS2 simulation. Our results show that the packet delay is kept within the constraint for each traffic flow and the burst loss rate is remarkably improved.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.1
• /
• pp.60-66
• /
• 1996

Model Based Predictive Control(MBPC) has been widely used in predictive control since 80's. GPC[1] which is the superset of many MBPC strategies a popular method, but GPC has some weakness, such as insufficient stability analysis, non-applicability to internally unstable systems. However, CRHPC[2] proposed in 1991 overcomes the above limitations. So we chose RHPC based on CRHPC for electric furnace control. An electric furnace which has nonlinear properties and large time delay is difficult to control by linear controller because it needs nearly perfect modelling and optimal gain in case of PID. As a result, those controls are very time-consuming. In this paper, we applied RHPC with equality constraint to electric furnace. The reults of experiments also include the case of RHPC with monotonic weighting improving the transient response and including unmodelled dynamics. So, This paper proved the practical aspect of RHPC for real processes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.3
• /
• pp.174-179
• /
• 2007

In this paper, we present a optimal module selection using genetic algorithm under the power, area, delay constraint. The proposed algorithm use the way of optimal module selection it will be able to minimize power consumption. In the comparison and experimental results, The proposed application algorithm reduce maximum power saving up to 26.9% comparing to previous non application algorithm, and reduce minimum power saving up to 9.0%. It also show the average power saving up to 15.525% and proved the power saving efficiency.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.346-357
• /
• 2010

Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.268-271
• /
• 2001

This paper presents observer-based on-line overload monitoring scheme for a PMSM(Permanent Magnet Synchronous Motor) drive system. Proposed scheme is to monitor overload status of motor drive system at remote place. The drive system is previously installed on main system and has no communication function. Proposed scheme consists of intelligent sensing head and monitoring part. Intelligent sensing head acquire motor 3-Phase currents and transmit data to monitoring part over serial communication interface. Monitoring part estimates motor speed using state observer. By comparing estimated speed with reference speed, we can detect motor fault. In this scheme observed information must coded and transmitted over a digital communication channel with finite capacity. We consider communication constraint as time delay and we design discrete-time observer. The proposed scheme is tested on the actual drive system.