• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.024 seconds

In-process Monitoring of Milling Chatter by Artificial Neural Network (신경회로망 모델을 이용한 밀링채터의 실시간 감시에 대한 연구)

  • Yoon, Sun-Il;Lee, Sang-Seog;Kim, Hee-Sool
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.5
    • /
    • pp.25-32
    • /
    • 1995
  • In highly automated milling process, in-process monitoring of the malfunction is indispensable to ensure efficient cutting operation. Among many malfunctions in milling process, chatter vibration deteriorates surface finish, tool life and productivity. In this study, the monitoring system of chatter vibration for face milling process is proposed and experimentally estimated. The monitoring system employs two types of sensor such as cutting force and acceleration in sensory detection state. The RMS value and band frequency energy of the sensor signals are extracted in time domain for the input patterns of neural network to reduce time delay in signal processing state. The resultes of experimental evaluation show that the system works well over a wide range of cutting conditions.

  • PDF

Reinforcement Method to Enhance Adaptive Route Search for Efficient Real-Time Application Specific QoS Routing (Real-Time Application의 효과적인 QoS 라우팅을 위한 적응적 Route 선택 강화 방법)

  • Oh, Jae-Seuk;Bae, Sung-Il;Ahn, Jin-Ho;Sungh Kang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.71-82
    • /
    • 2003
  • In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm targeted for real-time applications based on Ant algorithm to efficiently and effectively reinforce ant-like mobile agents to find the best route toward destination in a network regarding necessary QoS metrics. Simulation results show that the proposed method realizes QoS routing more efficiently and more adaptively than those of the existing method thereby providing better solutions for the best route selection for real-time application that has high priority on delay jitter and bandwidth.

Design Scheme of A Micro Real-Time Control System with CAN and RTOS (CAN과 RTOS를 내장한 소형 실시간 시스템 설계 기법)

  • Lim, Young-Gyu;Kim, Dong-Seoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.207-215
    • /
    • 2014
  • In this paper, we propose a Micro Real-Time Control System (MRTCS) for decreasing the delay during interrupts processing and data transfer on sensor nodes. The MRTCS consists of a control, sensor nodes based on Controller Area Network (CAN) device. The control node was designed with Real Time Operating System (RTOS) on top of the small Micro Control Unit (sMCU). Sensor nodes have the CAN device without sMCU, which have multiple Digital Inputs, Outputs (DI/DO) and the CAN controller. We have evaluated with OCTAVE v3.6.4 from open source for system performance. Simulation results show that the system performance was increased through the delay reducing for interrupt processing and internal data transfer. We verify that a proposed MRTCS approach will be adapted to various real-time control system.

Comparison of Time-Domain Imaging Algorithms for Ultra-Wideband Radar with One-Dimensional Synthetic Aperture (1차원 합성 개구면을 가진 초광대역 레이더의 시영역 기반 영상화 기법 비교)

  • Kim, Dae-Man;Hong, Jin-Young;Kim, Kang-Wook
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.10
    • /
    • pp.1175-1184
    • /
    • 2008
  • Delay-sum back projection(DSBP) algorithm and the time reversal algorithm based on the finite-difference time-domain method are compared. The two algorithms, which operate in the time domain, can process the ultra-wideband (UWB) radar data to generate images that are close to the original location and shape of the target. For the experiment, the UWB radar consists of a network analyzer, a resistive V dipole antenna, a scanner, and a control computer. The radar aperture is synthesized by linearly scanning the antenna. A calibration procedure is applied to the measured data to remove signal distortion and clutter. The two algorithms are applied to the same data on the same platform. It is shown that the DSBP algorithm produces better images but takes longer time to produce the images than the FDTD-TR algorithm.

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.9
    • /
    • pp.1492-1512
    • /
    • 2011
  • Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

Estimation of Brain Connectivity during Motor Imagery Tasks using Noise-Assisted Multivariate Empirical Mode Decomposition

  • Lee, Ki-Baek;Kim, Ko Keun;Song, Jaeseung;Ryu, Jiwoo;Kim, Youngjoo;Park, Cheolsoo
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.6
    • /
    • pp.1812-1824
    • /
    • 2016
  • The neural dynamics underlying the causal network during motor planning or imagery in the human brain are not well understood. The lack of signal processing tools suitable for the analysis of nonlinear and nonstationary electroencephalographic (EEG) hinders such analyses. In this study, noise-assisted multivariate empirical mode decomposition (NA-MEMD) is used to estimate the causal inference in the frequency domain, i.e., partial directed coherence (PDC). Natural and intrinsic oscillations corresponding to the motor imagery tasks can be extracted due to the data-driven approach of NA-MEMD, which does not employ predefined basis functions. Simulations based on synthetic data with a time delay between two signals demonstrated that NA-MEMD was the optimal method for estimating the delay between two signals. Furthermore, classification analysis of the motor imagery responses of 29 subjects revealed that NA-MEMD is a prerequisite process for estimating the causal network across multichannel EEG data during mental tasks.

Compensation Mechanism of Cell Delay Variation by Optimum Partial Timestamps on the ATM-to-Satellite Interface (위성 TDMA 와 ATM 접속에서 최적의 부분 타임스탬프에 의한 CVD 보상 기법)

  • Chung, Ha-Jae;Kim, Jeong-Ho;Oh, Chang-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.2980-2993
    • /
    • 2000
  • In order to achieve the rapid deployment of services. B-ISON network is being combined with terrestrial ATM and satellite network. Cell delay variation (CDV) generated by the difference of transfer mode between TOMA and ATM deteriorates transmission quality of the network system. We proposed the Partial Timestamps algorithm to supplement the problems of existing COV compensation methods. To minimize CDV and to utilize the satellite channels efficiently. only the optimized timestamps of a few cells within a control unit time of TDMA are selected and transmitted to the receiving earth station. The COV compensating efficiency of Partial Timestamps is evaluated by simulation. It is confirmed that CDV compensation capability of the proposed mechanism is superior to the other methods.

  • PDF

Cache Algorithm in Reverse Connection Setup Protocol(CRCP) for effective Location Management in PCS Network (PCS 네트워크 상에서 효율적인 위치관리를 위한 역방향 호설정 캐쉬 알고리즘(CRCP)에 관한 연구)

  • Ahn, Yun-Shok;An, Seok;Bae, Yun-Jeong;Jo, Jea-Jun;Kim, Jae-Ha;Kim, Byung-Gi
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.630-632
    • /
    • 1998
  • The basic user location strategies proposed in current PCS(Personal Communication Services) Network are two-level Database strategies. These Databases which exist in the Signalling network always maintain user's current location information, and it is used in call setup process to a mobile user. As the number of PCS users are increasing, this strategies yield some problem such as concentrating signalling traffic on the Database, increasing Call setup Delay, and so on. In this paper, we proposed RCP(Reverse Connection setup Protocol) model, which apply RVC(Reverse Virtual Call setup) algorithm to PCS reference model, and CRCP(Cache algorithm in RCP) model, which adopt Caching strategies in the RCP model. When Cache-miss occur, we found that CRCP model require less miss-penalty than PCS model. Also we show that proposed models are always likely to yield better performance in terms of reduced Location Tracking Delay time.

  • PDF

CE-OLSR: a Cartography and Stability Enhanced OLSR for Dynamic MANETs with Obstacles

  • Belghith, Abdelfettah;Belhassen, Mohamed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.270-286
    • /
    • 2012
  • In this paper, we propose a novel routing protocol called the Cartography Enhanced OLSR (CE-OLSR) for multi hop mobile ad hoc networks (multi hop MANETs). CE-OLSR is based on an efficient cartography gathering scheme and a stability routing approach. The cartography gathering scheme is non intrusive and uses the exact OLSR reduced signaling traffic, but in a more elegant and efficient way to improve responsiveness to the network dynamics. This cartography is a much richer and accurate view than the mere network topology gathered and used by OLSR. The stability routing approach uses a reduced view of the collected cartography that only includes links not exceeding a certain distance threshold and do not cross obstacles. In urban environments, IEEE 802.11 radio signals undergo severe radio shadowing and fading effects and may be completely obstructed by obstacles such as buildings. Extensive simulations are conducted to study the performances of CE-OLSR and compare them with those of OLSR. We show that CE-OLSR greatly outperforms OLSR in delivering a high percentage of route validity, a much higher throughput and a much lower average delay. In particular the extremely low average delay exacerbated by CE-OLSR makes it a viable candidate for the transport of real time data traffic in multi hop MANETs.

A Novel Duty Cycle Based Cross Layer Model for Energy Efficient Routing in IWSN Based IoT Application

  • Singh, Ghanshyam;Joshi, Pallavi;Raghuvanshi, Ajay Singh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.1849-1876
    • /
    • 2022
  • Wireless Sensor Network (WSN) is considered as an integral part of the Internet of Things (IoT) for collecting real-time data from the site having many applications in industry 4.0 and smart cities. The task of nodes is to sense the environment and send the relevant information over the internet. Though this task seems very straightforward but it is vulnerable to certain issues like energy consumption, delay, throughput, etc. To efficiently address these issues, this work develops a cross-layer model for the optimization between MAC and the Network layer of the OSI model for WSN. A high value of duty cycle for nodes is selected to control the delay and further enhances data transmission reliability. A node measurement prediction system based on the Kalman filter has been introduced, which uses the constraint based on covariance value to decide the scheduling scheme of the nodes. The concept of duty cycle for node scheduling is employed with a greedy data forwarding scheme. The proposed Duty Cycle-based Greedy Routing (DCGR) scheme aims to minimize the hop count, thereby mitigating the energy consumption rate. The proposed algorithm is tested using a real-world wastewater treatment dataset. The proposed method marks an 87.5% increase in the energy efficiency and reduction in the network latency by 61% when validated with other similar pre-existing schemes.