• 디지털콘텐츠학회 논문지
• /
• 제9권1호
• /
• pp.1-6
• /
• 2008

전통적인 무선 통신 시스템에서 주된 전력의 소모는 송신 전력이다. 따라서 최근에는 에너지가 제한된 무선 네트워크에 대한 많은 연구가 집중되고 있다. 예를 들어, 다중입력 다중출력 구조나 다중 안테나 통신 기술은 무선 시스템 및 네트워크에서 매우 중요하다. 본 논문에서는 무선 네트워크에서 Go-back-N ARQ 기법을 적용한 MISO 시스템의 비트 오율과 처리율 성능을 분석하였고 MISO 기반의 무선 네트워크에서 에너지 소모를 SISO 기반의 무선 네트워크와 비교하였다. 얻어진 결과를 통하여 스마트한 시스템 디자인으로 이루어진 무선 네트워크에서 Go-back-N ARQ 기법을 적용한 MISO 시스템의 적용가능성을 보여준다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.302-305
• /
• 2003

3GPP RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In the 3GPP ARQ, distinctive windows are provided at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at re-ordering buffer, which results in a long re-ordering time. Aiming at suppressing the occupancy at re-ordering buffer, we propose partial go back N scheme in this paper In the partial go back N scheme, the receiving station regards all data PDU's between the first (lowest sequence numbered) error-detected PDU and last (highest sequence numbered) error-detected PDU. By the employment of the partial go back N scheme, the occupancy at the re-ordering buffer is apparently reduced, while the delay and throughput performance may be degraded due to the remaining properties of go back N. We thus consider peak occupancy of re-ordering buffer, mean sojourn time at re-ordering buffer, mean delay time, and maximum throughput as measures to evaluate tile proposed scheme and investigate such performance by using a simulation method. From numerical examples, we observe a trade-off among performance measures and conclude that the partial go back N scheme is able to effectively reduce the occupancy of re-ordering buffer.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.65-68
• /
• 2003

3GPP's RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In 3GPP ARQ, distinctive windows are provide at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at reordering buffer, which results in a long reordering time. Aiming at suppressing the occupancy at reordering buffer, we propose a occupancy control scheme in this paper. In this scheme, a threshold is created in the receiving station's window and a data PDU out of the threshold (but within the window) is treated according to go back N ARQ. By the employment of the occupancy control scheme, the occupancy at the reordering buffer is apparently reduced, while the delay performance may be degraded due to the properties of go back N ARQ. We, thus, investigate the peak occupancy and mean delay performance by a simulation method. From numerical examples, we observe a trade-off in both performance measures and conclude that the peak occupancy is effectively reduced by setting a proper threshold under a constraint on mean delay performance.

• 전자공학회논문지A
• /
• 제32A권2호
• /
• pp.11-18
• /
• 1995

Error detection in ARQ(Automatic Repeat Request) protocols is very important in wireless data communication systems. The throughput efficiency of ARQ protocols can be improved by dynamically adapting the protocol packet length so that it approaches the optimum value for throuhput efficiency. In this paper, a simple and novel adaptive packet length allocation method is proposed which transmits the packets with variable length by dyanmically estimating the channel codition. The simulation results show that the average of throughput is improved by 315.4% in the stop-and-wait protocol, 41.4% in the go-back-N protocol and 155.9% in the selective repeat protocol respectively. And the throughput performances of adaptive packet length allocation method approximately approach the theoritically optimal throughput performances.

• 산업공학
• /
• 제4권1호
• /
• pp.63-69
• /
• 1991

In this paper, the Go-Back-N ARQ protocol with decoding in communication network is considered. The time delay and throughput are respectively analyzed as a function of window size and decoding time out. Packets arrive continuously at the decoder, and are stored in a buffer if the decoder is busy upon its arrival. The decoder devotes no more than a time-out period of predetermined length to the decoding of any single packet. If packet decoding is completed within that period, the packet leaves the system. Otherwise, it is retransimitted and its decoding starts anew. The time delay and throughput are obtained using recursive formula and difference equation. An appropriate time out and window size that satisfies the grade of service can be determined.