• 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 KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.656-667
• /
• 2003

Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as MTCP and TRAMCC are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, TMRCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network condition changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly The performance of the proposed scheme is evaluated using ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra- session fairness and shows good level of responsiveness, TCP-friendliness, and scalability. In addition, we implemented the proposed scheme by integrating with GAM that is one of many-to-many reliable multicast protocols and evaluated the performance in a laboratory-wide testbed.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1288-1290
• /
• 2007

Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

• International Journal of Reliability and Applications
• /
• v.3 no.2
• /
• pp.99-112
• /
• 2002

Traffic congestion is one of critical factors in Internet applications to guarantee their QoS and provide reliable services. This paper discusses many existing congestion control algorithms and proposes a new ISDA. The algorithm is analyzed in respect of queue length, throughput and fairness. The proposed algorithm is working well with TCP and UDP traffics to offer QoS guarantee and fairness.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.230-234
• /
• 2007

Generally, huge amounts of data traffic are generated by using broadcasting method to deliver sensing data to a sink node reliably so that it makes a severe network saturation problem resulting in unreliable data transfer. In order to handle this problem, a new congestion control protocol is required for supporting reliable data transfer, minimal use of energy and network resources at the same time in wireless sensor networks. In this paper, it proposes a Protocol to guarantee both a reliable transfer in data accuracy and minimum consumption of energy waste by using Hop-by-Hop sequence number and DSbACK(Delayed and Selective ACK Buffer Condition) scheme. In addition, it proves that reliability and energy efficiency are enhanced by the proposed method with the simulation results performed on TinyOS platform which is a component based built-in OS announced by UC Berkely with the performance comparison of other existing methods.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.649-655
• /
• 2003

Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.

• 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 Advanced Navigation Technology
• /
• v.14 no.3
• /
• pp.343-350
• /
• 2010

Wireless Sensor Network is an event-driven system that a large number of micro sensor nodes are collected, giving and Wing information. Congestion can take place easily since a great number of sensor nodes are sensing data and transferring them to sink nodes when an event occurs, comparing to the existing wired network. Current internet transport protocol is TCP/UDP, however, this is not proper for wireless sensor network event-driven ESRT, STCP and CODA are being studied for reliable data transport in the wireless sensor network. Congestion are being detected local buffer and channel loading with these techniques. Broadcasting is mainly used and can avoid congestion when one happens. The way that combining local buffer and channel loading information and detecting congestion is being studied in this paper. When congestion occurs, buffering state is divided into three in order to lessen the broadcasting sending the message on congestion control to the node having frequent channel loading. Thus they have advantage of decreasing network's loading.

• Annual Conference of KIPS
• /
• 2002.11b
• /
• pp.1249-1252
• /
• 2002

클러스터와 같은 네트워크 컴퓨팅 환경에서는 신속하고 신뢰성이 보장되는 데이터 전송이 요구된다. 신뢰성 보장을 위해서 일반적으로 사용되는 전송 프로토콜은 TCP 이다. 그러나 클러스터의 하부 네트워크로서 많이 사용되는 Myrinet 은 cut-through 스위칭 방식을 기반으로 하기 때문에 네트워크 혼잡(congestion)이 발생하지 않는다. 따라서 TCP 의 혼잡 제어(congestion control) 등과 같은 루틴들은 Myrinet 상에서 불필요한 오버헤드를 발생시킨다. 본 논문은 Myrinet 네트워크에서 흐름 제어(flow control)만으로도 신뢰성을 보장할 수 있음을 보이고 TCP 보다 오버헤드가 적은 UDP에 흐름 제어를 구현한 RUM(Reliable UDP on Myrinet)을 제안한다. 성능 측정 결과, RUM 은 신뢰성을 보장함과 동시에 TCP 보다 최대 34% 더 높은 처리량(throughput)을 보이며, UDP 와 비슷한 낮은 단방향 지연시간(one-way latency)을 보장함을 알 수 있다.