• Journal of Advanced Navigation Technology
• /
• v.14 no.2
• /
• pp.253-259
• /
• 2010

Wireless mesh network is flexible network like Ad hoc network or bluetooth together based on base station. But, wireless mesh network shows high packet loss and when TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. It is existent problem of TCP congestion control algorithm that TCP unfairness and congestion collapse over wireless mesh network. When TCP operation occurs with the packet loss where is not the congestion loss, it brings the performance degradation which is serious. In this paper, in order to improve efficient TCP congestion control algorithm in wireless mesh network, we proposed that TCP can adaptively regulate the congestion window in wireless link.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1055-1059
• /
• 2006

In Wireless Sensor Networks(WSNs), a sensor node broadcasts the acquisited sensing data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In his paper, we proposes a reliable congestion protocol, called HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.442-445
• /
• 2006

In Wireless Sensor Networks(WSNs), a sensor node broadcasts an acquisited data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In this paper, we proposes a reliable congestion protocol, ratted HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.381-388
• /
• 2015

TCP, which performs congestion control in congestion condition, is able to help a reliable transmission. However, packet loss can be increased because congestion window is increased by the time the packet is dropped in the process of congestion avoidance. In this paper, to solve the above problem, we propose a new congestion estimation based TCP congestion control scheme using the weighted average value of the RTT. After measuring a SRTT, which means the weighted average value of RTTs, at this point of time when a buffer overflow is occurred by an overloaded packet, the proposed scheme estimates the time, when the same SRTT is made in packet transmission, as a congestion time and then decreases the congestion window. The simulation results show that the proposed schem has a good performance in terms of packet loss rate and throughput when the packet loss due to buffer overflow is larger than that due to wireless channel.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.816-822
• /
• 2010

In this paper, we propose an algorithm to improve TCP performance over wireless links. TCP is known to have poor performance over wireless links because TCP has no mechanism to differentiate congestion loss from wireless loss, and treats all losses as congestive. We present a simple method to determine the cause of packet loss using the successive ECN. In addition, we present an algorithm to control the congestion window size based on the estimated queue state in order to guarantee the fairness and high link utilization.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.974-981
• /
• 2014

These days, use of multimedia streaming service and demand of QoS (Quality of Service) improvement have been increased because of development of network. QoS of streaming service is influenced by a jitter, delay, throughput, and loss rate. For guaranteeing these factors which are influencing QoS, the role of transport layer is very important. But existing TCP which is a typical transport layer protocol increases the size of congestion window slowly and decreases the size of a congestion window drastically. These TCP characteristic have a problem which cannot guarantee the QoS of UHD multimedia streaming service. In this paper, we propose a router buffer based congestion control method for improving the QoS of UHD streaming services. Our proposed scheme applies congestion window growth rate differentially according to a degree of congestion for preventing an excess of available bandwidth and maintaining a high bandwidth occupied. Also, our proposed scheme can control the size of congestion window according to a change of delay. After comparing with other congestion control protocols in the jitter, throughput, and loss rate, we found that our proposed scheme can offer a service which is suitable for the UDH streaming service.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.40-50
• /
• 2000

We apply a "sliding-window" Maximum Likelihood(ML) estimator to estimate traffic parameters On-Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control(CAC)scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1127-1136
• /
• 2017

In wireless networks, the packet loss due to the bit error is misinterpreted as loss due to the congestion state, so TCP congestion control occurs frequently and performance degradation occurs. This degradation also occurs in MPTCP(Multipath TCP), which is an extension protocol of original TCP. In MPTCP, the overall performance of the multipath is degraded. In this paper, we propose a congestion control scheme which measures the bandwidth on each path of MPTCP and reduces the congestion window size by the measured bandwidth when packet loss occurs, in order to solve the MPTCP performance degradation in the wireless environment. We also implemented the proposed congestion control in the Linux kernel and compared it with the original MPTCP in the testbed and real wireless networks. Experimental results show that the proposed congestion control has better throughput performance than original MPTCP congestion control in the wireless environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1599-1609
• /
• 2014

TCP does not ensure the bandwidth and delay bound required for multimedia streaming services in broadband wireless network environments. In this paper, we propose a new congestion control scheme for efficient multimedia transmission, called COLO TCP (Concave Increase Slow Start Logarithmic Increase Congestion Avoidance TCP). The COLO TCP prevents the burst packet loss by applying the concave increase algorithm in slow start phase. In the congestion avoidance phase, COLO TCP uses the logarithmic increase algorithm that quickly recovers congestion window after packet loss. To highly utilize network bandwidth and reduce packet loss ratio, COLO TCP uses additive increase algorithm and adaptive decrease algorithm. Through simulation results, we prove that our COLO TCP is more robust for random loss. It is also possible for efficient multimedia transmission.