• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.340-342
• /
• 2005

최근 기지국(Base Station)의 도움 없이 이동 단말기(Mobile Device) 간의 다중 무선 홉을 사용하여 송수신자 간의 데이터 전송을 가능하게 하는 Ad-hoc 통신망에 관한 연구가 활발히 진행되고 있다. Ad-hoc 통신망을 구성하는 이동 단말은 이동성을 고려하여 한정된 배터리로 동작을 하게 된다. Ad-hoc 통신망에서 이동 단말은 종단(End Host)으로만 동작하는 것이 아닌 중계 노드(Intermediate Node)로도 동작을 하기 때문에 통신상에 경로를 제공하는 중요한 역할도 한다. 하지만, 현재 인터넷 상에서 광범위하게 사용되고 있는 전송 규약인 TCP(Transmission Control Protocol)는 수동적인(Reactive)혼잡 제어(Congestion Control)방식으로 망의 혼잡으로 인한 패킷 손실 발생 이전까지 전송 윈도우의 크기를 증가 때문에 반복적인 혼잡과 그로 인한 패킷 손실로 인해 불필요한 재전송을 반복하게 된다. 이와 같이 기존 TCP는 무선 통신망에서 동작하는 이동 단말의 한정된 배터리 전원을 고려하지 않고 동작하기 때문에 이동 단말의 에너지를 불필요하게 낭비하는 문제를 가지게 된다. 본 논문은 Ad-hoc 망에서 이동 단말의 에너지 효율을 개선하기 위해 불필요한 재전송 방지 및 망 상태에 따라 전송률을 적절하게 조절하는 TCP의 새로운 혼잡 제어 기법을 제시하였다. 또한 ns-2 시뮬레이터를 이용한 실험을 통해 이동 단말의 에너지 효율이 제안된 혼잡 제어 기법에 의해 향상되었음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.787-793
• /
• 2015

In order to support reliable medium access control (MAC) layer multicast services in Broadband Wireless Access (BWA) networks, we here propose spreading codes (Cumulative ACK (CA) code and ARQ Feedback Request (AFR) code) based reliable multicast feedback scheme. The status indications based on the automatic repeat request (ARQ) mechanism are needed in some multicast services. In accordance with various wireless channel environments, we demonstrate the performance excellency of our proposed scheme with respect to required uplink resources compared with the original feedback scheme based on unicast ARQ feedback messages. In addition, we analyze packet error rate (PER) against the various wireless channel environments.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.143-155
• /
• 2006

In this paper, we suggest a network game system that can support video game based on multi-platform for multi-user video game, Latency occurring from the load fluctuation in realtime network game is overcomed by using an initial delay buffering scheme on client, when a real-fire game is played, and shows that stable play for a game is achieved as the result of the scheme. Also, We suggest a retransmission algorithm based on the history of game commands, and this Algorithm supplement shortcomings for packet loss and pocket error on UDP communication.

• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.72-79
• /
• 2016

In this paper, we propose a Service-adaptive Tactical Data Transmission Protocol (STTS) based on Satellite Communications with narrow bandwidth. STTS is designed to provide additional field for scalability and scheduler for reliability of transport stream protocol based on digital broadcasting standard, DVB-S and DVB-S2. It is also verified the effects of lost data packets with narrow bandwidth through the simulator by traffic model and re-transmission of critical data, and checked the design considerations based on STTS system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.95-104
• /
• 2010

In wireless communication system, a variety of retransmission algorithms are used in order to improve the quality of service of users. But the system may be inefficient because retransmission algorithms operate independently with other layers. Also, the quality of service can be degraded due to the unnecessary retransmission of packets. To solve these problems, the study on the cross-layer retransmission schemes have been widely performed. However, in order to apply cross-layer retransmission schemes to wireless communication system, whether the performance of cross-layer retransmission schemes meets QoS requirements of each service class has to be verified. Thus, this paper proposes the mathematical model for analyzing the performance of the cross-layer retransmission schemes and derives both the suitable retransmission scheme and the optimal retransmission parameter on each service class. The proposed mathematical model selects the MCS level based on channel state information and The performance analysis is comparatively easy in case that HARQ, ARQ, and AMC schemes are combined. The proposed mathematical model also enables the analysis of the packet transmission delay. To utilize the analytical model, this paper derives the suitable retransmission scheme and the optimal retransmission parameter for delay sensitive services in WiMAX system. Also, the proposed analytical model can be used to analyze the performance of wireless communication system such as LTE and WLAN.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.165-174
• /
• 2006

In this paper, we propose a new contention window control algorithm to increase TCP performance in wireless multi-hop networks. The new contention window control algorithm is suggested to reduce the hidden and exposed terminal problems of wireless multi-hop networks. Most of packet drops in wireless multi-hop networks results from hidden and exposed terminal problems, not from collisions. However, in normal DCF algorithm a failed user increases its contention window exponentially, thus it reduces the success probability of fined nodes. This phenomenon causes burst data transmissions in a particular node that already was successful in packet transmission, because the success probability increases due to short contention window. However, other nodes that fail to transmit packet data until maximum retransmission attempts try to set up new routing path configuration in network layer, which cause TCP performance degradation and restrain seamless data transmission. To solve these problems, the proposed algorithm increases the number of back-of retransmissions to increase the success probability of MAC transmission, and fixes the contention window at a predetermined value. By using ns-2 simulation for the chain and grid topology, we show that the proposed algorithm enhances the TCP performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.148-154
• /
• 1999

TCP has improved by many papers which suggest the new algorithms and modify the previous algorithms. This paper compares Tahoe, Reno, New-Reno, Vegas, and SACK. The first version is Tahoe and is globally used. Reno has optimal performance during occurring one packet loss within a window of data, but can suffer from performance when multiple packets are dropped from a window of data. New-Reno avoids some of the performance problems of Reno TCP when multiple packets are dropped from a window of data. but is occurring the problem of the necessary retransmission. SACK resolves the all above problems and is used in bandwidth delay product environment. Vegas uses network bandwidth more efficiently and is a new implementation of TCP that achieves between 40 and 70 better throughput, with one-fifth to one-half the losses, as compared to the implementation of Reno TCP.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.893-896
• /
• 2008

기존의 무선 센서 네트워크에서는 센서 노드는 하나의 전방향성 안테나와 하나의 무선 채널을 공유하여 데이터를 전송하므로 과다한 채널 경쟁과 센서 노드간의 데이터 충돌로 데이터 재전송이 자주 발생하여 불필요한 에너지의 소비가 많고, 소스 노드와 목적지 노드의 데이터 전송시 RTS(Request To Send)와 CTS(Clear To Send) 패킷을 사용하여 전파 전송 범위 전체에 대해 채널 예약을 하므로 공간의 활용도가 낮은 편이다. 본 논문에서는 전방향성 안테나의 문제점 및 단점을 보완하기 위한 방법으로 지향성 안테나를 사용하기 위한 SRDMAC(Spatial Reuse Directional MAC) 프로토콜을 제안한다. 제안된 프로토콜은 센서 노드 간의 데이터 전송시 충돌을 방지하여 데이터 재전송에 소모되는 에너지와 목적지 노드가 위치한 영역 일부분에만 데이터를 전송함으로 에너지 소모량을 줄일 수 있으며, 목적지 노드가 위치한 영역을 제외한 다른 영역의 이웃 노드와의 데이터 전송이 가능하므로 공간 재 사용율을 최대한 증가시킬 수 있다.