• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.306-312
• /
• 2011

In this paper, an efficient retransmission scheme using cooperation from neighboring nodes is investigated. In the cooperative retransmission scheme, an erroneous packet is retransmitted to the destination by cooperative nodes where distributed beamforming is used to accommodate multiple cooperating nodes. A Markov model is used to analyze throughput efficiency and average delay of the proposed retransmission scheme. It is shown that the analytical results are well matched with the simulated results and improved throughput and delay performance can be achieved as compared to the traditional retransmission scheme. The performance of the proposed cooperative retransmission is investigated in the multi-hop configuration via computer simulation. The transmit power for retransmission packet is also investigated and it can be significantly reduced by using a small feedback channel.

• 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.

• 한국멀티미디어학회논문지
• /
• 제20권12호
• /
• pp.1849-1855
• /
• 2017

The main purpose of cooperative communications is improvement of communication quality and efficient use of transmission power. In this paper, a cooperative retransmission method is proposed, where neighbor nodes that receive messages correctly between transmit and receive nodes will participate in retransmission of the erroneous packet of the direct link. When the proposed retransmission method is used, the performance of the PER can be greatly improved. In case that the limited information is included in the NACK message, the transmit power of the retransmission packet can be reduced using the proper power control method.

• 한국군사과학기술학회지
• /
• 제17권6호
• /
• pp.821-827
• /
• 2014

This paper considers a distributed telemetry system using retransmission algorithm with one master telemetry and two slave telemetries. The master telemetry merges data from each slave telemetry and own measured data. If there exist some errors in data from the slave telemetry, the master telemetry requests retransmission to corresponding slave telemetry. In this paper, we propose a retransmission algorithm applied to implementing the distributed telemetry system. Simulation results demonstrate that the retransmission improves the performance of the communication between the master and slave telemetries.

• 디지털산업정보학회논문지
• /
• 제13권2호
• /
• pp.35-42
• /
• 2017

The TDD LTE MU-MIMO HARQ system is designed and implemented using GPU based on 3GPP Rel.10 standard. The system consists of the DU part of the base station and the terminal using the general computer based on the GeForce GTX TITAN graphics card provided by NIVIDIA, and constructed the part of the RU using USRP N210 provided by Ettus. In the implementation part, SDR standard is applied, so that various communication standards can be compatible with software. The retransmission is implemented by combining the previous data with the retransmission data using Chase Combining among HARQ methods. In order to confirm that the retransmission was successful, the performance evaluation used LLR constellation. First, if there is an error in the data, the LLR value is not distributed at the corresponding position. in this case, a retransmission is performed to chase combine the previously stored error data and retransmitted data. As a result, the LLR value was distributed at the position of the corresponding LLR value per bit. Through this, it can be confirmed that error - free data is formed by using Chase Combining after retransmission.

• 방송공학회논문지
• /
• 제17권1호
• /
• pp.122-128
• /
• 2012

본 논문에서는 실제적으로 사용 가능한 분산 비디오 부호화 (Distributed Vedio Coding, DVC) 시스템을 구현하기 위하여 기존의 문제였던 높은 피드백 재전송 횟수에 의한 복원 지연문제를 개선하는 방법을 제안한다. 이는 각 압축률 영역에 맞추어 설계된 저밀도 패리티 검사 (Low-Density Parity-Check, LDPC) 부호를 사용함으로써 복원 성능을 높이고 각 부호가 복호에 실패할 경우 다른 부호율의 LDPC 부호를 구성하기 위한 소스 공개 (Source Revealing) 기법을 사용하여 피드백 전송 수를 줄임으로써 문제를 해결한다. 모의 실험 결과, 제안된 방법에 따른 DVC 방법은 기존 방법에 비해 57%의 복호 성능 개선 효과를 얻어 피드백 재전송 횟수를 50% 이상 감소시켰다.

• 한국통신학회논문지
• /
• 제29권7A호
• /
• pp.727-734
• /
• 2004

Collision Management Protocol (CMP)은 매체 접근 제어 (MAC) 방식이 랜덤 접근 (Random Access)인 HomePNA 3.0 비동기 MAC 모드 시스템으로 구성된 네트워크에서 데이터 프레임 전송 시에 발생하는 충돌을 해결하기 위한 프로토콜이다. 이 프로토콜의 특징은 기존 HomePNA 2.0 시스템의 Distributed fair Priority Queueing (DFPQ) 알고리즘이나 802.11 시스템의 Binary Exponential Backoff (BEB) 알고리즘과는 달리 충돌이 발생한 시스템들의 재 전송 순서를 랜덤 확률로서 결정하지 않고, 각 시스템별로 주어진 Collision Signaling Sequence (CSS) 간을 사용하여 순서를 결정한다. 즉, 재 전송 순서를 사전에 정의된 순서로 결정함으로서 평균적인 충돌 횟수를 최소화 할 수 있게 된다. 본 논문에서는 유선 홈 네트워킹 기술인 HomePNA 3.0의 CMP에 대하여 포화(Saturation) 상태에서의 성능을 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2691-2707
• /
• 2014

Medium access control is critical in wireless networks for efficient spectrum utilization. In this paper, we introduce a novel collision resolution method based on the technique of known interference cancellation, and propose a new MAC protocol named as CR-MAC, in which AP tries to decode all the collided data packets by combining partial retransmissions and known interference cancellation. As the collided transmissions are fully utilized, less retransmission is required, especially in a crowded network. The NS-2simulation and MATLAB numerical results show that, under various network settings, CR-MAC performs much better than the IEEE 802.11 DCF in terms of the aggregation throughput and the expected packet delay.

• Journal of Communications and Networks
• /
• 제4권2호
• /
• pp.148-157
• /
• 2002

This paper investigates schemes to improve TCP performance in multipath forwarding networks. In multipath routing, packets to the same destination are sent to multiple next-hops in either packet-level or flow-level forwarding mode. Effective bandwidth is increased since we can utilize unused capacity of multiple paths to the destination. In packet-level multipath forwarding networks, TCP performance may not be enhanced due to frequent out-of-order segment arrivals at the receiver because of different delays among paths. To overcome this problem, we propose simple TCP modifications. At the sender, the fast retransmission threshold is adjusted taking the number of paths into consideration. At the receiver, the delayed acknowledgment scheme is modified such that an acknowledgment for an out-of-order segment arrival is delayed in the same way for the in-order one. The number of unnecessary retransmissions and congestion window reductions is diminished, which is verified by extensive simulations. In flow-level multipath forwarding networks, hashing is used at routers to select outgoing link of a packet. Here, we show by simulations that TCP performance is increased in proportion to the number of paths regardless of delay differences.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.664-682
• /
• 2012

To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.