• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.360-363
• /
• 2007

In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval hop-by-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports traffic congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1190-1194
• /
• 2007

In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval herby-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports franc congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1811-1818
• /
• 2009

This paper is about the research to maintain and enhance the flow of data of the wireless traffic control. Various types of burst traffic that were found at TCP window flow control have been removed or mitigated using the two-way traffic control. Currently, TCP ACK Compression problem appears during the transmission of the wireless communication control channel because the queues are mostly located at the end system. Therefore, in this paper, the periodic bursty characterist of the source IP queue wilt be analyzed to predict the maximum value of queues. And then the prediction tool will be applied to wireless communication traffic control to handle symmetric traffic as to increase the throughput and improve the performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.923-930
• /
• 2001

In this paper, in order to improve the performance of TCP short traffic services in wireless Internet environments, the Split-ACKs(SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless links results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end performance degradation of TCP. In this paper, to alleviate the TCP performance, the SPACK method, split acknowledgement packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analyzed and shows better performance than traditional TCP protocol.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.275-284
• /
• 2010

The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.435-445
• /
• 2007

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem: it cannot perform local retransmission efficiently under the bursty-error prone wireless link. To solve this problem, SACK-Aware-Snoop and SNACK mechanism have been proposed. These approaches improve the performance by using SACK option field between base station and mobile host. However in the wireless channel with high packet loss rate, SACK-Aware-Snoop and SNACK mechanism do not work well because of two reason: (a) end-to-end performance is degraded because duplicate ACKs themself can be lost in the presence of bursty error, (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily because of SACK option field in the wireless link. In this paper, we propose a new local retransmission scheme based on Cross-layer approach, called Cross-layer Snoop(C-Snoop) protocol, to solve the limitation of previous localized link layer schemes. C-Snoop protocol includes caching lost TCP data and performing local retransmission based on a few policies dealing with MAC-layer's timeout and local retransmission timeout. From the simulation result, we could see more improved TCP throughput and energy efficiency than previous mechanisms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1345-1348
• /
• 2002

기존의 TCP/IP 네트워크 상에서 혼잡을 제어하는 일반적인 방법은 end-to-end 피드백 방식이다. 혼잡이 발생했는지의 여부는 수신측의 ACK 신호로 예측할 수밖에 없으므로 RTT(round trip time)가 길어질 경우 혼잡처리 시간이 길어지게 된다. Active Network 기술을 이용한 ACC(Active Congestion Control)의 경우 혼잡이 발생한 라우터에서 전송자에게 직접적으로 정보를 전송하기 때문에 보다 빠른 혼잡처리가 가능하다. 비록 코어 라우터에서 패킷을 누락시키는 방법에 있어 상태정보를 필요로 하는 단점이 있지만 모의 실험 결과 향상된 처리량을 보여주었다. 혼잡처리에 있어 새로운 처리 방식은 AQM(Active Queue Management)이다. 이 방식은 RED 를 기본 모델로 변형된 것이 대부분이며 RED 가 갖는 단점을 개선하고 혼잡처리와 공평성(fairness)을 향상 시키는데 목적이 있다. 본 논문에서는 ACC 의 피드백 메커니즘과 AQM 의 융통성 있는 큐 관리 기법을 이용하여 보다 향상된 혼잡제어 기법을 보이겠다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.941-950
• /
• 2011

In this paper, we analysis the end-to-end performance of the incremental cooperative communication with relay selection. In the conventional cooperative scheme, the source(S) broadcasts the signal to the relay(R) and the destination(D) at 1st phase, and the R forwards the signal to the D at 2nd phase. Although this scheme can improve performance and provide diversity gain, it suffers from decreasing spectrum efficiency. In order to overcome this problem, the incremental cooperative model can be used. In this paper, we study two incremental cooperative method : the first uses ARQ with threshold SNR and the second uses HARQ with channel coding. we also evaluated performance of the incremental cooperative communication based on the R arrangement by using both methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.975-983
• /
• 2011

In this paper, we investigate how the IEEE 802.16 based wireless system can adopt the network coding. To avoid the problem of overhearing, we focus on the bidirectional traffic, where each end node exchanges network coded data over a relay node. The bidirectional traffic is usually observed in Internet, where TCP makes congestion control and error recovery based on the acknowledgement from the opposite direction. Thus, enhancing the spectral efficiency of wireless Internet through the network coding is expected. Our simulation with realistic radio characteristics and TCP-like traffic shows that the network coding improves the throughput by an average of 36 percent compared to the simple relay case.