• Title/Summary/Keyword: frame delay

Search Result 366, Processing Time 0.029 seconds

Random Channel Allocation Scheme Based on Split Algorithm in HIPERLAN 2 (HIPERLAN Type 2에서 Split 알고리즘에 기반한 랜덤채널 할당 기법)

  • 황의석;고유창;이승규;윤철식;이형우;조충호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.717-727
    • /
    • 2003
  • The HIPERLAN/2(HIgh PERformance Local Area Network Type2) is one of the wireless LAN standards for providing raw data rates of up to 54 Mbps. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD, and resources in one MAC frame can be allocated dynamically by Access Point(AP). The random channel(RCH) is defined for the purpose of giving a mobile terminal the opportunity to request transmission resources in the uplink MAC frames. It is desirable that the number of RCHs is dynamically adapted by the AP depending on the current traffic situation. Allocation of excessive RCHs may waste radio resources and insufficient RCHs compared to traffic loads may result in many collisions in access attempts. We propose an RCH allocation scheme based on split algorithm in HIPERLAN/2. The simulation and analytic results show that the proposed scheme achieves a higher channel throughput, lower access delay and delay jitter than previously proposed RCH allocation schemes.

A Study on the Development of Next Generation Wireless PAN Algorithms with Location Awareness Technique (위치인식기반의 차세대 무선 PAN 알고리즘 개발에 관한 연구)

  • Cho, Juphil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.10
    • /
    • pp.2095-2100
    • /
    • 2012
  • In this paper, we propose the channel sounding scheme which is made for ideal communication between some application as well as the short distance of high speed data transmission in MIMO-OFDM system for Wireless PAN. This method is able to perceive the duration of the impulse response through the delaying of power delay profile, modeled a power delay profile which has an attenuate characteristic, and obtained the coefficient of channel response by ML (maximum likelihood). Through the amplitudes, phases and delays associated with each multipath component which were acquired from this channel sounding scheme, we can describe the wave propagation characteristics of channels between the transmitter and receiver so that the receiver could enhance not only the reliability but also the ability of communication link. Multi agent system models can be used to analyze the path of the system within any time frame. Further, parameter values can be perturbed to examine how the path of the system changes in response to exogenous shocks.

A New Semi-Random Imterleaver Algorithm for the Noise Removal in Image Communication (영상통신에서 잡음 제거를 위한 새로운 세미 랜덤 인터리버 알고리즘)

  • Hong, Sung-Won;Park, Jin-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2473-2483
    • /
    • 2000
  • In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

  • PDF

Authentication Interworking Protocol based on Media Independent Handover in Heterogeneous Networks (MIH 기반의 이기종 네트워크 환경에서 대리 서명을 이용한 인증 연동 프로토콜)

  • Roh, Hyo-Sun;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.2
    • /
    • pp.86-94
    • /
    • 2010
  • This paper proposed an authentication interworking protocol (AIP) based on IEEE 802.21 MIH in the heterogeneous networks. The proposed AIP using the RSA signature reduces handover delay time and communication message overhead when the mobile node moves between the heterogeneous networks. It defines new AIP TLV in MIH frame format and uses the MIH Information Server (MIHIS) for proxy signature issue instead of the authentication server for the heterogeneous networks. For low handover delay, the proposed AIP performs pre-authentication processes with MIH protocol before layer 2 handover. Also, this paper analyzed the performance of the handover and compared with the non-secure MIH protocol.

Real-Time Transmission Scheme for Ad Hoc Self-Organizing (ASO) TDMA in Multi-Hop Maritime Communication Network (Ad Hoc Self-Organizing (ASO) TDMA 방식 다중-홉 해양통신망에서의 실시간 전송 기법)

  • Cho, Kumin;Yun, Changho;Lim, Yong-Kon;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.260-270
    • /
    • 2014
  • In this paper, we first analyze the delay performance of Dynamic Space-time Subframe (DSTS)-based frame structure which has been proposed to support the real-time service as well as non real-time service, using Ad hoc Self-Organizing Time Division Multiple Access (ASO-TDMA) MAC protocol, especially when transmitting a MAC SDU with two or more MAC PDUs, in a multi-hop ad-hoc maritime communication network. We propose two key transmission schemes: contiguous DSTS reservation which guarantees the end-to-end delay for the multiple PDUs, and adaptive transmission probability control schemes to maximize the system throughput. Our simulation results show that the proposed schemes outperform the system throughput of the existing transmission schemes, while supporting the real-time requirement.

New Decoding Techniques of RS Codes for Optical Disks (광학식 디스크에 적합한 RS 부호의 새로운 복호 기법)

  • 엄흥열;김재문;이만영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.3
    • /
    • pp.16-33
    • /
    • 1993
  • New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.

  • PDF

Reactive Power Control of Single-Phase Reactive Power Compensator for Distribution Line (배전선로용 단상 무효전력 보상기의 무효전력제어)

  • Sim, Woosik;Jo, Jongmin;Kim, Youngroc;Cha, Hanju
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.25 no.2
    • /
    • pp.73-78
    • /
    • 2020
  • In this study, a novel reactive power control scheme is proposed to supply stable reactive power to the distribution line by compensating a ripple voltage of DC link. In a single-phase system, a magnitude of second harmonic is inevitably generated in the DC link voltage, and this phenomenon is further increased when the capacity of DC link capacitor decreases. Reactive power control was performed by controlling the d-axis current in the virtual synchronous reference frame, and the voltage control for maintaining the DC link voltage was implemented through the q-axis current control. The proposed method for compensating the ripple voltage was classified into three parts, which consist of the extraction unit of DC link voltage, high pass filter (HPF), and time delay unit. HPF removes an offset component of DC link voltage extracted from integral, and a time delay unit compensates the phase leading effect due to the HPF. The compensated DC voltage is used as feedback component of voltage control loop to supply stable reactive power. The performance of the proposed algorithm was verified through simulation and experiments. At DC link capacitance of 375 uF, the magnitude of ripple voltage decreased to 8 Vpp from 74 Vpp in the voltage control loop, and the total harmonic distortion of the current was improved.

Modifications of DCF Scheme to Alleviate Jitter Property in WLANs (무선 랜의 지터 성능 개선을 위한 DCF 개선 방안)

  • Kang, Dong-Hun;Seok, Seung-Joon
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.153-163
    • /
    • 2008
  • Almost literature has so far proposed the modifications to IEEE 802.11 DCF MAC protocol to improve system throughput and average delay. Jitter(variance in packet delays) is, however, considered as an important QoS parameter for real-time streaming service which is popularized increasingly. Unfortunately, legacy access protocol for WLAN can't support the jitter. This paper proposes two schemes modifying the DCF MAC protocol to reduce the average value of jitter for multimedia frames arrived at received nodes. The one scheme, referred to as DCW-DCF(Decreasing Contention Window-DCF), reduces CW(Contention Window) size by half whenever a transmitted frame collided against other frames and back-off happens. Also, it increase initial CW size according as the link utilization and the collision probability increase. The other scheme, referred to as D-DIFS(Differential-DIFS), assigns different values to DIFS. That is, the DIFS interval is deceased as the number of back-off for a frame increases. In this paper, the two schemes are evaluated through simulation using ns2 and simulation results show that the proposed schemes are effective for improving the jitter property of standard WLAN.

  • PDF

Dynamic VBR traffic characterization for video service in ATM network (ATM 망에서 비디오 서비스를 위한 동적 VBR 트래픽 특성화)

  • 황재철;조미령;이상원;이상훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.4
    • /
    • pp.455-470
    • /
    • 2001
  • This paper is focused on the traffic characterization for the efficient transmission of the VBR video source in the ATM network. For the traffic characterization, low traffic monitoring technique is applied and the dynamic VBR characterization method is suggested to satisfy the delay requirement. The dynamic VBR method uses the token bucket algorithm buffering though Cumulative Constraint Function. According to the Cumulative Constraint Function, the packet initially started transferring at the peak rate and the token bucket provided proper amount of buffer for traffic after a certain period of monitoring. It also reduced the network resource bandwidth through renewal of the cumulative frame and changed the rate from the previous frame information. It requires only small amount of monitoring and causes little overhead. In addition, it lowered the complexity of Deterministic Constraint Function to 0(n) and mapped the token rate and token depth to the token bucket. This study shows less network resource consumed than the previous method, comparing and analyzing the result of simulations.

  • PDF

A Study On The Wireless ATM MAC Protocol Using Mini-slot With Dynamic Bandwidth Allocation Algorithm (동적 대역 할당 알고리즘을 이용한 미니슬롯 기반의 무선 ATM 매체 접속 제어 프로토콜에 관한 연구)

  • Jeong, Geon-Jin;Lee, Seong-Chang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.2
    • /
    • pp.17-23
    • /
    • 2000
  • Wireless link has high bit error rate compared with wired link and many users share this limited bandwidth. So it needs more powerful error control code and efficient media access control(MAC) to provide multimedia service reliably. In this paper we proposed efficient MAC frame format based on TDMA using mini-slot for request access. The number of mini-slots is variable based on the result of collision in the previous frame. This dynamic allocation of request mini-slots helps resolve the contention situation quickly and avoids the waste of bandwidth that may occur when there are several unneeded request mini-slots. The simulation results are also presented in terms of channel utilization, call blocking probability and cell transmission delay for mixed traffic environment.

  • PDF