• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.97-99
• /
• 2021

Edge caching can provide high QoE by reducing traffic in the backhaul network and reducing latency in video streaming services. But due to the limited capacity of edge cache, large amounts of content cannot be cached. In this paper, we propose an edge-fog prefix caching that reduces playback delay by caching prefixes of video content on edges and storing the rest in fog cache.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.4
• /
• pp.1-8
• /
• 2000

A defect of decrease in TCP throughput can be investigated in asymmetric environment of different uplink and downlink bandwidths. Under two-way TCP traffic, the total link utilization is decreased by the successive injection of data packets in buffer. To solve these problems, terminal ACK filtering and packet scheduling mechanisms are introduced in this paper. ACK filtering eliminates the buffered ACK packets and transmits recent ACK packets in the uplink with limited bandwidth. Packet scheduling is the method of preventing 'clustering' and 'ack compression' states which are generated in the two-way TCP traffic. The guarantee of the data traffic in reverse TCP connection and the high throughput in forward TCP connection are investigated by simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.31-37
• /
• 2016

Ranging is divided into a synchronous scheme and an asynchronous scheme according to the presence of global synchronization between nodes. In general, the asynchronous ranging is preferred over synchronous ranging because it does not require an expensive high-precision oscillator for the global synchronization. On the other hand, in a conventional asynchronous ranging scheme, the packets, which are generated by all nodes in a positioning system of a large-scale infrastructure and need to be sent for localization by reference nodes, are considerable, which cause an increase in network traffic as the number of nodes increases. The traffic congestion lowers the throughput of the network leading to a considerable loss of energy. To solve this problem, this paper proposes a ranging scheme, in which virtual transmission slots randomly and discretely selected by a plurality of nodes are used to reduce the overheads needed in synchronizing the nodes, and the ranging is performed asynchronously based on the virtual transmission slots, thereby decreasing the network traffic. In addition, a performance test proved that the proposed ranging scheme was stronger than the TWR and SDS-TWR on an error range, even though the intensity of traffic was very low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.789-798
• /
• 2016

In this paper, we propose a cache algorithm based on user's context for enterprise/urban smallcell environments. The smallcell caching method is to store mobile users' data traffic at a storage which is equipped in smallcell base station and it has an effect of reducing core networks traffic volume. In our algorithm, contrary to existing smallcell cache algorithms, the cache storage is equipped in a edge server by using a concept of the Mobile Edge Computing. In order to reflect user's characteristics, the edge server classifies users into several groups based on user's context. Also the edge server changes the storage size and the cache replacement frequency of each group to improve the cache efficiency. As the result of performance evaluation, the proposed algorithm can improve the cache hit ratio by about 11% and cache efficiency by about 5.5% compared to the existing cache algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.264-273
• /
• 2009

For IEEE 802.15.3 HR-WPAN, we propose the DABL algorithm that PNC can allocate the channel times to the DEV in super frame in order that system frame throughput is increased and the delay is decreased. In detail, the DABL algorithm allows to dynamically allocate channel time as well as to adaptively apply the modulation and coding scheme based on the link quality of the DEV. In addition, due to the facts that QoS is quite different depending on service types, we provide the DABL algorithm taking into account RT(Real Time) traffic and Non-RT traffic respectively. Finally, we show simulation results of the DABL algorithm compared to the conventional algorithm that the PNC equally allocates channel times to the DEV regardless of the link quality of the DEV.

• Journal of Digital Contents Society
• /
• v.14 no.3
• /
• pp.283-290
• /
• 2013

The current centralized mobility control protocols such as proxy mobile IPv6 (PMIPv6) are dependent on a central mobility anchor to process all control/data traffic. However, such centralized mobility control protocols have some drawbacks such as traffic concentration into the core network and serious service degradation in case of the failure of such a centralized mobility anchor, etc. In this paper, therefore, in order to alleviate these drawbacks, we propose a PMIPv6-based distributed mobility control scheme considering a user's movement locality. Performance evaluation results demonstrate that the proposed scheme has apparent potentials to alleviate serious drawbacks of S-PMIP, which is a closely-related distributed mobility control scheme, as well as PMIPv6, while reducing the total mobility control cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1490-1495
• /
• 1998

Call packing has been recognized as a routing scheme that significantly reduces the blocking probability of connection requests in a circuit-switched Clos multistage interconnection network. In this paper, for the first time, a general analytical model for the point-to-point blocking probability of the call-packing scheme applied to Clos networks is developed. By introducing a new parameter called the degree of call packing, the model can correctly estimate the blocking probability of both call-packing and random routing schemes. The model is verified by computer simulation for various size networks and traffic conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1653-1660
• /
• 2003

In this paper, we proposed an enhanced TCP congestion control algorithm using RTT with congestion window parameter cwnd to minimize the effect of TCP congestion. The proposed scheme could avoid the occurrence of frequent congestion and decrease the delay caused by the recovery time and the using amount of switch buffer. Through the simulation, we showed that the proposed scheme cm acquire higher performance than the existing scheme. There are 22.56％ improvement at the average using buffer efficiency, and packet drop rate is 0.1％ which is less than existing scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.619-622
• /
• 2001

실시간 응용 프로그램은 미디어 데이터간에 만족되어야 할 동기화 제약조건(synchronization constraints)을 가지고 있다. 이러한 제약조건은 프리젠테이션 되어야 할 미디어 데이터간의 지연시간 및 서비스 품질을 나타낸다. 미디어 데이터간의 지연시간 및 서비스 품질을 효율적으로 표현하기 위해서는 이에 적합한 새로운 동기화 기법이 요구된다. 제안된 논문은 가변적 전송 지연 시간을 흡수하면서 미디어 데이터간의 동기화를 수행하는 동적 동기화이다. 즉, 최대 지연 지터 시간을 이용한 동기화 구간 조정과 지연시간의 변화에 따른 가변적 대기 시간을 융통성 있게 처리하여 미디어 데이터간의 동기화 요구를 만족시킬 수 있는 기법이다. 본 논문은 동기화 구간 조정을 처리하기 위해 지연 지터를 적용함으로써 트래픽 증가로 인한 미디어 데이터의 손실 시간 및 지연시간의 변화로 인한 데이터 손실을 감소시켰다. 그리고 스무딩 버퍼의 대기 시간을 가변으로 처리함으로써 지연시간의 변화로 인한 불연속을 감소시켰다. 제안된 논문은 고품질 서비스의 보장을 요구하는 시스템에 적합하며 재생율 증가와 손실율 감소 등 서비스 품질을 향상시켰다.