• Title/Summary/Keyword: RA scheme

Search Result 146, Processing Time 0.029 seconds

Delay Performance Analysis of the NAK-based SR-ARQ Protocol with the Reverse Acknowledgment (RA) Scheme

  • Han, Je-Chan;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11B
    • /
    • pp.989-997
    • /
    • 2008
  • The reverse acknowledgment (RA) scheme supports a fast loss recovery for negative acknowledgment (NAK)-based selective repeat automatic repeat request (SR-ARQ) by detecting a retransmission failure quickly before a retransmission timer expires. In this paper, we evaluate the performance of a NAK-based SR-ARQ protocol with the RA scheme and compare it with the conventional NAK-based SR-ARQ protocol. Particularly, we propose a simple analysis model for the transport delay of the NAK-based SR-ARQ protocol considering the traffic condition, the retransmission persistence, the timer-based retransmissions and the RA scheme's behavior. Both NAK-based SR-ARQ protocols with and without the RA scheme are implemented by using the OPNET simulator. We verified the analysis model's accuracy through the simulation results. Also, we evaluate the performance of the NAK-based SR-ARQ protocol with the RA scheme based on analysis and simulation results.

Performance of RA-T spread-spectrum transmission scheme for centralized DS/SSMA packet radio networks (집중형 DS/SSMA 무선 패킷통신망을 위한 RA-T 대역확산 전송방식의 성능)

  • 노준철;김동인
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.6
    • /
    • pp.11-22
    • /
    • 1996
  • We address an issue of channel sharing among users by using a random assignment-transmitter-based (RA-T) spread-spectrum transmission scheme which permits the contention mode only in the transmission of a header while avoiding collision during the data packet transmission. Once the header being successfully received, the data packet is ready for reception by switching to one of programmable matched-filters. But the receoption may be blocked due to limited number of matched-filters so that this effect is taken into account in our analysis. For realistic analysis, we integrate detection performance at the physical level with channel activity at the link level through a markov chain model. We also consider an acknowledgement scheme to notify whether the header is correctly detcted and the data packet can be processed continuously, which aims at reducing the interference caused unwanted data transmission. It is shown that receiver complexity can be greatly reduced by choosing a proper number of RA codes at the cost of only a little throughput degradation.

  • PDF

Synch. RA-based Uplink Packet Transmission in OFDMA Systems (OFDMA 시스템에서 동기 RA 방식 기반의 상향링크 패킷 전송)

  • Oh, Sang-Kyu;Moon, Jin-Soo;Shin, Seok-Joo
    • Journal of Internet Computing and Services
    • /
    • v.9 no.2
    • /
    • pp.25-33
    • /
    • 2008
  • In this paper we propose uplink packet transmission scheme based on Synchronized RA. The scheme can afford to support diverse QoS required from diverse multimeda traffics. In order to minimze the collision probability occurred in contention based channel access, we assign a reservation access channel additionally to the traffic channels. Access probability function for controlling collisions occurred in the reservation access channel is applied. Through assigning different access probability to each traffic user with respect to priority issued by his required QoS, the proposed scheme guarantees minimum throughput required by higher priority users in the whole range of system load.

  • PDF

Interleaver Design of Punctured RA-Type LDPC Codes

  • Piao, Yong-Chun;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1129-1134
    • /
    • 2006
  • In this paper, we analyze the cycle structure of punctured finite-length RA-type LDPC codes and design interleavers which have good memory efficiency and avoid short cycles. Furthermore, we introduce the check-node merging scheme for punctured finite-length RA-type LDPC codes and design simple interleavers. Simulation results show that punctured finite-length RA-type LDPC codes using the proposed simple interleavers have better performance than those with random and S-random interleavers.

The VLR Overflow Control Scheme considering Mobility of Mobile Users in Wireless Mobile Networks

  • Oh, Sun-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.4
    • /
    • pp.601-609
    • /
    • 2003
  • In wireless mobile networks, the service area is partitioned into several registration areas (RAs). Every RA is associated with a mobility database called Visitor Location Register (VLR). The VLR is used to achieve the location management of the mobile terminals. When a mobile terminal enters a new RA, the VLR stores the current location information of the mobile terminal before serving any mobile services. At that time, if the VLR is full, the registration procedure fails, and the system can not deliver services to the mobile user under the existing cellular technology To resolve this problem, we propose a VLR overflow control scheme considering mobility of mobile users to accomodate incoming users during VLR overflow. The performance of the proposed scheme is evaluated by an analytic model in terms of costs for the location search and the location update, and compared with those of the overflow control scheme proposed by Lin[1].

  • PDF

Split LDPC Codes for Hybrid ARQ

  • Joo, Hyeong-Gun;Hong, Song-Nam;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10C
    • /
    • pp.942-949
    • /
    • 2007
  • In this paper, we propose a new rate-control scheme, called splining, to construct low-rate codes from high-rate codes by splitting rows of the parity-check matrices of LDPC codes, which can construct rate-compatible LDPC codes having good initial transmission performance. Good low-rate codes can be constructed by making the number of distinct check node degrees as small as possible after splitting. The proposed scheme achieves good cycle property, low decoding complexity, and fast convergence speed, especially compared to the puncturing. Especially, rate-compatible repeat accumulate-type LDPC (RA-Type LDPC) code is constructed using splitting, which covers the code rates from 1/3 to 4/5. Through simulation it is shown that this code outperforms other rate-compatible RA-Type LDPC codes for all rates and can be decoded conveniently and efficiently.

Optimal Power Allocation for Wireless Uplink Transmissions Using Successive Interference Cancellation

  • Wu, Liaoyuan;Wang, Yamei;Han, Jianghong;Chen, Wenqiang;Wang, Lusheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2081-2101
    • /
    • 2016
  • Successive interference cancellation (SIC) is considered to be a promising technique to mitigate multi-user interference and achieve concurrent uplink transmissions, but the optimal power allocation (PA) issue for SIC users is not well addressed. In this article, we focus on the optimization of the PA ratio of users on an SIC channel and analytically obtain the optimal PA ratio with regard to the signal-to-interference-plus-noise ratio (SINR) threshold for successful demodulation and the sustainable demodulation error rate. Then, we design an efficient resource allocation (RA) scheme using the obtained optimal PA ratio. Finally, we compare the proposal with the near-optimum RA obtained by a simulated annealing search and the RA scheme with random PA. Simulation results show that our proposal achieves a performance close to the near-optimum and much higher performance than the random scheme in terms of total utility and Jain's fairness index. To demonstrate the applicability of our proposal, we also simulate the proposal in various network paradigms, including wireless local area network, body area network, and vehicular ad hoc network.

Performance analysis of DSSS- and CSS-based physical layer for IoT transmission over LEO satellites

  • Jung, Sooyeob;Im, Gyeongrae;Jung, Dong-Hyun;Kim, Pansoo;Ryu, Joon Gyu;Kang, Joonhyuk
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.543-559
    • /
    • 2022
  • To determine a suitable waveform for Internet of Things (IoT) transmission over low-Earth orbit (LEO) satellites, this paper reports the results of a performance comparison between chirp spread spectrum (CSS)-based LoRa and direct sequence spread spectrum (DSSS)-based Ingenu. The performance of both waveforms was measured in terms of the packet error rate, throughput, and packet loss rate, considering the Doppler effect caused by the high speed of LEO satellites and the interference among multiple terminals. Simulation results indicate that the DSSS scheme is more suitable than the CSS scheme for high-traffic IoT services because of its robustness against interference among multiple terminals. However, the CSS scheme is more suitable than the DSSS scheme for high-mobility IoT services because of its robustness against the Doppler effect. We discuss various solutions, such as the preprocessing of Doppler effect and avoidance of packet collision, to enhance the performance of the DSSS and CSS schemes. The simulation results of the proposed solution show that the enhanced DSSS scheme can be a proper waveform in IoT transmission over LEO satellites for both the high-traffic and high-mobility services.

A study on F8L10D-N LoRa RF Module for Drone Based live Broadcasting system

  • Mfitumukiza, Joseph;Mariappan, Vinayagam;Lee, Minwoo;Cho, Juphil;Cha, Jaesang
    • International Journal of Advanced Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.1-5
    • /
    • 2016
  • In this paper, we present the study on the proposed design of a real-time transmission of a video from the drone to broadcasting station (OBVan) by using F8L10D-N LoRa Module. Nowadays, LoRa technology is proved to be the mass of low cost, long range machine-to-machine connectivity. Particularly in the field of broadcasting and communication system, F8L10D-N LoRa RF Module spread spectrum technology with long transmission distance and strong penetrative ability that is double stronger than traditional FSK as well as PSK modulation scheme.

PSS Movement Prediction Algorithm for Seamless hando (휴대인터넷에서 seamless handover를 위한 단말 이동 예측 알고리즘)

  • Lee, Ho-Jeong;Yun, Chan-Young;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.53-60
    • /
    • 2006
  • Handover of WiBro is based on 802.16e hard handover scheme. When PSS is handover, it is handover that confirm neighbor's cell condition and RAS ID in neighbor advertisement message. Serving RAS transmits HO-notification message to neighbor RAS. Transmiting HO-notification message to neighbor RAS, it occurs many signaling traffics. Also, When WiBro is handover, It occurs many packet loss. Therefore, user suffer service degradation. LPM handover is supporting seamless handover because it buffers data packets during handover. So It is proposed scheme that predicts is LPM handover and reserves target RAS with pre-authentication. These schemes occur many signaling traffics. In this paper, we propose PSS Movement Prediction to solve signaling traffic. Target RAS is decided by old data in history cache. When serving RAS receives HO-notification-RSP message to target RAS, target RAS inform to crossover node. And crossover node bicast data packet. If handover is over, target RAS forward data packet. Therefore, It reduces signaling traffics but increase handover success rate. When history cache success, It decrease about 48% total traffic. But When history cache fails, It increase about 6% total traffic