• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.37-46
• /
• 2008

Launch control system controls the sequence for launching missile in weapon systems. This system have to generate the engagement plan, input information and launch the missile in timeliness requirement. Such a system may fail to operate correctly either due to errors in hardware and software or due to violation of timing constraints. We presented fault-tolerant ethernet for embedded real-time system like launch control system. This approach is designed to handle network faults using dual commercial-off-the-shelf(COTS) network devices. To support fault-tolerant ethernet each node is composed dual channel ethernet and designed the communication middleware for network fault detect and recovery. Especially for time-critical system, the middleware is being developed to achieve that no point of network failure shall take down or cause loss of communication to network nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.49-59
• /
• 2014

Recently, wireless sensor networks(WSNs) are widely used for intrusion detection and ecology, environment, atmosphere, industry, traffic, fire monitoring. In this paper, an energy efficient clustering algorithm is proposed. The proposed algorithm forms clusters uniformly by selecting cluster head that optimally located based on receiving power. Besides, proposed algorithm can induce uniform energy consumption regardless of location of nodes by multi-hop transmission and MST formation with limited maximum depth. Through the above, proposed algorithm elongates network life time, reduces energy consumption of nodes and induces fair energy consumption compared to conventional LEACH and HEED. The results of simulation show that the proposed clustering algorithm elongates network life time through fair energy consumption.

• Journal of the Korean Society for Railway
• /
• v.11 no.4
• /
• pp.364-370
• /
• 2008

In this paper, we proposed new sensor network architecture with autonomous robots based on beacon mode and implemented real time monitoring system in real test-bed environment. The proposed scheme offers beacon based real-time scheduling for reliable association process with parent nodes and dynamically assigns network address by using NAA (Next Address Assignment) mechanism. For the large scale multi-sensor processing, our real-time monitoring system accomplished the intelligent database processing, which can generate not only the alert messages to the civilians but also process various sensing data such as fire, air, temperature and etc. Moreover, we also developed mobile robot which can support network mobility. Though the performance evaluation by using real test-bed system, we illustrate that our proposed system demonstrates promising performance for emergence monitoring systems.

• Journal of Advanced Navigation Technology
• /
• v.24 no.5
• /
• pp.438-443
• /
• 2020

To transfer files between nodes on network based on Ethernet, file transfer protocol (FTP) on TCP/IP and trivial file transfer protocol (TFTP) on UDP/IP are mostly used. Due to the lack of resources (processor, memory and so on) in the embedded system where we generally use for simple works with small firmware like ones; many of the systems implement only UDP/IP for their network stacks. Thus, TFTP is greatly to be preferred. For examples, environmental sensor devices for sensor networks, Boot Loader for general embedded device and preboot execution environment (PXE) boot for PC provide the TFTP. The logic of TFTP is simple for file transmission but, there is Stop-And-Wait problem during the process which occurs long blocking time. In this paper, we propose an algorithm which called QuTFTP(Quick UDP Trivial File Transfer Protocol) to reduce the length of the blocking time and to be compatible with the legacy TFTP.

• Journal of the Korean Professional Engineers Association
• /
• v.28 no.3
• /
• pp.121-134
• /
• 1995

To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit con-trol devices located In common manufacturing zone and operated by connecting them. The network management system, which controls and supervises the network resources in the communication network, is the function that is necessarily required in this net-work. For the stability in this network, this paper measures the variation of data packet length and node number and analyzes the variated value of the token rotation time and waiting time for the network operation. On the evalution of the performance, the data packet length varies from 10 bytes to 100 bytes in the operation of the group manage-ment network, the variation of the token rotation time and waiting time is less than 10 msec. When the variation of the data packet lenhth is less than 50 bytes, differences in token rotation time or waiting time is unnoticable. Since the waiting time in this case is less than 10 msec, response time Is fast enough.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.11-20
• /
• 1998

정적 통행배분모형은 도로 건설 등 공급부문에의 적용은 가능하나 통행량 및 혼잡의 시간적 공간적 변화를 고려하지 못하여 수요관리에서는 교통량 및 비용에 대한 관측치와 모형의 결과치가 상이한 문제가 있다. 이에 동적배분모형의 다양한 접근방법이 시도되고 있는데 그 중 Simulation기법을 개발하고자 하였다. 모형은 개별차량의 시공간상 움직임을 포현하고자 절대시간이 가장 이른 차량순으로 시뮬레이션을 함으로써 선입선출(FIFO)을 가능하게 하였다. 각 차량별 지체시간의 계산은 대기행렬 이론을 기초로 한 누적곡선법을 적용하여 도출하였다. 개별차량 Simulation은 시간축으로 확장된 연속류 Network상에서 각 차량의 도착 및 출발할 노드와 시간대를 결정하면 모든 지점에서 누적도착, 출발곡선을 그릴 수 있으며 이를 통해 도로구간에 있어 시간대별 통행시간, 밀도, 속도 등을 파악할 수 있다. 또한 합류부의 용량와 와해현상과 분류부의 용량변화현상 제약 및 Queue길이 제약이 이루어지도록 하였다. 개발된 모형의 검증은 영동대교 북단 강변도로 진출입부 자료를 실측하여 사용하였다. 모형은 합류부 용량와해의 적용 전과 후의 결과를 각각 실측치와 비교하였다. 용량와해현상을 적용한 모형에서 MAPE 10%미만의 우수한 예측력을 보였다. 이는 누적곡선을 이용한 Simulation모형이 현실에 가까움을 의미하는 것이며, 합류부 용량와해현상의 관계식을 보다 정교하게 도출하고 분류부에도 이를 적용한다면 모형의 예측력은 더욱 향상될 것으로 보인다.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.31-40
• /
• 1998

본 연구의 목적은 기존의 Cell Transmission(1994, Daganzo) 교통류 이론을 기반으로 동적통행배정 모형을 개발하는 것이다. 이 모형은 동적 O-D 발생모듈, HOV 차선모듈, 분류부 분할모델, 링크비용함수 모듈, 최단경로 탐색 모듈등으로 구성된다. 이 모델에서 적용하는 교통류 모델은 각 링크를 동일한 특성을 가지는 셀로 구분하여 셀내의 진입시간과 진출시간을 계산하여 링크비용을 계산하는데 이것은 비용의 과대·과소 추정을 피할 수 있으며 교통지체 현상을 현실적으로 표현해 줄 수 있는 장점이 있다. 또한 HOV 차선 모듈에 의해 수단별 교통류 진행 및 비용고려가 가능하며 HOV 차선의 평가 및 분석이 가능하다. 기존의 동적통행배정모형은 매 시간대별 출발지에서 균형상태를 추구하는 통행배정기법을 사용하고 있지만 이 모델은 분류되는 노드를 가상의 출발점이라고 가정하여 각 시간대별로 최단경로를 탐색하여 균형상태를 추구해나가는 기법을 적용하고 있다. 각 셀별 차량을 목적지별, 차종별, 대기시간별로 추적하여 진행시키며 분류부에서는 최단경로를 탐색하여 배분된다. 또한 진행하고자 하는 셀의 용량과 현재 셀의 밀도를 고려함으로서 용량제약 하에서의 동적통행배정모형을 적용하고 있다. 이 모형은 고속로의 합류부 및 분류부의 교통특성을 세밀히 분석할 수 있으며, TCS 및 램프미터링과 접목하여 고속도로 운영에 이용될 수 있으며, 고속도로 중·장기적인 계획에 이용될 수 있다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.13-16
• /
• 2018

본 논문에서는 무선 센서 네트워크 환경에서 신뢰성 있는 데이터 패킷 전송을 위한 효율적인 스케줄링 기법을 제안한다. 무선 네트워크는 수천 개의 센서노드, 게이트웨이, 그리고 소프트웨어로 구성된다. 큐러닝(Q-learning)을 기반으로 한 스케줄링 기법은 동적인 무선센서 네트워크 환경의 실시간 및 비실시간적인 데이터에 대한 사전 지식을 필요로 하지 않는다. 따라서 최종 결과 값을 도출하기 전에 스케줄링 정책을 구할 수 있다. 제안하는 기법은 데이터 패킷의 종류, 처리시간, 그리고 대기시간을 고려한 기법으로 신뢰성 있는 데이터 패킷의 전송을 보장하고, 전체 데이터 패킷에 공정성을 부여한다. 본 논문에서는 시뮬레이션을 통해 기존의 FIFO 알고리즘과 비교하여 제안하는 스케줄링 기법이 전체 데이터 패킷에 대한 공정성 및 신뢰성 측면에서 우수함을 증명하였다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.6
• /
• pp.74-83
• /
• 2011

The high-pass transportation information system directly collects section information by using probe cars and therefore can offer more reliable information to drivers. However, because the running condition and features of probe cars and statistical processing methods affect the reliability of the information and particularly because the section travel time is greatly influenced by whether there has been delay by signals on urban roads or not, there can be much deviation among the collected individual probe data. Accordingly, researches in multilateral directions are necessary in order to enhance the credibility of the section information. Yet, the precedent studies related to high-pass information provision have been conducted on the highway sections with the feature of continuous flow, which has a limit to be applied to the urban roads with the transportational feature of an interrupted flow. Therefore, this research aims at analyzing the features of high-pass transportation data on urban roads and finding a proper processing method. When the characteristics of the high-pass data on urban roads collected from RSE were analyzed by using a time-space diagram, the collected data was proved to have a certain pattern according to the arriving cars' waiting for signals with the period of the signaling cycle of the finish node. Moreover, the number of waiting for signals and the time of waiting caused the deviation in the collected data, and it was bigger in traffic jam. The analysis result showed that it was because the increased number of waiting for signals in traffic jam caused the deviation to be offset partially. The analysis result shows that it is appropriate to use the mean of this collected data of high-pass on urban roads as its representative value to reflect the transportational features by waiting for signals, and the standard of judgment of delay and congestion needs to be changed depending on the features of signals and roads. The results of this research are expected to be the foundation stone to improve the reliability of high-pass information on urban roads.