• Title/Summary/Keyword: Data transmission algorithm

Search Result 1,127, Processing Time 0.029 seconds

Transmission Line Fault Location Algorithm Using Estimated Local Source Impedance (자기단 전원임피던스 추정을 이용한 송전선 고장점표정 알고리즘)

  • Kwon, Young-Jin;Kim, Su-Hwan;Kang, Sang-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.5
    • /
    • pp.885-890
    • /
    • 2009
  • A fault location algorithm using estimated local source impedance after a fault is proposed in this paper. The method uses after fault data only at the local end. It uses the negative sequence current distribution factor for more accurate estimation. The proposed algorithm can keep up with the variation of the local source impedance. Therefore, the proposed algorithm especially is valid for a transmission line interconnected to a wind farm that the equivalent source impedance changes continuously. The performance of the proposed algorithm was verified under various fault conditions using the Simpowersystem of MATLAB Simulink. The proposed algorithm is largely insensitive to the variation in fault distance and fault resistance. The test results show a very high accurate performance.

Modified Transmission Line Protection Scheme in the Presence of SCC

  • Naeini, Ehsan Mostaghimi;Vaseghi, Behrouz;Mahdavian, Mehdi
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.533-540
    • /
    • 2017
  • Distance relay identifies the type and location of fault by measuring the transmission line impedance. However any other factors that cause miss calculating the measured impedance, makes the relay detect the fault in incorrect location or do not detect the fault at all. One of the important factors which directly changes the measured impedance by the relay is series capacitive compensation (SCC). Another factor that changes the calculated impedance by distance relay is fault resistance. This paper provides a method based on the combination of distance and differential protection. At first, faulty transmission line is detected according to the current data of buses. After that the fault location is calculated using the proposed algorithm on the transmission line. This algorithm is based on active power calculation of the buses. Fault resistance is calculated from the active powers and its effect will be deducted from calculated impedance by the algorithm. This method measures the voltage across SCC by phasor measurement units (PMUs) and transmits them to the relay location via communication channels. The transmitted signals are utilized to modify the voltage signal which is measured by the relay. Different operating modes of SCC and as well as different faults such as phase-to-phase and phase-to-ground faults are examined by simulations.

A Fault Location Algorithm for Transmission Lines in the High-Resistance Fault (송전선로에서의 고저항 지락고장시 고장거리 추정에 관한 알고리즘)

  • Park, Hong-Kyu;Lee, Myoung-Soo;Lee, Jae-Gyu;You, Seok-Ku
    • Proceedings of the KIEE Conference
    • /
    • 1999.07c
    • /
    • pp.1363-1365
    • /
    • 1999
  • This paper Presents an algorithm for the computation of fault location for a transmission line by means of the voltage and current signals. It is impossible to calculate the accurate fault distance, because of the fault resistance and fault current which are unknown. All Currents in the lines are divided by the current distribution factor, so the fault current through the fault resistance can be represented by using data from one terminal of transmission line. This algorithm proposed can calculate the fault distance with only the faulty phase information.

  • PDF

Efficient CAN Data Compression Algorithm Using Signal Length (신호의 길이 특성을 이용한 효율적인 CAN 데이터 압축 알고리즘)

  • Wu, Yujing;Chung, Jin-Gyun
    • Smart Media Journal
    • /
    • v.3 no.3
    • /
    • pp.9-14
    • /
    • 2014
  • The increasing number of ECUs in automobiles causes the CAN bus overloaded and consequently the error probability of data transmission increases. Since the time duration for the data transmission is proportional to CAN frame length, it is desirable to reduce the frame length. In this paper, we present a CAN message compression method using Data Length Code (DLC) and bit rearrangement. By simulations using actual CAN data, it is shown that the CAN transmission data is reduced up to 54 % by the proposed method, compared with conventional methods.

Data Transmission Algorithm for LED Communication Systems (LED 통신 시스템의 데이터 전송 알고리즘)

  • Kim, Kyung Ho;Hwang, Yu Min;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.8 no.2
    • /
    • pp.44-49
    • /
    • 2013
  • LED communication is a wireless communication technology to transmit information using visible light coming out from the LED(Light Emitting Diode). It is a technique that can overcome RF(Radio Frequency) communication problems that are frequency allocations, human body hazards, security vulnerabilities, and interference between electronic devices. As a technique that can be used as lighting and communications with using LED, LED communication is suitable for ubiquitous environment. This paper introduces the process of data transmission algorithm for LED communication systems algorithm using LED, PD(Photodiode), and MCU(Micro Controller Unit).

An Efficient Smoothing Algorithm Using the Change of Frame Sequence in GOP (GOP를 구성하는 프레임들의 순서 변경을 이용한 효율적인 스무딩 알고리즘)

  • Lee, Myoun-Jae
    • Journal of Korea Game Society
    • /
    • v.6 no.2
    • /
    • pp.51-60
    • /
    • 2006
  • Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CBA, MCBA, MVBA, PCRTT and others. But, in these algorithm, a transmission plan is made in according to stored frame sequence in these algorithms. In case that the number of bytes in frames in GOP differs greatly each other, this may cause unnecessary transmission rate changes and may require high transmission rates abruptly when frame's byte is large. In result, it is difficult to use efficient network resource. In this paper, we proposed a smoothing algorithm that find the optimal frame sequence in short time by using backtracking method and smoothing's structure for the proposed smoothing algorithm. This algorithm decides the sequence of frames which requires the lowest variance of frame's bytes in GOP and make a transmission plan. In order to show the performance, we compared with MVBA algorithm by various evaluation factors such as the number of rate changes, peak rate, rate variability.

  • PDF

The research of transmission delay reduction for selectively encrypted video transmission scheme on real-time video streaming (실시간 비디오 스트리밍 서비스를 위한 선별적 비디오 암호화 방법의 전송지연 저감 연구)

  • Yoon, Yohann;Go, Kyungmin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.4
    • /
    • pp.581-587
    • /
    • 2021
  • Real-time video streaming scheme for multimedia content delivery and remote conference services is one of technologies that are significantly sensitive to data transmission delay. Recently, because of COVID-19, real-time video streaming contents for the services are significantly increased such as personal broadcasting and remote school class. In order to support the services, there is a growing emphasis on low transmission delay and secure content delivery, respectively. Therefore, our research proposed a packet aggregation algorithm to reduce the transmission delay of selectively encrypted video transmission for real-time video streaming services. Through the application of the proposed algorithm, the selectively encrypted video framework can control the amount of MPEG-2 TS packets for low latency transmission with a consideration of packet priorities. Evaluation results on testbed show that the application of the proposed algorithm to the video framework can reduce approximately 11% of the transmission delay for high and low resolution video.

Performance Evaluation of Smoothing Algorithm Considering Network Bandwidth in IoT Environment (IoT 환경에서 가용 전송률을 고려한 스무딩 알고리즘의 성능 평가)

  • MyounJae Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.9 no.2
    • /
    • pp.11-17
    • /
    • 2023
  • Smoothing is to creating a transmission plan consisting of sections of frames that can be sent at the same transmission rate for compressed and stored video data. Various algorithms have been studied for the smoothing to minimize the number of transmission rate changes, the number of transmission rate changes, and the amount of transmission rate increase. This study evaluates the performance of a smoothing algorithm that minimizes the increase in transmission rates and maximizes the increase in transmission rates when the transmission rate is required to maximize the excess bandwidth to be secured by the server in an environment with limited server bandwidth. The available transmission rates and buffer sizes available in the server are set in various ways and evaluated by the number of fps changes, the minimum fps, the average fps, and fps variability. As a result of the comparison, the proposed algorithm showed excellent average fps and fps variability.

Transmission Control of Video Data through Prediction and Shot Transition Detection (장면전환 탐지와 예측을 통한 비디오 자료의 전송 제어)

  • Lee Keun-Soo;Kim Won
    • Journal of Internet Computing and Services
    • /
    • v.5 no.6
    • /
    • pp.59-66
    • /
    • 2004
  • In this paper, we propose a transmission rate prediction method of video data. The proposed method checks shot transition characteristics after dividing MPEG video data into a GoP unit and then uses Kalman filter. It used algorithm to detect shot transition information by high speed in compressed domain in order to check a correct shot transition of video data and classified into a abrupt shot transition type and a gradual shot transition type. Information to have been classifying is used as factors of Kalman filter and predicts a transmission rate of video data. Also, the proposed method decreased processing time with detecting shot transition and predicting a transmission rate of video data in compressed domain. It predicted a transmission rate with 96.2- 97.6% in the experiment that used three kinds of 911 1frames of different video data.

  • PDF

Design of Secure Information Center Using a Conventional Cryptography

  • Choi, Jun-Hyuk;Kim Tae-Gap;Go, Byung-Do;Ryou, Jae-Cheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.6 no.4
    • /
    • pp.53-66
    • /
    • 1996
  • World Wide Web is a total solution for multi-media data transmission on Internet. Because of its characteristics like ease of use, support for multi-media data and smart graphic user interface, WWW has extended to cover all kinds of applications. The Secure Information Center(SIC) is a data transmission system using conventional cryptography between client and server on WWW. It's main function is to support the encryption of sending data. For encryption of data IDEA(International Data Encryption Algorithm) is used and for authentication mechanism MD5 hash function is used. Since Secure Information Center is used by many users, conventional cryptosystem is efficient in managing their secure interactions. However, there are some restrictions on sharing of same key and data transmission between client and server, for example the risk of key exposure and the difficulty of key sharing mechanisms. To solve these problems, the Secure Information Center provides encryption mechanisms and key management policies.