• The Journal of Information Systems
• /
• v.25 no.4
• /
• pp.105-119
• /
• 2016

Purpose The conventional solution methods for production scheduling problems typically focus on the active schedules, which result in short makespans. However, the active schedules are more difficult to generate than the semi active schedules. In other words, semi active schedule based search strategy may help to reduce the computational costs associated with production scheduling. In this context, this paper aims to compare the performances of active schedule based and semi active schedule based search methods for production scheduling problems. Design/methodology/approach Two decoding approaches, active schedule decoding and semi active schedule decoding, are introduced in this paper, and they are used to implement genetic algorithms for classical job shop scheduling problem. The permutation representation is adopted by the genetic algorithms, and the decoding approaches are used to obtain a feasible schedule from a sequence of given operations. Findings The semi active schedule based genetic algorithm requires slightly more iterations in order to find the optimal schedule, while its execution time is quite shorter than active schedule based genetic algorithm. Moreover, the operations of semi active schedule decoding is easy to understand and implement. Consequently, this paper concludes that semi active schedule based search methods also can be useful if effective search strategies are given.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.192-201
• /
• 2014

User scheduling boosts the Multi-User Multi-Input Multi-Output (MU-MIMO) gain by selecting an optimal set of users to increase the 802.11 Wi-Fi system capacities. Many kinds of user scheduling algorithms, however, fail to realize the advantages of MU-MIMO due to formidable Channel State Information (CSI) overhead. In this paper, we propose a user scheduling method considering such CSI exchange overhead and its MAC protocol, called ACE (Active CSI Exchange based User Scheduling for MU-MIMO Transmission). Unlike most proposals, where user scheduling is performed after an Access Point (AP) receives CSI from all users, ACE determines the best user set during the CSI exchange phase. In particular, the AP broadcasts a channel hint about previously scheduled users, and the remaining users actively send CSI reports according to their Effective Channel Gains (ECGs) calculated from the hint. Through trace-driven MATLAB simulations, we prove that the proposed scheme improves the throughput gain significantly.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.753-760
• /
• 2017

In this paper, we propose a new method to improve the performance of a Quorum-based NDP (Neighbor Discovery Protocol) in heterogeneous wireless sensor networks. It creates a new set of discovery schedules by combining two different Quorum-based matrices. The original Quorum-based schedule guarantees only two overlapping active slots with a cycle, but the newly created matrix greatly increases the chance of neighbor discovery. Therefore, although the size of the combined matrix of the proposed method increases, the number of discovery chances with neighboring nodes considerably increases, and the new approach is superior to the original Quorum-based neighbor node discovery protocol. In this study, we compares the performance of the proposed method to the Quorum-based protocols such as SearchLight and Hedis using TOSSIM. We assume all sensor nodes operates in a different duty cycle in the experiment. The experimental results show that the proposed algorithm is superior to other Quorum-based methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.574-582
• /
• 2004

This paper shows the performance comparisons of several different rate scheduling schemes for non-real time data service over the uplink of burst switching-based direct sequencecode division multiple access (DS/CDMA) system to support the integrated voice/data service. The closed-form solution of optimal scheduling formulation, which minimizes average transmission delay when all of the active data users are transmitting simultaneously, is presented and mathematical analyses with other rate scheduling schemes, which provide efficiency criterion of transmission delay for rate scheduling schemes, are performed. Numerical results show the analyses explicitly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.41-49
• /
• 2009

A crucial issue in deploying wireless sensor networks is to perform a sensing task in an area of interest in an energy-efficient manner since sensor nodes have limited energy Power. The most practical solution to solve this problem is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy In this paper, we present a simple wake-up scheduling protocol, which can maintain sensing coverage required by applications and yet increase network lifetime by turning off some redundant nodes. In order to do this, we use the concept of a weighted average distance. A node decides whether it is active or inactive based on the weighted average distance. The proposed protocol allows sensor nodes to sleep dynamically while satisfying the required sensing coverage.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.28 no.6
• /
• pp.635-643
• /
• 2015

In this study, the experimental test results are given to confirm the control efficiency of the linear control algorithm used for designing the active mass dampers(AMD) which are supposed to be installed at Incheon international airport control tower. The comparison between the results from test and numerical analysis is conducted and it was observed that the AMD showed the control performance expected by the numerical model. The effects of the gain scheduling and constant-velocity signal added to the control signal calculated by the algorithm is identified through the observation that the AMD always show behavior within the given stroke limit without any loss of the desired control performance. The phase difference between the accelerations of the structure and the AMD were almost close to 90 degree, which implies that the AMD absorbed the structural energy effectively.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.2
• /
• pp.196-206
• /
• 2012

AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.625-630
• /
• 2006

Zigbee 센서 네트워크에서는 multihop 전송을 위하여 tree topology와 beacon-enabled 네트워크 구성을 갖는다. 이러한 multihop beaconing 네트워크의 목적은 routing 노드들에게 Sleep할 기회를 주어 파워의 소모를 줄이고자 하는 데 있다. 파워의 소모를 줄이고 beacon 전송시의 충돌을 방지하기 위하여 beacon 전송 스케줄링이 필요한데 본 논문은 multihop을 지원하고 에너지 효율에 효과적인 beacon 전송 스케줄링 알고리즘과 이를 바탕으로 에너지 효율적인 라우팅 기법을 제안한다. 본 제안은 Zigbee coordinator의 beacon interval(BI)이 결정되면 네트워크 내의 beacon을 전송하는 모든 노드들은 Zigbee coordinator의 BI를 알고 모든 노드의 superframe duration(SD)은 동일하다고 가정한다. 이러한 가정하에서 beacon을 전송하는 노드들이 Zigbee coordinator의 BI 구간 중 항상 정해진 시간에 자신의 beacon을 전송한다면 beacon의 충돌을 막을 수 있음을 보여 준다. 또한 노드들이 서로의 beacon 전송 시간을 알 수 있기 때문에 목적지 노드의 beacon을 tracking하지 않고도 목적지 노드가 active 되는 시점에 패킷을 전송하면 에너지 측면에서 좀 더 효율적인 라우팅 기반을 제공한다는 것을 보여 준다.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.2
• /
• pp.133-138
• /
• 2014

Packet arrival-delay variation, so-called 'jitter' is one of the main factors that degrade the quality of voice in mobile devices at the Voice over Internet Protocol (VoIP). To resolve this issue, a playout scheduling based on adaptive jitter estimation for enhancing VoIP speech quality is proposed. The proposed algorithm copes with the effect of transmission jitter by expanding or compressing each packet according to the predicted network delay and variations. Additionally, the active network jitter estimation incorporates rapid detection of delay spikes and reacts to changes in network conditions. The experimental results have shown that the proposed algorithm delivers high voice quality in unstable network environment.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.295-304
• /
• 2003

Active object is an Independent runnable unit which is scheduled by CPU in creation time. In this paper, we define the active object and suggest ART(Active object RunTime support systems) which controls creation and execution of the active object. ART can Provide users locational transparency and support easy method call mechanism. We also designed a communication model among active objects and implemented a communication method to make the distributed programing possible. The implementation target platform of ART is an embedded system which has only limited resources and runs in the distributed computing environment.