• 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 Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1556-1563
• /
• 2004

In this paper, we propose an efficient full mesh topology aggregation method in PNNI networks. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current full mesh topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crank back rate. The result is that the proposed scheme is better than the current scheme in performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.396-400
• /
• 2005

In this paper, we propose an efficient full mesh topology aggregation method in PNNI networks. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. The result is that the proposed scheme is better than the current scheme in performance.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.100-107
• /
• 1999

무인 운반차량 시스템 (AGV System) 의 이용도가 날로 증가함에 따라 시스템의 최적화 및 운영 방법에 관한 많은 연구가 진행되고 있다. 이에 본 연구에서는 AGV System에서 사용하는 Routing 및 Scheduling 정책들을 연구하고 이를 개선할 수 있는 새로운 방안을 모색한 후, 컴퓨터 모델링 기법을 이용한 보다 객관적인 시뮬레이션을 수행하여 최적의 AGV System과 그에 적합한 운영 정책을 제시하는데 그 목적이 있다. 따라서 본 논문은 크게 AGV Routing 과 Scheduling에 관한 연구로 나누어진다. AGV Routing은 AGV의 이동경로를 설정하는 것으로서 충돌 방지 (Collision Avoidance)와 최단경로 탐색 (Minimal Cost Path Find) 이라는 두 개의 주요 알고리즘으로 이루어진다. AGV Scheduling 은 장비의 공정시간과 AGV의 Loading/Unloading, Charging 시간으로 인해 불규칙한 Event 가 일어났을 경우 AGV 각각의 Jop을 알맞게 선정해주는 정책을 말하며 일반적으로 AGV Selection Rule, Charging Rule이 여기에 속한다. 본 연구에서는 이러한 알고리즘들이 반영된 AGV System을 컴퓨터 모델로 구축하여, 기존 시스템에서 사용되고 있는 여러 운영 정책들의 문제점들을 분석하였으며, Multiple AGV System을 최적화 시키는 운영 정책이 보다 객관적으로 제시되었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.883-885
• /
• 2011

소프트웨어 분석 기법이 발전하며 다양한 종류의 악성 코드를 점검할 수 있게 되면서 이를 회피하기 위한 기술들이 등장하였다. 실행 시 스스로 코드를 변경하는 등의 진화된 악성 코드들로부터 시스템을 보호하기 위해 프로그램에 존재하는 실행되지 않는 경로에 대해서도 검사를 할 수 있는 기법을 제시한다. 제안하는 기법은 프로그램을 읽어 CFG를 생성하고, 각 종료 지점에서부터 이를 역방향으로 순회하여 모든 실행 경로를 얻는다. 여기서 발생하는 오버헤드는 멀티코어 프로세서를 활용하는 다중 작업으로 완화시킬 수 있다.

• International Commerce and Information Review
• /
• v.16 no.3
• /
• pp.431-463
• /
• 2014

This paper analyzed the effect of the alliance capabilities needed for each stage of alliance lifecycle(search & negociation, contract, operation, evaluation/termination) according to the alliance life cycle of SMEs consulting firms on the performance, and the moderating effect of the partnership & entrepreneurship between the process capabilities and performance using the multi-group analysis The result shows that searching & operational capabilities have a positive impact on the customer & learning performance, not contracting and termination capabilities, and the partnership & entrepreneurship moderated between the process capabilities and alliance performance. This study shows that the operation stage in the alliance life cycle is the most important, in this process alliance partners show the higher partnership & entrepreneurship than any other stages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.331-340
• /
• 2006

In this Paper, we propose to extend the TSS-LS(Two-Step Search scheme with Linear search based Second step) scheme which was already proposed by the authors for coherent UWB(Ultra Wide Band) systems, to rapid and reliable acquisition of noncoherent UWB systems in multipath channels. The proposed noncoherent TSS-LS employing simple energy window banks utilizes two different thresholds and search windows to achieve fast acquisition. Furthermore, the linear search is adopted for the second step in the proposed scheme to correctly find the starting point in the range of effective delay spread of the multipath channels, and to obtain reliable BER(Bit Error Rate) performance of the noncoherent UWB systems. Simulation results with multipath channel models by IEEE 802.15.3a show that the proposed two-step search scheme can achieve significant reduction of the required mean acquisition time as compared to general search schemes. ]n addition, the proposed scheme achieves quite good BER performance for large signal-to-noise ratios, which is favorably comparable to the case of ideal perfect timing.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.30-45
• /
• 2014

Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.98-104
• /
• 2004

This paper represents the fast and efficient load transfer guide for fault or outage restoration in distribution system. For restoration guide, system trace is performed to reverse direction(source side) from tie breaker in tree-structured distribution network. Search space and breaker's combinational number for restoration guide are greatly reduced. It is proposed the load transfer method including first stage restoration(single load transfer, double load transfer, triple load transfer), second stage restoration(transferring load to neighboring feeder in order to expand the capacity margin) and load cutoff guide. The proposed method can be easily applied to primary customer restoration, multi-fault recovery and distribution automation system.