• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.033 seconds

Teleoperation of an Internet-Based Mobile Robot with Network Latency (데이터 전송 지연을 고려한 인터넷 기반 이동 로봇의 원격 운용)

  • Shin, Jik-Su;Joo, Moon-Gab;Kang, Geun-Taek;Lee, Won-Chang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.412-417
    • /
    • 2005
  • The Internet has been widely applied to the remote control system. The network-based control system, however, has a random time delay and an inherent weak point of the network, when the data ate transmitted. The network delay may result in performance degradation or even system instability in teleoperation. In this paper a prediction model of network delay using TSK (Takagi-Sugeno-Kang) fuzzy model is presented. An adaptive scheme is developed to update the prediction model according to the current network status. The prediction model is applied to the control of an Internet-based mobile robot to show its usefulness. In the computer simulation the TSK Prediction model of network delay is proven superior to the conventional algorithms.

A Design and Implementation of N-IDS Model based on Multi-Thread (멀티 쓰레드 기반 N-IDS 모델의 설계 및 구현)

  • 주수홍;엄윤섭;김상철;홍승표;이재호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.542-547
    • /
    • 2003
  • A network based intrusion detection system(N-IDS), can detect intruders coming in through packets in real time environment. The ability of capture of packet is the most important factor when we evaluate the performance of the system. The time delay between the time handling one packet capture and next one is variant become of packet handling mechanism. So for N-IDS can not settle this problem because most systems use a single processor. In this thesis, we solve the problem of irregular tine delay with a file socket and multi-thread processing. We designed and implement, the Crasto system. By an accurate observation, the performance testing shows that the Crasto reduces the capture delay time to 1/5 comparing to the existing single process N-IDS, and maintain delay time regularly.

  • PDF

Performance Analysis of Wired/Wireless Hybrid Network based on Common Industrial Protocol (Common Industrial Protocol 기반의 유무선 하이브리드 네트워크에 관한 성능 분석)

  • Jung, Ji-Won;Lee, Seung-Ki;Kim, Dong-Sung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.11
    • /
    • pp.1119-1127
    • /
    • 2007
  • This paper is concerned with a performance analysis using a wired/wireless hybrid network based on Common Industrial Protocol(CIP). For the performance analysis, the data transmission time, average end-to-end delay and throughput between DeviceNet and the wireless devices are investigated. The experimental results show the performance in terms of the polling/COS service time of CIP based hybrid network.

Improved Route Search Method Through the Operation Process of the Genetic Algorithm (유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법)

  • Ji, Hong-il;Seo, Chang-jin
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.4
    • /
    • pp.315-320
    • /
    • 2015
  • Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

Online Dynamic Modeling of Ubiquitous Sensor based Embedded Robot Systems using Kalman Filter Algorithm (칼만 필터 알고리즘을 이용한 유비쿼터스 센서 기반 임베디드 로봇시스템의 온라인 동적 모델링)

  • Cho, Hyun-Cheol;Lee, Jin-Woo;Lee, Young-Jin;Lee, Kwon-Soon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.8
    • /
    • pp.779-784
    • /
    • 2008
  • This paper presents Kalman filter based system modeling algorithm for autonomous robot systems. State of the robot system is measured using embedded sensor systems and then carried to a host computer via ubiquitous sensor network (USN). We settle a linear state-space motion equation for unknown robot system dynamics and modify a popular Kalman filter algorithm in deriving suitable parameter estimation mechanism. To represent time-delay nature due to network media in system modeling, we construct an augmented state-space model which is mainly composed of original state and estimated parameter vectors. We conduct real-time experiment to test our proposed estimation algorithm where speed state of the constructed robot is used as system observation.

Feasibility Study on Integration of SSR Correction into Network RTK to Provide More Robust Service

  • Lim, Cheol-Soon;Park, Byungwoon;Kim, Dong-Uk;Kee, Chang-Don;Park, Kwan-Dong;Seo, Seungwoo;So, Hyoungmin;Park, Junpyo
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.7 no.4
    • /
    • pp.295-305
    • /
    • 2018
  • Network RTK is a highly practical technology that can provide high positioning accuracy at levels between cm~dm regardless of user location in the network by extending the available range of RTK using reference station network. In particular, unlike other carrier-based positioning techniques such as PPP, users are able to acquire high-accuracy positions within a short initialization time of a few or tens of seconds, which increases its value as a future navigation system. However, corrections must be continuously received to maintain a high level of positioning accuracy, and when a time delay of more than 30 seconds occurs, the accuracy may be reduced to the code-based positioning level of meters. In case of SSR, which is currently in the process of standardization for PPP service, the corrections by each error source are transmitted in different transmission intervals, and the rate of change of each correction is transmitted together to compensate the time delay. Using these features of SSR correction is expected to reduce the performance degradation even if users do not receive the network RTK corrections for more than 30 seconds. In this paper, the simulation data were generated from 5 domestic reference stations in Gunwi, Yeongdoek, Daegu, Gimcheon, and Yecheon, and the network RTK and SSR corrections were generated for the corresponding data and applied to the simulation data from Cheongsong reference station, assumed as the user. As a result of the experiment assuming 30 seconds of missing data, the positioning performance compensating for time delay by SSR was analyzed to be horizontal RMS (about 5 cm) and vertical RMS (about 8 cm), and the 95% error was 8.7 cm horizontal and 1cm vertical. This is a significant amount when compared to the horizontal and vertical RMS of 0.3 cm and 0.6 cm, respectively, for Network RTK without time delay for the same data, but is considerably smaller compared to the 0.5 ~ 1 m accuracy level of DGPS or SBAS. Therefore, maintaining Network RTK mode using SSR rather than switching to code-based DGPS or SBAS mode due to failure to receive the network RTK corrections for 30 seconds is considered to be favorable in terms of maintaining position accuracy and recovering performance by quickly resolving the integer ambiguity when the communication channel is recovered.

TFRC Flow Control Mechanism based on RTP/RTCP for Real-time Traffic Transmission (실시간 트래픽 전송을 위한 RTP/RTCP의 TFRC 흐름제어 기법)

  • Choi, Hyun-Ah;Song, Bok-Sob;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.8
    • /
    • pp.57-64
    • /
    • 2008
  • In this paper, to resolve the problem caused by a network state information inaccuracy the slow delay time that conclusion of network state of one way delay time which accuracy delay time information, according to network state changes on the based TFRC flow control, and suggest that flow control mechanism to adjust transfer rate fit of real time multimedia data. In simulation, to measure of netowork state information that on the average about 12% difference of compared RTT and $OWD{\times}2$. When used RTT, used fair bandwidth TFRC much better than TCP about 32%, when used OWD, difference about 3% used fair bandwidth. Thus, conclusion of accuracy network state that used fair bandwidth according to network state changes on the based TFRC, users can support service of high quality that flow control mechanism to adjust transfer rate fit of real time data.

Synchronized Transmission for Real-Time Remote Control in the Wireless Network (무선 네트워크에서 실시간 원격제어를 위한 동기화 전송)

  • Kang, Hongku;Kim, Namgon;Kim, Jong-Won
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.22 no.2
    • /
    • pp.64-70
    • /
    • 2021
  • Nowadays, there are significant interests in real-time remote control using wireless networks. In implementing real-time remote control, one important factor is delay performance of real-time control message. Especially, the technique to reduce jitter of delay is necessary in transmitting periodically real-time control message. In this paper, we proposed synchronized transmission to reduce jitter of delay, when real-time control message was transmitted through wireless networks. The proposed transmission kept synchronization between source node and wireless transmitter and controlled transmission instance to transmit real-tie control message with fixed delay in wireless networks. According to results of experiment in military unmanned vehicle system, the proposed transmission reduced jitter of delay as 32% as that of a non-employing case.

Effective B-Chord look-up peer in P2P overlay network (P2P 오버레이 네트워크에서 효과적인 Peer 검색을 위한 B-Chord)

  • Hong, Rok Ji;Moon, Il Young
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.1-6
    • /
    • 2011
  • In this paper, search-efficient Bi-directional-Chord(B-Chord) is proposed in P2P (peer-to-Peer) overlay network. Chord is the most popular P2P Look-up protocol. However, it applied to the mobile environment, the search success rate become lower and the request delay time increases. That is big problem. Thus, by improving the existing Chord, in this paper proposed B-Chord reduces the request delay time to in a mobile environment. Proposed B-Chord have the two Finger table and can search by selecting Finger table depending on the value of Key. By use these bi-directional, it can reduce the number of nodes Hop and search delay time. Thus, As a result, it will be able to increase the search success rate in a mobile environment.