• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.28-34
• /
• 2007

Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes perform local error recovery for their receiver nodes using the data stored in their buffers. We propose a packet loss patterns adaptive feedback scheduling scheme to manage these buffers in an efficient manner. Under our scheme, receiver nodes send NAKs to repair nodes to request packet retransmissions only when the packet losses are independent events from other nodes. At dynamic and infrequent intervals, they also send ACKs to indicate which packets can be safely discarded from the repair node's buffer. Our scheme reduces delay in error recovery because the requested packets are almost always available in the repair node's buffers. It also reduces the repair node's workload because (a) each receiver node sends infrequent ACKs with non-fixed intervals and (b) their sending times are fairly distributed among all the receiver nodes.

• Journal of information and communication convergence engineering
• /
• v.5 no.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.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.199-205
• /
• 2012

This work investigates the progressive linear precoder design for packet retransmissions in multi-input multi-output (MIMO) systems with multiple codewords and automatic repeat request (ARQ) bundling feedback. Assuming perfect channel state information, a novel progressive linear ARQ precoder is proposed in the perspective of minimizing the packet error rate. We devise the ARQ precoder by combining power loading and sub channel pairing between current retransmission and previous transmissions. Furthermore, we extend the design to the case that the channel estimation error exists. Numerical results show that the proposed scheme can improve the performance of MIMO ARQ systems significantly regardless of the channel estimation error.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.759-769
• /
• 2011

Cooperative hybrid-automatic repeat request (HARQ) protocols, which can exploit the spatial and temporal diversities, have been widely studied. The efficiency of cooperative HARQ protocols is higher than that of cooperative protocols because retransmissions are only performed when necessary. We classify cooperative HARQ protocols as three decode-and-forward-based HARQ (DF-HARQ) protocols and two amplified-and-forward-based HARQ (AF-HARQ) protocols. To compare these protocols and obtain the optimum parameters, two unified frameworks are developed for protocol analysis. Using the frameworks, we can evaluate and compare the maximum throughput and outage probabilities according to the SNR, the relay location, and the delay constraint. From the analysis we can see that the maximum achievable throughput of the DF-HARQ protocols can be much greater than that of the AF-HARQ protocols due to the incremental redundancy transmission at the relay.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.337-339
• /
• 2005

By definition of RFC 2018, each segments block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts occur we note that the limitation of maximum available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit packets that have actually been received but not carried related information in SACK option field. For overcoming this restriction, in this paper, a new solution is designed to further improve the performance of TCP SACK and prevent those unwanted retransmissions. Simulation result shows that the implementation of our proposal is effective.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1195-1207
• /
• 2012

Fast and reliable message broadcasting is critical for safety critical applications of VANET due to the urgency and/or significance of the messages for passengers and drivers. For reliable message delivery, a mechanism for checking the reception of message at the neighboring vehicles and retransmitting it if necessary is required. Especially, in urban environments, where the traffic density tends to be high, mechanisms that minimize control message overhead such as beacon are appropriate in order to minimize the message collisions. Furthermore, broadcast delivery is especially difficult at the intersection due to the road side obstacles such buildings, and hence, a mechanism that enables effective and efficient delivery across intersections is required. In this paper, we propose a beaconless reliable and efficient broadcast approach which specifically taking into account the urban streets. The proposed approach checks the message reception of neighboring vehicles implicitly by taking into account the broadcast of message by next vehicle as the acknowledgement. When retransmissions is necessary around the intersections, vehicles located within the intersection area, where the chance of successful signal propagation toward every branch of the intersection is higher due to less signal attenuation caused by road side obstacles, are to do the retransmissions. Simulation results show that the proposed approach can provide better reliability while consume less resources than the existing approaches.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.29-36
• /
• 2013

In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. Most of the existing energy efficient routing protocols use the minimum energy path to minimize energy consumption, which causes an unbalanced distribution of residual energy among nodes. As a result, the power of nodes on energy efficient paths is quickly depletes resulting in inactive. To solve these problems, a method to equalize the energy consumption of the nodes has been proposed, but do not consider the link error rate in the wireless environment. In this paper, we propose a uniform energy consumption of cluster-based multi-hop routing mechanism considering the residual energy and the link error rate. This mechanism reduces energy consumption caused by unnecessary retransmissions and distributes traffic evenly over the network because considering the link error rate. The simulation results compared to other mechanisms, the proposed mechanism is energy-efficient by reducing the number of retransmissions and activation time of all nodes involved in the network has been extended by using the energy balanced path.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.43-49
• /
• 2009

This paper presents a routing mechanism to prolong the lifetime of error-prone wireless sensor networks. The proposed mechanism estimates the amount of energy consumption for communications and the expected residual energy in advance, which is based on the qualities of wireless links. Then, the proposed mechanism selects a path that is expected to have the most residual energy, and sends sensory data along the path. This mechanism reduces energy consumption caused by unnecessary retransmissions and distributes traffic evenly over the network owing to taking error rates into consideration, and extends energy depletion by selecting a path with the maximum of the minimal expected residual energy amounts. The experiment results show that the proposed mechanism prolongs network lifetime, compared to the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1180-1197
• /
• 2013

Network coding is one of the most promising techniques to increase the reliability and reduce the energy consumption for wireless sensor networks (WSNs). However, most of the previous works mainly focus on the network coding for multicast or unicast in WSNs, in spite of the fact that the converge-cast is the most common communication style in WSNs. In this paper, we investigate, for the first time as far as we know, the feasibility of acquiring network coding benefits in converge-cast, and we present that with the ubiquitous convergent structures self-organized during converge-casting in the network, the reliability benefits can be obtained by applying linear network coding. We theoretically derive the network coding benefits obtained in a general convergent structure, and simulations are conducted to validate our theoretical analysis. The results reveal that the network coding can improve the network reliability considerably, and hence reduce number of retransmissions and improve energy-efficiency.