• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3201-3223
• /
• 2020

Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = e^ax - 1 and y = 0.5x² using MATLAB 2017a software for the computation of average and worst ratios of the two levels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.161-170
• /
• 2007

The purpose of this study is to find the solution that overcomes the existing assumption of symmetric cost functions in multi-class assignment. In the assignment problem, the assumption of a symmetric cost function means that the link cost is determined by each unique mode and is not affected by any other modes. In this study, the authors have applied a diagonalized algorithm and a heuristic model based on column generation to a multi-class assignment model and analyzed the result. Through the study, the authors found that the diagonalized algorithm produces equilibrium solutions by the initial convergence condition. In contrast to the diagonalized algorithm, the column generation algorithm has improved the solution model to overcome the problem of equilibrium solutions in the diagonalized algorithm.

• Journal of Power Electronics
• /
• v.2 no.2
• /
• pp.112-123
• /
• 2002

This paper presents a novel prototype of the utility AC power interfaced soft-switching sinewave pulse modulated inverter using the high-frequency flyback for the small scale distributed renewable energy power conditioner. The proposed cricuit with a high-frequency isolation link has a funtion of electrical isolation, which is more cost-effective and reliable for the small-scale distributed renwal energy utilization system from a safety point of riew. The discontinuous conduction mode(DCM) operation of the high-frequency flyback transformer is adopted to establish a simple and low-cost circuit configuration and control scheme. For the simplicity, the circuit operating principle is described on the basis of the modified conventional full bridge inverter, whitch is the typical conventional high-frequency full-bridge inverter employing the high requency flyback transformer to eanble the effictive function of the electrical isolation. Than, the new circuit topology of the unility-interfaced soft-switching sinewave pulse modulated inverter using IGBTs is proposed. The proposed cricuit topology is additionally composed of the auxiliary power regenerating snubber cricuits, which are also mathematically analyzed for the parameter desigen settings. Finally, the performance of the propose inverter is evaluated on the basis of computer-aid simulation. It is noted that the sinewave pulse modulated output current of the inverter is synchronous to the AC main voltage.

• Journal of Power Electronics
• /
• v.14 no.6
• /
• pp.1119-1129
• /
• 2014

This study proposes a novel five-level three-phase hybrid-clamped converter composed of only six switches and one flying capacitor (FC) per phase. The capacitor-voltage-drift phenomenon of the converter under the classical sinusoidal pulse width modulation (SPWM) strategy is comprehensively analyzed. The average current, which flows into the FC, is a function of power factor and modulation index and does not remain at zero. Thus, a specific modulation strategy based on space vector modulation (SVM) is developed to balance the voltage of DC-link and FCs by injecting a common-mode voltage. This strategy applies the five-segment method to synthesize the voltage vector, such that switching losses are reduced while optional vector sequences are increased. The best vector sequence is then selected on the basis of the minimized cost function to suppress the divergence of the capacitor voltage. This study further proposes a startup method that charges the DC-link and FCs without any additional circuits. Simulation and experimental results verify the validity of the proposed converter, modulation strategy, and precharge method.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.115-121
• /
• 2002

This paper discussed to design system to overcome time, place and service limitation in the case of extracting traffic on active service in the ATM network. There are several specification in this system : for a remote control function, a real-time traffic extraction from ATM link on service without affect in-service, and an O&M(Operating and Maintenance) cost down effect. This paper include the requirement, module structure, operating characteristics and command for the developing function. This product installed at the KT's telephone office. And we have tested the stability, reliability and functionality. As the result, it was verified that this system commercially is abel to use without especial problem. Hereafter, we are improving module structure for the cost down.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.787-796
• /
• 1995

A man model is a useful design tool for the evaluation of man machine systems and products. An arm reach trajectory prediction for such a model will be specifically useful to present human activities and, consequently, could increase the accuracy and reality of the evaluation. In this study, a three-dimensional reach trajectory prediction model was developed using an inverse kinematics technique. The upper body was modeled as a four link open kinematic chain with seven degrees of freedom. The Resolved Motion Method used for the robot kinematics problem was used to predict the joint movements. The cost function of the perceived discomfort developed using the central composite design was also used as a performance function. This model predicts the posture by moving the joints to minimize the discomfort on the constraint of the end effector velocity directed to a target point. The results of the pairwise t-test showed that all the joint coordinates except the shoulder joint's showed statistically no differences at .alpha. = 0.01. The reach trajectory prediction model developed in this study was found to accurately simulate human arm reach trajectory and the model will help understand the human arm reach movement.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.3
• /
• pp.60-67
• /
• 2016

In cumulative transfer functions, as number of transfer increase, the impact of individual transfer to transfer cost increase linearly or non linearly. This function can effectively explain various passengers's travel behavior who choose their travel routes in integrated transit line networks including bus and railway modes. Using the function, it is possible to simulate general situations such that even though more travel times are expected, less number of transfer routes are preferred. However, because travel cost with cumulative transfer function is known as non additive cost function types in route search algorithms, finding an optimal route in integrated transit networks is confronted by the insolvable enumeration of all routes in many cases. This research proposes a methodology for finding an optimal path considering cumulative transfer function. For this purpose, the reversal phenomenon of optimal path generated in route search process is explained. Also a heuristic methodology for selecting an optimal route among multiple routes predefined by the K path algorithm. The incoming link based entire path deletion method is adopted for finding K ranking path thanks to the merit of security of route optimality condition. Through case studies the proposed methodology is discussed in terms of the applicability of real situations.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.65-74
• /
• 2016

Ship ad-hoc network (SANET) extends the coverage of the maritime communication among ships with the reduced cost. To fulfill the growing demands of real-time services, the SANET requires an efficient clock time synchronization algorithm which has not been carefully investigated under the ad-hoc maritime environment. This is mainly because the conventional algorithms only suggest to decrease the beacon collision probability that diminishes the clock drift among the units. However, the SANET is a very large-scale network in terms of geographic scope, e.g., with 100 km coverage. The key factor to affect the synchronization performance is the signal propagation delay, which has not being carefully considered in the existing algorithms. Therefore, it requires a robust multi-hop synchronization algorithm to support the communication among hundreds of the ships under the maritime environment. The proposed algorithm has to face and overcome several challenges, i.e., physical clock, e.g., coordinated universal time (UTC)/global positioning system (GPS) unavailable due to the atrocious weather, network link stability, and large propagation delay in the SANET. In this paper, we propose a logical clock synchronization algorithm with multi-hop function for the SANET, namely multi-hop clock synchronization for SANET (MCSS). It works in an ad-hoc manner in case of no UTC/GPS being available, and the multi-hop function makes sure the link stability of the network. For the proposed MCSS, the synchronization time reference nodes (STRNs) are efficiently selected by considering the propagation delay, and the beacon collision can be decreased by the combination of adaptive timing synchronization procedure (ATSP) with the proposed STRN selection procedure. Based on the simulation results, we finalize the multi-hop frame structure of the SANET by considering the clock synchronization, where the physical layer parameters are contrived to meet the requirements of target applications.