• Journal of the Korea Society of Computer and Information
• /
• v.27 no.10
• /
• pp.105-113
• /
• 2022

In this paper, we present and analyze 5G system and IEEE time-sensitive networking(TSN) and propose a novel mobility management scheme for time sensitive communications in 5G-TSN to support ultra-low latency networks. Time-sensitive networking(TSN) has a promising future in the Industrial Automation and Industrial Internet of Things(IIoT), as a key technology that is able to provide low-latency, high-reliable and deterministic communications over the Ethernet. When a TSN capable UE moves the TSN service coverage from the non-TSN service coverage, the UE cannot get the TSN service promptly because the related mobility management is not performed appropriately. For the mobility situation with the TSN service coverage, the proposed scheme reports TSN capability to the network and triggers the initial registration in order to be provided the TSN service immediately and ultra-low latency communications compared to existing schemes in 5G mobile networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1190-1200
• /
• 1993

In this work, the performance of both delay sensitive traffics and loss sensitive traffics of the output buffered ATM switch with priority control mechanisms has been evaluated. We choose the partial buffer sharing mechanism as the loss priority control mechanism and the HOL(Head Of Line) priority control mechanism as the time priority control mechanism. We model loss sensitive traffics with Poisson process and delay sensitive traffics with MMPP. With loss priority control, it is confirmed that loss probability of loss sensitive traffice decreases when the loss priority control mechanism is chosen. With time priority control, it has also been confirmed that mean cell delay of delay sensitive traffics decreases when the HOL priority control mechanism is used. From this analysis, It has been confirmed that the requirements of QOS for both loss sensitive and delay sensitive traffics can be satisfied in the ATM switch by combining both the loss priority control mechanism and the HOL priority control mechanism.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.587-594
• /
• 2012

IEEE 802.15.6 standard technology is proposed for low-power wireless communication in, on and around body, where vital signs such as pulse, blood pressure, ECG, and EEG signals are transmitted as a type of data packet. Especially, these vital signs should be delivered in real time, so that the latency from slave node to hub node can be one of the pivotal performance requirements. However, in the case of IEEE 802.15.6 technology data retransmission caused by transmission failure can be done in the next superframe. In order to overcome this limitation, we propose an adaptive polling algorithm for IEEE 802.15.6 technology. The proposing algorithm makes the hub to look for an appropriate time period in order to make data retransmission within the superframe. Through the performance evaluation, the proposing algorithm achieves a 61% and a 73% latency reduction compared to those of IEEE 802.15.6 technology in the environment of 70% traffic offered load with 10ms and 100ms superframe period. In addition, the proposing algorithm prevents bursty traffic transmission condition caused by mixing retransmission traffic with the traffic reserved for transmission. Through the proposing adaptive polling algorithm, it will be possible to transmit time-sensitive vital signs without severe traffic delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1910-1916
• /
• 1999

This paper suggested to solve ATM switch performance and service rate which was input buffer managed scheme in ATM network with burst traffic characteristics, For this purpose, ATM multiplexer is prepared before sending for handling burst random input traffic to multiplex and then sort based on cell inter-arrival time and cell processing due time which had been marked after that. The server looks for cell header with the most shortest due time and sends it, thus it is satisfied that real time traffic for instance CBR and rt-VBR was guaranteed cell processing time to send fast than non real time traffic. For analysis of ATM switch performance with cell processing due time and priority, each output port has divided into four different virtual buffer and each buffer has assigned different cell inter-arrival time and processing due time according to ATM Forum for example CBT/rt-VBR, nrt-VBR, ABR and UBR and showed it’s optimal service parameters then analyzed service rate behaviors according to each traffic characteristics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.145-148
• /
• 2005

본 논문에서는 동작 검출 기법을 소형 화상 카메라에 적용하여 감시 영상을 검출했으며, 감시영상은 모바일 환경에서 실시간 모니터링을 통해 유무선 연동의 감시 시스템을 구축하였다. 기존에 사용되던 화소 값을 이용하여 동작 검출을 수행하는 방법은 배경 영상을 저장할 메모리가 필요하고 화소단위의 데이터 처리로 인하여 수행 시간의 증가와 노이즈에 민감한 단점을 감수해야만 한다. 이러한 단점을 해결하기 위해 본 연구에서는 블록 단위의 특징 값을 비교하는 기법을 사용하였다. 검출된 영상을 모바일 클라이언트로 전송하기 위해서 WAP 풀 기반 영상전송 방법을 사용하여 WIPI SDK로 구현함으로써 감시 영상의 변환과 전송을 실시간으로 구현할 수 있었다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.91-96
• /
• 2019

For a wireless sensor network in general, efficient routing decision is important because wireless connections are not stable, sensitive to external interference, and topology changes dynamically. RPL standard of IETF is not flexible to various environmental changes and causes packet loss and delay due to topological imbalance. Sending packets through multipath can partially remedy this problem. The multipath routing, however, can introduce significant delay overhead by allocating unnecessary timeslots. This paper proposes an RPL using multipath adaptively according to network conditions. We show by simulations that the proposed algorithm is more efficient than the basic RPL and the multipath RPL.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.737-748
• /
• 2005

Two flexible admission control schemes for integrated voice and stream-type data services are proposed in DS-CDMA systems. Most Previous studies on admission control have focused on integration of short, bursty Packet-type data services and conventional voice services. However, stream-type data services with a relatively long service holding time are expected to be a considerable portion of data traffic in future generation cellular systems. Scheme I is a basic scheme that accommodates both voice and data services with full bandwidth. However, voice services are given priority over data services using the duration difference between the holding times for these services. Scheme ll uses a different method to efficiently give priority to voice services over stream-type data services. An additional interference margin for voice services is provided by suppressing interference from stream-type data services according to voice access requests and a varying interference status. Performance of the two schemes is evaluated by developing Markovian models. Numerical results show that the voice capacity is highly sensitive to the service holding time of data services while the performance measures of data services are not highly sensitive. Scheme H is a significant improvement over Scheme I for accommodating voice and stream-type data services

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.77-82
• /
• 2022

The effect of indoor air pollution on the human body is greater and more dangerous than outdoor air pollution. In general, a person stays indoors for a long time, and in a closed room, pollutants are continuously accumulated and the polluted air is better delivered to the lungs. Especially in the case of young children, it is very sensitive to indoor air and it is fatal. In addition, methods to reduce indoor air pollution, which cannot be ventilated with more frequent indoor activities and continuously increasing external fine dust due to Covid 19, are becoming more important. In order to improve the problems of the existing autonomous driving air purifying robot, this paper divided the map and Upper Confidence bounds applied to Trees(UCT) based algorithm to solve the problem of the autonomous driving robot not sterilizing a specific area or staying in one space continuously, and the problem of children who are vulnerable to indoor air pollution. We propose a space-adaptive autonomous driving air purifying robot for a green smart school that can be improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1252-1260
• /
• 1999

The HFC network has a architecture of a star topology in fiber optic trunks, and tree and branch topology is used in the part of coaxial cable. It is well known that the HFC upstream channel is noisy. Ingress, common mode distortion and impulse noise exist in the upstream channel. In order to provide Quality of Service(QoS) to users with real-time data such as voice, video and interactive services, the evolving IEEE 802.14 standard for HFC networks must include an effective priority scheme. The scheme separates and resolves collisions between stations in a priority order. It is important to simulate protocols under a practical environment. The proposed algorithm in this paper is simulated with the assumption that the collision detector made certain mistake due to noises. Simulation results show that the proposed algorithm is more efficient than existing tree-based algorithm under practical environment.