• Title/Summary/Keyword: Data transmission algorithm

Search Result 1,124, Processing Time 0.025 seconds

Performance Evaluation of Smoothing Algorithm Considering Network Bandwidth in IoT Environment (IoT 환경에서 네트워크 대역폭을 고려한 스무딩 알고리즘의 성능 평가)

  • Lee, MyounJae
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.4
    • /
    • pp.41-47
    • /
    • 2022
  • Smoothing is a transmission plan that converts video data stored at a variable bit rate into a fixed bit rate. Algorithms for smoothing include CBA, which aims to minimize the number of transmission rate increases, MCBA, which minimizes the number of transmission rate changes, and MVBA algorithms that minimize the amount of transmission rate change. This paper compares the proposed algorithm with the CBA algorithm with various video data, buffer size, and performance evaluation factors as a follow-up to the proposed smoothing algorithm that minimizes (maximizes) the transmission rate increase (decrease) when the server requires more bandwidth The evaluation factors used were compared with the number of changes in the fps rate, the minimum fps, the average fps, fps variability, and the number of frames to be discarded. As a result of the comparison, the proposed algorithm showed superiority in comparing the number of fps rate changes and the number of frames discarded.

A Robust Fault Location Algorithm for Single Line-to-ground Fault in Double-circuit Transmission Systems

  • Zhang, Wen-Hao;Rosadi, Umar;Choi, Myeon-Song;Lee, Seung-Jae;Lim, Il-Hyung
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.1
    • /
    • pp.1-7
    • /
    • 2011
  • This paper proposes an enhanced noise robust algorithm for fault location on double-circuit transmission line for the case of single line-to-ground (SLG) fault, which uses distributed parameter line model that also considers the mutual coupling effect. The proposed algorithm requires the voltages and currents from single-terminal data only and does not require adjacent circuit current data. The fault distance can be simply determined by solving a second-order polynomial equation, which is achieved directly through the analysis of the circuit. The algorithm, which employs the faulted phase network and zero-sequence network with source impedance involved, effectively eliminates the effect of load flow and fault resistance on the accuracy of fault location. The proposed algorithm is tested using MATLAB/Simulink under different fault locations and shows high accuracy. The uncertainty of source impedance and the measurement errors are also included in the simulation and shows that the algorithm has high robustness.

A Design for Data Transmission Algorithm of Multimedia Data with Best Effort Environment (Best Effort 환경에 적절한 멀티미디어 데이터 전송 알고리즘 설계)

  • 허덕행
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.155-162
    • /
    • 1999
  • Various applications of video conferencing are required real-time transmission in order to offer service of best effort in internet. Because the bandwidth of internet changes dynamically, appropriated QoS could not be guaranteed To resolve the problem. available bandwidth between sender and receiver is measured. And according to measured bandwidth, the transmission of multimedia data is controlled In this paper, we propose algorithm of efficient transmission for best QoS in internet According to a present status of network, we measure available bandwidth using feedback RTCP information and change a compression rate to reduce a producing CODEC data. And according to the priority that is measured by packet loss for received RTCP information, we abandon frames indicated as lower weight in transmission buffer of sender.

  • PDF

Monotonic and Parallelizable Algorithm for Simultaneous Reconstruction of Activity/Attenuation using Emission data in PET

  • Kim, Seung-Gu
    • Communications for Statistical Applications and Methods
    • /
    • v.8 no.1
    • /
    • pp.299-309
    • /
    • 2001
  • In PET(Positron Emission Tomography), it is necessary to use transmission scan data in order to estimate the attenuation map. Recently, there are several empirical studies in which one might be able to estimate attenuation map and activity distribution simultaneously with emissive sinogram alone without transmission scan. However, their algorithms are based on the model in which does not include the background counts term, and so is unrealistic. If the background counts component has been included in the model, their algorithm would introduce non-monotonic reconstruction algorithm which results in vain in practice. in this paper, we develop a monotonic and parallelizable algorithm for simultaneous reconstruction of both characteristics and present the validity through some simulations.

  • PDF

Implementation a of data repeating system using solar charging and develop algorithm for data repeating in the pasture (산지초지에서 한우 활동량 정보 수집을 위한 데이터 중계 알고리즘 및 시스템 구현)

  • Kim, Suc-Jun;Kim, Jong-Won;Kim, Chun-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.11
    • /
    • pp.285-293
    • /
    • 2016
  • In the paper, we propose a data transmission repeating system that allows data transmission for the effective supervision of cows grazing in the pasture. It is normal practice to divide the pasture into different areas for the purpose of distributing the grazing. However, this makes it difficult to supply electrical power and transmit data, because some of the pastures are far away from the office used for collecting data. To solve this problem, we developed a repeating system that can allow data transmission in the pasture using a solar charging system that consists of a 60W solar panel, 12V/100A battery and 6A solar controller for the power supply and a data transmission algorithm which extends the range of data transmission when using the proposed repeating system. We verified the performance of the repeating system by checking whether the data transmission is successful or not when transmitting from various test points when there is an obstacle between the receiver and repeating system. We also verified the solar charging system by measuring the battery voltage when the system is operated continuously for 31 days and whether the system can supply sufficient power when the weather is cloudy or rainy for a few days. Finally, we verified the performance of the repeating system and data transmission algorithm by conducting experiments in a pasture.

Efficient time domain equalizer design for DWMT data transmission (DWMT 데이타 전송을 위한 효율적인 시간영역 등화기 설계)

  • 홍훈희;박태윤;유승선;곽훈성;최재호
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.69-72
    • /
    • 1999
  • In this paper, an efficient time domain equalization algorithm for discrete wavelet multitone(DWMT) data transmission is developed. In this algorithm, the time domain equalizer(TEQ) consists of two stages, i.e., the channel impulse response shortening equalizer(TEQ-S) in the first stage and the channel frequency flattening equalizer(TEQ-F) in the second stage. TEQ-S reduces the length of transmission channel impulse response to decrease intersymbol interference(ISI) followed by TEQ-F that enhances the channel frequency response characteristics to the level of an ideal channel, hence diminishes the bit error rate. TEQ-S is implemented using the least-squares(LS) method, while TEQ-F is designed by using the least mean-square(LMS) algorithm. Since DWMT system also requires of the frequency domain equalizer in order to further reduce ICI and ISI the hardware complexity is an another concern. However, by adopting an well designed and trained TEQ, the hardware complexity of the whole DWMT system can be greatly reduced.

  • PDF

Fault Location Estimation Algorithm of the parallel transmission lines using a variable data window method (가변 데이터 윈도우 기법을 이용한 병행 2회선 송전선 고장점 추정 알고리즘)

  • Jung, Ho-Sung;Yoon, Chang-Dae;Lee, Seung-Youn;Shin, Myong-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2003.11a
    • /
    • pp.266-268
    • /
    • 2003
  • This paper proposes the Fault Location Estimation Algorithm in the parallel transmission lines. These algorithm uses a variable data window method based on least square error method to estimate fault impedance quickly. And it selects the optimal equation according to the operation situation and usable fault data for minimizing the fault estimation error effected by the zero sequence mutual coupling. After simulation result, we can see that these algorithm estimates fault location more rapidly and exactly.

  • PDF

Contention-based Reservation MAC Protocol for Burst Traffic in Wireless Packet Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.93-97
    • /
    • 2007
  • In this paper, centralized access control and slot allocation algorithm is proposed for wireless networks. The proposed algorithm is characterized by the contention-based reservation. In order to reduce the collision probability of reservation request, the base station calculates and broadcasts the transmission probability of reservation requests, and the wireless terminal transmits its reservation request with the received transmission probability. The scheduler allocates the uplink data slots based on the successful reservation requests. Simulation results show that the proposed algorithms can provide high channel utilization, and furthermore, maintains constant delay performance in the heavy traffic environment.

A study on threshold detection algorithm for adaptive transmission in underwater acoustic communication (수중 음향 통신에서 적응형 전송을 위한 임계값 검출 알고리즘)

  • Jung, Ji-Won;Kim, In-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.6
    • /
    • pp.585-591
    • /
    • 2020
  • The adaptive transmission techniques are efficient method for underwater acoustic communication to improve the system efficiency by varying transmission parameters according to channel conditions. In this paper, we construct four transmission modes with different data rates using the convolutional codes, which is freely set to size of information bits. On the receiver side, one critical component of adaptive system is to find which mode has best performance. In this paper, we proposed threshold detection algorithm to decide appropriate mode and applied turbo equalization method based on BCJR decoder in order to improve performance. We analyzed the performance of four modes based on threshold detection algorithm through the lake experiment.

CASPER: Congestion Aware Selection of Path with Efficient Routing in Multimedia Networks

  • Obaidat, Mohammad S.;Dhurandher, Sanjay K.;Diwakar, Khushboo
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.241-260
    • /
    • 2011
  • In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.