• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.59-60
• /
• 2006

TCP applied to the wireless-wired integrated network is the one that was applied to the existing wired network. In the wireless-wired integrated network, both wireless and congestion loss can occur. When wireless packet losses occur, the congestion control of TCP causes performance degradation by reducing its transmission rate. In this paper, we propose the algorithm to distinguish the wireless packet loss from congestion packet loss using MIB of the 802.11 MAC which has been generally used recently in wireless links.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.10 no.6
• /
• pp.381-390
• /
• 2015

The efficient design of a transport protocol contributes to energy conservation as well as performance improvement in wireless sensor networks (WSNs). In this paper, a node-density-aware transport protocol (NDTP) for intra-cluster transmissions in WSNs for monitoring physical attributes is proposed, which takes node density into account to mitigate congestion in intra-cluster transmissions. In the proposed NDTP, the maximum active time and queue length of cluster heads are restricted to reduce energy consumption. This is mainly because cluster heads do more works and consume more energy than normal sensor nodes. According to the performance evaluation results, the proposed NDTP outperforms the conventional protocol remarkably in terms of network lifetime, congestion frequency, and packet error rate.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2451-2459
• /
• 1999

The improvement of network systems makes the world be near at hand. Due to the technological progress, we can send or receive a large amount of data in a short time over computer networks. However, the data overflow on the network can cause severe congestion. So we need to control it more efficiently. One of the control methods is a slow start. In this paper, we proposed a amended slow start for network congestion and tested its efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.767-774
• /
• 2008

With the development of ubiquitous sensor networks, the need for communication among mobile nodes has been increased. When the existing TCP is applied to MANET, link failure, route change and network partition make TCP recognize congestion. As a result, TCP shows a poor performance. In this paper, using cross-layer design a new TCP congestion control algorithm that is suitable for MANET is designed and analyzed with ns2.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2323-2340
• /
• 2012

Recent advances in cognitive radio technology have drawn immense attention to higher layer protocols above medium access control, such as transmission control protocol (TCP). Most proposals to improve the TCP performance in cognitive radio (CR) networks have assumed that either all nodes are in CR networks or the TCP sender side is in CR links. In those proposals, lower layer information such as the CR link status could be easily exploited to adjust the congestion window and improve throughput. In this paper, we consider a TCP network in which the TCP sender is located remotely over the Internet while the TCP receiver is connected by a CR link. This topology is more realistic than the earlier proposals, but the lower layer information cannot be exploited. Under this assumption, we propose an enhanced TCP protocol for CR networks called TCP for cognitive radio (TCP-CR) to improve the existing TCP by (1) detection of primary user (PU) interference by a remote sender without support from lower layers, (2) delayed congestion control (DCC) based on PU detection when the retransmission timeout (RTO) expires, and (3) exploitation of two separate scales of the congestion window adapted for PU activity. Performance evaluation demonstrated that the proposed TCP-CR achieves up to 255% improvement of the end-to-end throughput. Furthermore, we verified that the proposed TCP does not deteriorate the fairness of existing TCP flows and does not cause congestions.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.275-283
• /
• 2005

In this paper, we propose an overlay transmission method of end-to-end host to solve decrease in transmission rate caused by congestion in the application using multicast. In this proposed method, we've selected an overlay end-to-end host (OEH) for overcast transmission for each node, and the OEH can transmit duplicative packets. When the loss rate is more than the overcast threshold, the receivers of node in congestion are dropping from current layers and the OEH of lower nodes can request overcast transmission to OEH of non-congestion nodes for receiveing packets. In simulation results, it was known that the proposed method improves transmission rates over those of existing methods.

• Journal of Korean Society of Transportation
• /
• v.34 no.6
• /
• pp.510-522
• /
• 2016

In studies involving public transport, social welfare improvement is simply explained by the increase in public transport demand. However, the increase in the demand for public transport is mostly observed by the change in the frequency of public transport service, and in-vehicle crowding in public transport has not been an object of concern. This study examines and tries to reveal the cause of the changes of the social welfare and in-vehicle crowding of the changing public transport from imposing congestion pricing. We observe that congestion pricing increases in-vehicle crowding in public transport. This predictable phenomenon is more exacerbated in case of not operating bus-only lane. It should be noted that in-vehicle crowding is more increased in suburban, but in First-best toll system it tends to get worse less than it in other congestion pricing systems. We identify that the change of in-vehicle crowding is affected by the change of proximity of the housing to workplace, the number of commuting trips, and unpredictable distortion effect of the congestion charge.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.353-358
• /
• 2006

Unlike TCP Reno, TCP Vegas recognizes network congestion through the measuring of RTT (Round Trip Time) and decides the main congestion control parameters, such as Windows size. But, congestion avoidance scheme of Vegas poorly reflects asymmetric characteristics of packet path because TCP Vegas uses the measuring of RTT that reflects forward/backward packet transmission delay as a forward delay. The RTT can't infer the forward/backward transmission delay variation because it only measures the packet's turn around time. In this paper, We have designed and implemented a new Vegas congestion control algorithm that can distinguish forward/backward network congestion. We have modified the source codes of TCP Vegas in Linux 2.6 kernel and verified their performance.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.5
• /
• pp.40-51
• /
• 2020

Much time has passed since Korea's expressway congestion-threshold speed was revised in 2011. In the meantime, various expressway environments have changed owing to improved performance of vehicles, expanded operations of transport competition (i.e., the KTX), and increased speed limits along some expressway sections. In addition, the speed that expressway users expect to travel at is also increasing. Therefore, through a survey, this study investigates expressway users' perceptions of congestion, and reviews the adjustment of the expressway speed congestion threshold by analyzing expressway traffic flow. One result of the survey confirms that the threshold speed expressway users consider to be congestion has slightly increased. Analyzing traffic and speed data through a K-means algorithm found that the threshold speed for congestion is 60 km/h. In addition, assuming the congestion threshold speed increase from 40 km/h to 50 km/h and 60 km/h, frequently congested expressway sections are identified, determining that 50 km/h is appropriate as a congestion threshold for proper expressway mobility management.