• 제목/요약/키워드: Retransmission Probability

검색결과 60건 처리시간 0.018초

Modeling of a controlled retransmission scheme for loss recovery in optical burst switching networks

  • Duong, Phuoc Dat;Nguyen, Hong Quoc;Dang, Thanh Chuong;Vo, Viet Minh Nhat
    • ETRI Journal
    • /
    • 제44권2호
    • /
    • pp.274-285
    • /
    • 2022
  • Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

A Technique to Exploit Cooperation for Packet Retransmission in Wireless Ad Hoc Networks

  • Kim, Hae-Soo;Buehrer, R. Michael
    • Journal of Communications and Networks
    • /
    • 제10권2호
    • /
    • pp.148-155
    • /
    • 2008
  • In wireless data communication systems, retransmission of an erroneous packet is inevitable due to the harsh communication environment. In this paper, an efficient retransmission scheme using cooperation from neighboring nodes is investigated. In the cooperative retransmission scheme, an erroneous packet is transmitted to the destination by cooperative nodes which have favorable channels. This cooperative retransmission scheme requires no a priori information of neighboring nodes and has no limitation on the number of cooperating nodes. Distributed beamforming is used to accommodate multiple cooperating nodes. Phase and frequency offsets of cooperating signals are extracted from the NACK message and used to co-phase retransmitted data packets. The outage probability of the cooperative retransmission scheme is analyzed for the case of perfect synchronization and when the offsets are estimated. To reduce the impact of the residual phase and frequency offsets in cooperating signals, a low-rate feedback scheme is also investigated. It is shown that improved outage probability and reduced packet error rate (PER) performance can be achieved even for long data packets. The proposed cooperative retransmission scheme is found to outperform simple retransmission by the source as well as decode-and-forward cooperation.

사본 중복 전송 ARQ에서 일반화된 재전송 요청 규칙의 성능 분석 (Performance Analysis of Generalized Retransmission Request Rule for Multicopy Transmission ARQ)

  • 신우철;김동준;주재환;최천원
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
    • /
    • pp.319-322
    • /
    • 2002
  • In this paper, we consider a generalized rule of retransmission request, identified as (Μ, $\sigma$) rule for multicopy transmission ARQ. Following a revised rule to conform with a strict criterion for requesting a retransmission, we can reduce the probability that a packet accepted by the receiving node is still being infected with errors. In turn, such amendment invokes a degradation of delay and throughput performance. For a quantitative evaluation of (Μ, $\sigma$) rule, we develop an analytical method to calculate probability of error remains, maximum throughput, average and peak delays, and delay variation. From the numerical examples made by use of the analytical method, we observe a performance trade-off between probability of error remains and delay/throughput. We also confirm the adaptability of (Μ, $\sigma$) rule to meet various QoS requirements.

  • PDF

A Delayed Multiple Copy Retransmission Scheme for Data Communication in Wireless Networks

  • Niu, Zhisheng;Wu, Yi;Zhu, Jing
    • Journal of Communications and Networks
    • /
    • 제5권3호
    • /
    • pp.222-229
    • /
    • 2003
  • In this paper, we propose a delayed multiple copy retransmission (DMCR) scheme for data communication in wireless networks, by which multiple copies of a lost link layer frame are retransmitted one-by-one with a retransmission delay in between. The number of the copies gradually increases with the number of retransmissions. Furthermore, for implementation of the DMCR scheme in practical mobile communication system, we also propose a dynamic retransmission scheme by interleaving and a new round-robin scheduling algorithm. We compare our scheme with the previous non-delayed retransmission schemes on the performance of frame loss probability, channel capacity and total transmission time. Numerical results show that the DMCR scheme can achieve higher performance. The effect of the delay time on endto-end TCP throughput is investigated as well.

고속 광 지역망을 위한 파장 분할 다중 접근 프로토콜 (Wavelength Division Multiple Access Protocols for High-Speed Optical Fiber Local Area Networks)

  • 조원홍;이준호;이상배
    • 전자공학회논문지A
    • /
    • 제31A권4호
    • /
    • pp.21-29
    • /
    • 1994
  • Three protocols based on the slotted Aloha technique are proposed for very high-speed optical fiber local area networks using wavelength division multiplexing (WDM) passive star topology and the throughputs and delays are derived. For getting a high probability in successful transmission of control packets determining the transmission of a data packet, we adopt control mini slot groups in these protocols. The retransmission probability is also considered in analysis. Both throughput and delay of three protocols are compared and analyzed by varying the number of control solt groups, the retransmission probability the length of a data packet and the number of channels. The numerical analysis shows that the proposed protocols adopted the control slot groups give the increase of throughput and the decrease of delay.

  • PDF

무선 네트워크에서 네트워크 코딩 재전송 기법의 점근적 이득 (Asymptotic Gain of Network-Coded Retransmission in Wireless Networks)

  • 고승우;김성륜
    • 한국통신학회논문지
    • /
    • 제37권6B호
    • /
    • pp.464-473
    • /
    • 2012
  • 본 논문에서는 무선 네트워크에서 네트워크 코딩을 재전송에 사용했을 때 얻을 수 있는 이득을 계산했다. 먼저 무선 네트워크에서 네트워크 코딩을 재전송에 활용했을 때 얻을 수 있는 전송 실패 확률을 수학적으로 구했고 이에 따른 다이버시티 차수를 노드 숫자와 수신 확률에 따라 변함을 보였다. 전송 실패 확률을 이용하여 전송실패 확률 ${\epsilon}$을 만족시키는 ${\epsilon}$-용량 (${\epsilon}$-outage capacity) 을 구하였고, 네트워크 코딩을 사용했을 때와 안 했을 때의 ${\epsilon}$-용량의 비율을 네트워크 코딩 이득이라 정의하였다. 그리고 네트워크 코딩 이득이 다이버시티 차수의 함수로 표현됨을 보였다. 노드 숫자가 무한하게 많아지게 되면 네트워크 코딩 이득이 점근적으로 $0.25{\epsilon}^{-1}$을 달성할 수 있음을 보였다.

WBAN에서 신체 내부 센서의 라이프타임 향상을 위한 LI 프로토콜 (WBAN LI Protocol for Improving Lifetime of Implant Sensor in Body)

  • 박진철;이정규
    • 전자공학회논문지
    • /
    • 제51권6호
    • /
    • pp.18-25
    • /
    • 2014
  • WBAN(Wireless body area network)에서 신체에 삽입된 센서는 신체의 생물학적인 특성에 의해 일반 센서보다 프레임의 오류가 발생 할 확률이 높아진다. 본 논문에서는 신체에 삽입된 센서의 라이프타임을 향상시키기 위해 삽입 된 센서의 재전송을 외부 센서에서 대신 전송해주는 방법으로 삽입된 센서의 전송을 줄이는 방법을 제시한다. 제시된 LI(Lifetime Increment) 프로토콜은 기존의 CSMA/CA 전송방식에서 데이터 프레임에 외부 센서의 ID를 추가하고, 내부 센서가 전송한 프레임이 재전송이 요구 될 시에는 추가 되어있던 ID의 외부 센서에서 재전송을 책임지는 방법이다. 제안하는 프로토콜의 성능 비교를 위해 WBAN CSMA/CA 전송 방식과 비교한 결과 에너지 소모량이 적어져 라이프 타임이 향상되는 것을 확인하였다.

가상 셀룰라 망(VCN)에서의 음성 패킷 지연 특성 (Delay characteristics of speech packets in virtual cellular network(VCN))

  • 정명순;김화종
    • 한국통신학회논문지
    • /
    • 제23권9A호
    • /
    • pp.2305-2312
    • /
    • 1998
  • 본 논문에서는 Virtual Cellular Network(VCN)을 사용하는 무선 통신망에서 음성 패킷의 지연 특성을 분석하였다. 주기적으로 발생하는 음성 패킷이 슬롯-알로하 프로토콜로 전송될 때의 전송 특성을 Markov Chain으로 모델링하여 정상 상태(steady state)에서의 지연 확률 분포를 구하였고, 무선 채널의 평균 수신확률(prbability of capture), 재전송 방식 등이 성능에 미치는 영향을 분석하였다. 이를 위하여 무선 단말기의 수신 확률의 변화에 따른 음성 패킷의 전송 지연 누적 확률 함수를 구하였다. 재전송 방식의 평균 backoff 시간이 성능에 미치는 영향을 알아보기 위해 음성 패킷 발생 주기(N 슬롯시간)당 평균 재전송 횟수, NPr을 파라미터로 정의하였으며 여러가지의 프레임 크기 N에 대하여 1% outage delay를 비교하였다. 성능 실험 결과 NPr의 최적의 범위는 4~7임을 알 수 있었다. 따라서 프레임 크기 N이 주어졌을 때의 재전송 시도 확률 Pr을 구할 수 있다. 또한 전송큐의 크기가 유한함으로써 발생하는 blocking 확률과 전송큐의 적절한 크기를 구하였다.

  • PDF

Slotted CDMA_ALOHA Protocol with Hybrid ARQ in Wireless Communication Network

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • 제5권3호
    • /
    • pp.194-199
    • /
    • 2007
  • In this paper, a slotted CDMA_ALOHA protocol with hybrid ARQ is proposed for the wireless CDMA communication networks. The proposed protocol combines the characteristics of the slotted ALOHA, CDMA, and the hybrid ARQ, in order to increase the throughput by reducing the number of retransmissions when the channel experiences heavy traffic. The main feature of the proposed protocol is the utilization of the forward error correction capability to correct errors that appear after the CDMA dispreading of the packets. The base station does not need to ask so often for retransmission of erroneous packets. It will request for retransmission only when the FEC capability is exceeded. The performance of the proposed protocol is analyzed by considering the packet collision probability as well as the bit error probability. The numerical results show that the system throughput is closely related to the bit error rate of the wireless link and the FEC coding rate.

무선 ATM LAN에서 재전송 확률과 우선순위를 고려한 MAC 연구 (The MAC Scheme Based on Retransmission Probability and Priority for WATM)

  • 안석;안윤석;김재하;서승우;서영석;김병기
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.633-636
    • /
    • 1998
  • The next generation of wireless communication seems to be multimedia communications based on ATM and requires the efficient MAC(Medium Access Control) protocol to support multimedia traffic with the various characteristics of QoS(Quality of Service). A Proposed D-PRMA++ MAC protocol is operated dynamically by the retransmission probability and the number of reservation channel on the side of MS(Mobile Station) Also, On the side of BS(Base Station) it analyzes the parameters receive d from all MS and allocates the slots by priority in order to guarantee QoS.

  • PDF