• Journal of KIISE
• /
• v.44 no.2
• /
• pp.213-222
• /
• 2017

The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.

• Korean Chemical Engineering Research
• /
• v.46 no.2
• /
• pp.316-329
• /
• 2008

Recently the increased attention pays on the processing of multiple, relatively low quantity, high value-added products resulted in adoption of batch process in the chemical process industry such as pharmaceuticals, polymers, bio-chemicals and foods. As there are more possibilities of the improvement of operations in batch process than continuous processes, a lot of effort has been made to enhance the productivity and operability of batch processes. But the chemical process industry faces a range of uncertainties factors such as demands for products, prices of product, lead time for the supply of raw materials and in the production, and the distribution of product. And global competition has made it imperative for the process industries to manage their supply chains optimally. Supply chain management aims to integrate plants with their supplier and customers so that they can be managed as a single entity and coordinate all input/output flows (of materials, information) so that products are produced and distributed in the right quantities, to the right locations, and at the right time.The objective of this study is to solve the purchase, distribution, production planning and scheduling problem, which minimizes the total costs of production, inventory, and transportation under uncertainty. And development of SCM model in chemical industry including batch mode operations. Through that, the enterprise can respond to uncertainty. Also integrated process optimal planning and scheduling model for manufacturing supply chain. The result shows that, the advantage of supply chain integration are quality matters seen by customers and suppliers, order schedules, flexibility, cost reduction, and increase in sales and profits. Also, an integration of supply chain (production and distribution system) generates significant savings by trading off the costs associated with the whole, rather than minimizing supply chain costs separately.

• Journal of Digital Convergence
• /
• v.18 no.10
• /
• pp.225-232
• /
• 2020

The underlaying communication scheme in 5G cellular network is a very promising resource sharing scheme, and it is an effective scheme for improving service performance of 5G and reducing communication load between a cellular link and a device to device (D2D) link. This paper proposes the algorithm to minimize the resource interference that occurs when performing 5G-based multi-class service on gNB(gNodeB) and the cooperative priority-based resource allocation scheduling scheme (CPRAS) to maximize 5G communication service according to the analyzed control conditions of interference. The proposed CPRAS optimizes communication resources for each device, and it optimizes resource allocation according to the service request required for 5G communication and the current state of the network. In addition, the proposed scheme provides a function to guarantee giga-class service by minimizing resource interference between a cellular link and a D2D link in gNB. The simulation results show that the proposed scheme is better system performance than the Pure cellular and Force cellular schemes. In particular, the higher the priority and the higher the cooperative relationship between UE(User Equipment), the proposed scheme shows the more effective control of the resource interference.

• Journal of Advanced Navigation Technology
• /
• v.7 no.1
• /
• pp.59-71
• /
• 2003

The channel scheduler is suggested the radio resource management method in order to provide service with guaranteeing fairness and throughput to the users who use limited wireless channel. Proportional fairness scheduling algorithm is the channel scheduler used in the AMC(Adaptive Modulation and Coding)/TDM system, and this algorithm increases the throughput considering the user's time fairness. In this paper is suggested the channel scheduler combining CDM scheme available in AMC/TDM/CDM system. Unlike the system which only uses TDM which provide the only one user at the same slot, this scheduler can service a lot of users since this uses the CDM scheme with multi-cord channel. At every moment, allocation of transmission power to multi-channel users is problematic because of CDM scheme. In this paper, we propose a water-filling scheduling algorithm to solve the problem. Water-filling fairness(WF2) scheduling algorithm watches the average channel environment. So, this modified method guarantees fairness for each user in terms of power and service time.

• Journal of the Korean Society for Library and Information Science
• /
• v.57 no.4
• /
• pp.25-47
• /
• 2023

Library collaboration instruction (LCI) is a process in which a classroom teacher and librarian collaborate to co-planning, co-implementation, co-assessment instruction. LCI is being studied and modeled in various dimensions such as the level of collaboration, information activities, and time scheduling. However, there is no integrated model that comprehensively covers teacher and librarian collaboration. The purpose of this study is to propose a schematic integration model for LCI by comparing and analyzing various models in five dimensions (level of collaboration, information activities, collaborative approach, time scheduling, and technological integration). The main results of the integration model for LCI reflected in this study are as follows. First, in terms of the level of collaboration, TLC integration model reflected such as library-based teacher-led instruction, cross-curricular integrated curriculum. Second, in terms of information activities, LCI integration model reflected social and science subjects inquiry activities in addition to the information use process. Third, in terms of collaborative approach, LCI integration model is divided into such as lead-observation instruction and parallel station instruction. Fourth, in terms of time management, LCI integration model took into account the Korean national curriculum and scheduling methods. Fifth, in terms of technology integration, LCI integration model reflected the PICRAT model, modified from the perspective of library collaboration instruction.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.31-43
• /
• 2015

In this paper, we discuss a code generation technique for custom transport triggered architecture (TTA) from a high-level language structure. This methodology is implemented by using TTA-based Co-design Environment (TCE) tool. The results show how the scheduler exploits instruction level parallelism in the custom target architecture and source program. Thus, the scheduler generates parallel TTA instructions using lower cycle counts than the sequential scheduling algorithm. Moreover, we take Tensilica tool to make a comparison with TCE. Because of the efficiency of TTA, TCE takes less execution cycles compared to Tensilica configurations. Finally, this paper shows that it requires only 7 cycles to generate the parallel TTA instruction set for implementing Cyclic Redundancy Check (CRC) applications as an input design, and presents the code generation technique to move complexity from the processor software to hardware architecture. This method can be applicable lots of channel Codecs like CRC and source Codecs like High Efficiency Video Coding (HEVC).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4342-4366
• /
• 2016

Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.425-428
• /
• 2005

본 연구는 건설장비 차량 조립부품을 제작하는 가공공장의 계획 및 운영 시스템 개발에 대한 내용이다. 연구의 대상은 건설장비 차량인 굴삭기, 휠로더, 지게차의 조립부품을 제작하는 공장으로 제작품별 제작라인이 구성되어 있다. 그리고 각 제작라인에는 여러 개의 공정이 있으며, 일부 공정은 작업자에 의해 작업이 이루어지고, 용접 및 가공 등은 자동화된 장비 및 설비에 의해 작업이 된다. 가공공장에서 관리 및 운영의 주요 관점은 이후 공정인 조립공장의 조립 착수일에 늦지 않게 제작된 부품을 공급하는 것이다. 그리고 공장 자체적으로 제작라인 내의 재공재고 감소, 작업일간 작업부하평준화, 자동화 장비 및 설비의 효율 극대화 등이 공장의 주요 관리 사항이다. 따라서 본 연구에서는 가공공장에서 제작되는 조립부품의 납기일 준수, 재고 감소, 부하 평준화, 장비효율의 극대화를 위해 공장을 체계적으로 관리하기 위한 계획 및 운영 시스템을 개발하였다. 개발시스템에는 제작라인별 제작 착수 및 자재발주${\cdot}$입고 관리, 공정별 실적관리, 실시간 작업 진행 관리, 용접 불량 관리 기능 등이 있다. 시스템은 MSSQL 서버, 오라클과 Visual Basic, Visual C# ASP로 개발되었다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.348-352
• /
• 2005

본 논문은 조선소에서 계획기간동안 각 플랜트의 생산일정에 따른 블록의 모든 수송요구량이 미리 알려져 있는 정적인(static) 수송환경을 고려한 트랜스포터 일정계획문제를 다룬다. 조선소 내에서 블록들의 수송은 몇 가지 특성을 가진다. 500톤을 초과하는 거대 블록들은 2대 이상이 결합된 새로운 형태의 트랜스포터를 이용하여 운반된다. 운반이 요구되는 블록들 중 일부는 계획기간동안 규정된 출발요구시각에 pick-up되기를 요구하는 반면 나머지 블록들은 계획기간동안 규정된 도착요구시각 전에 delivery되기를 요구한다. 이러한 트랜스포터의 결합 및 시간 제약은 문제를 더욱 복잡하게 하는 요인이 된다. 본 논문에서는 계획기간 내에 모든 블록운반 요구사항들(출발지와 도착지, pick-up과 delivery 시각, 톤수, 결선 등)을 만족시키는 트랜스포터 일정계획문제를 다룬다. 트랜스포터 일정계획문제에서 중요한 주제는 총 로지스틱스 시간 (공차운행시간, delay 시간 및 tardy 시간)을 최소화하기 위해 계획기간 내에 최소의 트랜스포터 운영대수로 각 트랜스포터에 어떤 블록을 할당하고 어떤 순서로 운반할 것인 지를 결정하는 것이다. 이에 본 논문에서는 주어진 트랜스포터 일정계획문제를 해결하기 위해, 1단계에서 최소비용 네트워크 흐름문제를 근간으로 트랜스포터의 최소사용대수를 구하고 이를 기초로 2단계에서 각 트랜스포터에의 블록 할당과 운반순서를 결정하는 2단계 휴리스틱 알고리즘을 제안한다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.803-816
• /
• 1996

It is possible to prevent deadlock if the priority which is conventionally given to transactions is endowed to data items and the transactions with the highest priority among transactions accessing the data item is allowed to proceed. Based on this observation, we proposed a Data-Priority Based Locking Protocol(DPLP) and evaluated its performance against known locking protocols in Real Time Database Management System(RTDBMS). Transaction inter-arrival time(IAT) was varied to determine success ratio, average-lateness, confict ratio and restart ratio, In these simulations we verified that the proposed DPLP performs better than the other protocols.