• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.113-117
• /
• 2008

Wireless carrier sense multiple access (CSMA) systems are widely used but show extremely different transmission efficiency according to the operation environment. Simulation or prototype deployment is needed to see the transmission efficiency of a wireless CSMA system with the partial packet retransmission scheme. The lower bound for the transmission efficiency of such a system is found mathematically in this work. This shows how much the partial packet retransmission scheme improves the transmission efficiency quantitatively. It also shows that the maximum throughput is obtained at higher offered load compared to the conventional CSMA system without the partial packet transmission. The result of this work can be applied to IEEE 802.11 networks or wireless mesh networks.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.768-775
• /
• 2011

Since error compensation schemes guaranteeing high reliability are required in wireless communication systems for the transmission of the large amount of data, as an efficient error compensation scheme the turbo HARQ scheme combining automatic repeat request and turbo coding has been studied in many places in the literature. In the case of conventional turbo HARQ schemes, the transmitter recognizing NAK signals repetitively sends the whole unit packet to the receiver although the received packet can be partially correctable. Through two successive processes, selection of uncorrectable error data and retransmission of only the relevant parts of the information data, transmission efficiency can be improved. In this paper, we present an error data selection criterion for retransmission using the sign transitions of A Posteriori values and propose a tubo HARQ scheme based on the partial retransmission technique. Through a computer simulation, we show and analyze the performance of the proposed scheme with transmission efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.288-297
• /
• 2003

The fast retransmit and fast recovery algorithm of TCP Reno, when multiple packets in the same window are lost, cannot recover them without RTO (Retransmission Timeout). TCP New-Reno can recover multiple lost packets by extending fast recovery using partial acknowledgement. If the retransmitted packet is lost again during fast recovery, however, RTO cannot be avoided. In this paper, we propose an algorithm called "Duplicate Acknowledgement Counting(DAC)" to alleviate this problem. DAC can detect the retransmitted packet loss by counting duplicate ACKs. Conditions that a lost packet can be recovered by loss recovery of TCP Reno, TCP New-Reno and TCP New-Reno using DAC are derived by modeling loss recovery behavior of each TCP. We calculate the loss recovery probability for random packet loss probability numerically, and show that DAC can improve loss recovery behavior of TCP New-Reno.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.