• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.5
• /
• pp.18-29
• /
• 2007

The main objective of this paper is to propose a new stability analysis method for a networked control system with multiple packet transmission. The new scheduling method that can guarantee the maximum time delay and discrete switch state equation model which represent a network data loss is proposed. The equivalent model of a MIMO(multi-input multi-output) networked control system is derived from a state space model of linear time invariant interconnected systems in the form of asynchronous dynamical system. Using this model, this paper presents new stability theorems that can determine stability of the networked control system with regard to time delay, data loss, and the number of transmission packets. Simulation results verify the effectiveness of proposed stability analysis method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.237-244
• /
• 2009

The congestion in wireless sensor network increases the ratio of data loss and causes the delay of data. The existing congestion protocols for wireless sensor network reduces the amount of transmission by control the sampling frequency of the sensor nodes related to the congestion when the congestion has occurred and was detected. However, the control method of sampling frequency is not applicable on the situation which is sensitive to the temporal data loss. In the paper, we propose a new congestion control, ACT - Adaptive Congestion conTrol. The ACT monitors the network traffic with the queue usage and detects the congestion based on the multi level threshold of queue usage. Given network congestion, the ACT increases the efficiency of network by adaptive flow control method which adjusts the frequency of packet transmission and guarantees the fairness of packet transmission between nodes. Furthermore, ACT increases the quality of data by using the variable compression method. Through experiment, we show that ACT increases the network efficiency and guarantees the fairness to sensor nodes compared with existing method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.328-330
• /
• 2002

Ad hoc 네트워크는 유선기반구조 없이 지리적으로 분산된 노드들이 동적으로 연결되어 자치적인 네트워크를 구성한다. 라우팅 프로토콜은 무선자원을 효율적으로 사용하기 위해서 최소의 오버 헤드를 갖도록 수행되어야 한다. 위치기반 라우팅 프로토콜은 위치정보를 이용하여 노드들간의 경로를 설정하고 유지할 필요 없이 직접 데이터 패킷을 전송하도록 지원하는 라우팅 프로토콜이다. 본 논문에서는 위치기반 라우팅 프로토콜인 GPF(Greedy Packet Forwarding)기법을 이용하여 패킷을 전송하는 도중 패킷을 전송할 수 없는 영역에 도착했을 때, 지역적인 flooding을 이용하여 이를 복구하는 방법론을 제시한다. 이 복구방법에서 전반적인 패킷 전송은 GPF기법을 적용하며, GPF기법을 적용할 수 없는 영역에서만 지역적으로 flooding 알고리즘을 적용한다. 따라서 제어메시지를 지역에 국한시켜 사용함으로써 제한된 무선자원을 효율적으로 사용할 수 있다. 또한 노드들의 수가 증가하는 네트워크 환경에서 보다나은 확장성을 기대할 수 있다.

• Proceedings of the KAIS Fall Conference
• /
• 2008.11a
• /
• pp.304-306
• /
• 2008

CSMA/CA를 기반으로 하는 IEEE 802.11 무선랜의 MAC에서는 데이터 전송을 제어하기 위한 방법으로 DCF와 PCF를 사용한다. CSMA/CA는 스테이션간의 충돌을 줄이기 위해서 임의의 백오프 시간을 각 스테이션의 경쟁윈도우(Contention Window) 범위에서 결정한다. 스테이션은 패킷 전송 후 충돌이 발생하면, 윈도우 크기를 두 배로 증가시키며, 패킷을 성공적으로 전송하면 윈도우 크기를 최소 경쟁 윈도우(Minimum Contention Window)로 감소한다. DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 패킷지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서 최소 경쟁 윈도우의 값이 포화수율 및 패킷지연에 미치는 영향을 시뮬레이션에 의해 분석한다.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.529-532
• /
• 2012

무선 네트워크를 이용한 데이터 송수신이 일반화되면서 네트워크 트래픽에 대한 분석 및 제어에 대한 관심이 높아지고 있다. 본 논문에서는 무선 통신에서 트래픽 분석에 대한 효율성을 증진시키기 위해 패킷 캡처 기능을 이용하여 무선 통신 트래픽 모니터링 기능을 설계하였다. 특히 libpcap 라이브러리를 이용하여 Embedded Linux 시스템에서 패킷 캡처 프로그램을 구현하였다. 이를 기반으로 네트워크를 통해 송수신되는 패킷을 캡처하여 분석하고 이에 따른 트래픽 모니터링 결과를 보인다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.06a
• /
• pp.327-330
• /
• 2011

본 논문에서는 ATM network에서 트래픽 제어를 위하여 리키버켓과 EWMA로 구성된 셀 간격 제어기를 연구한다. 제안하는 알고리즘은 토큰 풀을 가진 리키버켓과 시간 윈도우를 가진 EWMA, 간격제어 버퍼로 구성된다. BONeS 시뮬레이터에서 ON/OFF 트래픽 소스 모델을 이용하여 제안한 UPC 알고리즘의 성능을 평가한 결과, 패킷화된 음성 트래픽과 고속 트래픽 소스 모두 셀 간격이 평균 비트율에 수렴하여 제어되는 것을 관찰할 수 있었다.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.160-174
• /
• 2000

Nowadays, most widely used transport protocol, TCP is tuned to perform well in traditional networks where packet losses occur mostly because of congestion. TCP performs reliable end-to-end packet transmission under the assumption of low packet error rate. However, networks with wireless links suffer from significant losses due to high error rate and handoffs. TCP responds to all losses by invoking congestion control and avoidance algorithms, resulting in inefficient use of network bandwidth and degraded end-to-end performance in that system. To solve this problem, several methods have been proposed. In this paper, we analyse and compare these methods and propose appropriate model for improving TCP performance in the network with wireless links. This model uses TCP selective acknowledgement (SACK) option between TCP ends, and also uses caching method at the base station. Our simulation results show that using TCP SACK option with base station caching significantly reduces unnecessary duplicate retransmissions and recover packet losses effectively.

• Journal of Internet of Things and Convergence
• /
• v.6 no.3
• /
• pp.1-6
• /
• 2020

This paper aims to integrate the previous models about mean object transfer latency in one framework and analyze the result through the computational experience. The analytical object transfer latency model assumes the multiple packet losses and the Internet of Things(IoT) environment including multi-hop wireless network, where fast re-transmission is not possible due to small window. The model also considers the initial congestion window size and the multiple packet loss in one congestion window. Performance evaluation shows that the lower and upper bounds of the mean object transfer latency are almost the same when both transfer object size and packet loss rate are small. However, as packet loss rate increases, the size of the initial congestion window and the round-trip time affect the upper and lower bounds of the mean object transfer latency.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.9-18
• /
• 2014

The sensors attached on/in a person are moved since human body frequency changes their activity, therefore in wireless body area networks, nodal mobility and non-line-of-sight condition will impact on performance of networks such as energy efficiency and reliable communication. We then proposed schemes which study on forwarding decisions against frequent change of topology and channel conditions to increase reliable connections and improve energy efficiency. In this work, we control the size of packets, forwarding rate based on ratio of input links and output links at each node. We also robust the network topology by extending the peer to peer IEEE 802.15.4-based. The adaptive topology from chain-based to grid-based can optimal our schemes. The simulation shows that these approaches are not only extending network lifetime to 48.2 percent but also increase around 6.08 percent the packet delivery ratio. The "hot spots" problem is also resolved with this approach.