• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.3-9
• /
• 2004

Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.193-198
• /
• 2016

For environmental monitoring and risk identification of industrial plants, several monitoring systems using Wireless Sensor Networks (WSNs) have been developed. In this paper, we propose a dynamic duty cycle adjustment mechanism for reduced latency in industrial plants. The proposed method adjusts the duty cycle among predefined risk groups depending on the urgency of sensed data values. To demonstrate its efficacy, we analyze the expected transmission latency model and then discuss the characteristics in detail. We show that the proposed dynamic duty cycle mechanism is a more effective than a periodic mechanism by analyzing the expected latency of them in industrial plants where there are various types of sensory data with different levels of reliability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1113-1118
• /
• 2012

Smart grid and intelligent transportation system draw significant interest since they are considered as one of the green technologies. These systems require a large number of sensors, actuators, and controllers. Also, machine-to-machine (M2M) communications is important because of the automatic control. The LTE-Advanced networks is preparing a set of functions that facilitate the M2M communications, and particularly the development of an efficient call admission control mechanism is critical. A method that groups MTC devices according to QoS constraints and determines the admission depending on the QoS satisfaction is limitedly applied only if the data transmission period and the maximum delay are identical. This paper proposed a call admission control that is free from such limitation and also optimizes the admission process under the certain condition of the transmission period and maximum delay. The theorems regarding the proposed method are presented with the proofs. The simulations confirms its validity and shows it is better in call admission probability than existing works.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.7A
• /
• pp.1152-1161
• /
• 2001

본 논문에서는 이동국 수신 신호의 SINR을 최대화하는 빔 성형 알고리듬을 이용하여, 폐쇄 루프 송신 빔 성형기술을 적용한 순방향 링크 CDMA 시스템에서의 안테나 수, 귀환 채널의 구조, 귀환 지연 등과 시스템 성능과의 상관관계를 연구하였다. 폐쇄 루프 전송 빔 성형에서는 이동국이 각 안테나가 겪는 채널을 추정하여 수신 SINR을 최대화시키는 가중치 벡터를 계산하고, 귀환채널을 통해 가중치 벡터의 양자화된 진폭과 위상정보를 전송한다. 컴퓨터 모의 실험 결과는 송신 안테나가 2개, 3개, 4개로 늘어남에 따라 빔 성형 이득은 단일 송신 안테나와 비교해 $10^{-5}$ BER 근방에서 4.2dB, 5.8dB, 7dB로 증가하지만 양자화 오류에 의한 성능 저하 또한 0.1dB, 0.6dB, 1.3dB로 커지는 것을 보여준다. 또한 순방향 채널의 최대 도플러 주파수가 100Hz일 때에는 귀환 채널을 통한 소신 가중치 벡터를 보다 빠르게 갱신하는 것이 가중치 벡터의 양자화 레벨의 수를 늘여주는 것보다 $10^{-5}$ BER 근방에서 0.6dB 더 좋은 성능을 보이며, 최대 도플러 주파수가 10Hz일 때에는 가중치 벡터의 갱신 속도를 늘이기 보다 양자화 레벨의 수를 늘여주어 정확한 가중치 벡터를 전송하는 편이 0.9dB의 성능 향상을 보인다. 두 전력제어 그룹 길이의 귀환지연으로 인한 성능저하는 채널의 최대 도플러 주파수가 50Hz인 경우가 채널의 최대 도플러 주파수가 100Hz인 경우보다 $10^{-5}$ BER 근방에서 0.3dB 정도 더 작다. 또한 AOS가 3$^{\circ}$인 경우가 AOS가 $10^{\circ}$인 경우보다 $10^{-5}$ BER 근방에서 1.9dB 정도, 주파수 선택적 페이딩 채널이 주파수 비선택적 페이딩 채널보다 $10^{-5}$ BER 근방에서 1dB 정도 귀환 지연으로 인한 성능의 저하가 작다.

• Journal of Navigation and Port Research
• /
• v.29 no.6 s.102
• /
• pp.573-581
• /
• 2005

The outbound containers in a container terminal are classified into a few groups by their weights and stacked separately in a yard for easy and efficient handling. In order to maintain the balance of a ship during loading, containers of heavier weight groups should be fetched out of a yard and loaded onto the ship before those of lighter weight groups. However, the weight information used to determine the weight group is usually imprecise. Therefore stacks will actually be filled with mixture of different weight groups and rehandlings are unavoidable during loading operation. This paper presents a method for estimating the number of rehandlings caused by imprecise information and a scheme for generating a simple but efficient slot assignment rule. Experiments have shown that a rule generated by the proposed method can reduce the number of rehandlings by about $20\%$ compared to the traditional slot assignment method which stacks only the containers of the same weight group in a single stack.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.391-398
• /
• 2005

The outbound containers in a container terminal are classified into a few groups by their weights and stocked separately in a yard for easy and efficient handling. In order to maintain the balance of a ship during loading, containers of heavier weight groups should be fetched out of a yard and loaded onto the ship before those of lighter weight groups. However, the weight information used to determine the weight group is usually imprecise. Therefore stacks will actually be filled with mixture of different weight groups and rehandlings are unavoidable during loading operation. This paper presents a method for estimating the number of rehandlings caused by imprecise information and a scheme for generating a simple but efficient slot assignment rule. Experiments have shown that a rule generated by the proposed method can reduce the number of rehandlings by about 20%compared to the traditional slot assignment method which stacks only the containers of the same weight group in a single stack.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.10
• /
• pp.373-380
• /
• 2022

This paper presents a deep learning based group synchronization that supports networked immersive interactions between remote users. The goal of group synchronization is to enable all participants to synchronously interact with others for increasing user presence Most previous methods focus on NTP-based clock synchronization to enhance time accuracy. Moving average filters are used to control media playout time on the synchronization server. As an example, the exponentially weighted moving average(EWMA) would be able to track and estimate accurate playout time if the changes in input data are not significant. However it needs more time to be stable for any given change over time due to codec and system loads or fluctuations in network status. To tackle this problem, this work proposes the Deep Group Synchronization(DeepGroupSync), a group synchronization based on deep learning that models important features from the data. This model consists of two Gated Recurrent Unit(GRU) layers and one fully-connected layer, which predicts an optimal playout time by utilizing the sequential playout delays. The experiments are conducted with an existing method that uses the EWMA and the proposed method that uses the DeepGroupSync. The results show that the proposed method are more robust against unpredictable or rapid network condition changes than the existing method.

• Clinical and Experimental Reproductive Medicine
• /
• v.37 no.4
• /
• pp.329-338
• /
• 2010

Objective: This study was carried out to know whether cryopreservation of sibling 2PN zygotes could increase the cumulative delivery rates in the patients who had less than 10 fertilized zygotes. Methods: A retrospective analysis was performed in 138 in vitro fertilization-embryo transfer (IVF-ET) cycles with less than 10 fertilized zygotes during January 2003 to December 2007 in Cheil General Hospital. These cycles were divided into two groups. In Group I (n=86), all fertilized embryos were cultured to transfer on day 3 without cryopreserved embryos at the 2PN stage. In Group II (n=52), among fertilized zygotes, some sibling zygotes were frozen at the 2PN stage, the remainder were cultured to transfer. Clinical outcomes in fresh ET cycles and cumulative ongoing pregnancy rates after subsequent frozen-thawed (FT)-ET cycles were compared. Results: There were no significant differences in female mean age, number of retrieved oocytes and total fertilized embryos between two groups, Number of cultured embryos was significantly lower in Group II ($5.2{\pm}0.5$) than in Group I ($8.4{\pm}0.7$) (p<0.01). Also, number of transferred embryos was significantly lower in Group II ($3.3{\pm}0.6$) compared with Group I ($3.6{\pm}0.6$) (p<0.01). ${\beta}$-hCG positive rates and delivery rates (51.2 vs. 46.2 % and 41.9 vs. 34.6 %, respectively) after fresh ET were slightly higher in Group I than in Group II. However, the differences were not statistically significant. Also, the cumulative delivery rates after subsequent FT-ET cycles were not significantly different between Group I (48.8%) and Group II (50.0%). Conclusion: This study showed that cryopreservation of sibling 2PN zygotes from patients who had less than 10 zygotes in the fresh ET cycles did not increase cumulative delivery outcomes. But, it could provide an alternative choice for patients due to offering more chance for embryo transfers if pregnancy was failed in fresh IVF-ET cycles.