• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.1
• /
• pp.15-24
• /
• 2008

The data delivery confirmation method of MIL-STD-188-220C, which is a tactical wireless mobile Ad-Hoc communication protocol, is that a source node requires the end-to-end ack from all destination nodes and the data-link ack from 1-hop neighboring destination nodes and relaying nodes, regardless of the hop distance from a source node to destination nodes. This method has the problem to degrade the whole communication network performance because of excessive data traffic due to the duplicate use of end-to-end ack and data-link ack, and the collision among end-to-end acks on the wireless network in the case of confirming a data delivery within an 1-hop distance. In order to solve this problem, this paper has proposed the method to perform the data delivery confirmation with the improvement of communication network performance through the data traffic reduction by achieving the reliable data delivery confirmation requiring the only data-link ack within an 1-hop distance. The effects of the proposed method are analyzed in the two aspects of the data delivery confirmation delay time and the data delivery confirmation success ratio.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.98-107
• /
• 2008

In mobile ad hoc networks, packet loss is unavoidable due to MAC contention, link failure or the inherent characteristics of wireless link. Since TCP relies on the timely reception of TCP ACK packets to progress the transmission of the TCP DATA packets, ACK loss obviously affects the performance due to two main problems: (a) Frequent occurrence of spurious retransmissions caused by timeout events and (b) impairment of the fast retransmit mechanism caused by the lack of a sufficient number of duplicate ACK packets. In particular, since most reactive routing protocols force the packets buffered over a path to be discarded while performing a route recovery, the performance degradation becomes more serious due to such ACK loss. In this paper, therefore, TCP with two piggybacking schemes (called TCP-pgy) is proposed in order to resolve the above-mentioned problems over reactive routing protocols. Through extensive simulations using the ns-2 simulator, we prove that our proposed schemes contribute to TCP performance improvements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1532-1538
• /
• 1999

In general, because error rate of wireless link is higher than that of wired link, DLC layer protocol for wired network with low error rate is not proper for wireless environments. In addition, the conventional DLC layer protocol for wireless network is optimized for the low-speed data service, so it is difficult to use conventional DLC protocol in the current mobile communication environments handing high-speed and multimedia services. Therefore, a DLC layer protocol that is suitable to current wireless communication environments is required. In this paper, we propose a novel error control scheme that supports a variety of traffic attribute and is applicable to high-speed and multimedia data service in WATM. The proposed scheme provides enhanced throughput performance for real-time traffic by using modified ASR ARQ without ACK and reduces loss rate by using FEC in the case of high error condition. Also, for non real-time traffic, the use of ASR ARQ without ACK enhances throughput performance and delay time is decreased by using FEC in the case of high error rate channel. As a result of simulation, the proposed scheme has better performance than conventional ASR ARQ protocol in view of delay and throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.4
• /
• pp.1-8
• /
• 2000

A defect of decrease in TCP throughput can be investigated in asymmetric environment of different uplink and downlink bandwidths. Under two-way TCP traffic, the total link utilization is decreased by the successive injection of data packets in buffer. To solve these problems, terminal ACK filtering and packet scheduling mechanisms are introduced in this paper. ACK filtering eliminates the buffered ACK packets and transmits recent ACK packets in the uplink with limited bandwidth. Packet scheduling is the method of preventing 'clustering' and 'ack compression' states which are generated in the two-way TCP traffic. The guarantee of the data traffic in reverse TCP connection and the high throughput in forward TCP connection are investigated by simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1654-1662
• /
• 2006

An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.21-27
• /
• 2008

TCP receivers deliver ACK packets to senders for reliable end-to-end transfer. When ACK packets are not transferred properly because of network congestion, the performance of TCP degrades. This paper proposes a reverse congestion warning mechanism and a congestion handling mechanism in heterogeneous networks with heavy background traffic in the backward direction. Help from TCP receivers or hardware such as routers and gateways other than the ACK packets themselves is not necessary. TCP senders compare the arrival intervals of ACK data passed from receivers and the difference in t imestamp values echoed by receivers. According to the simulation results using the NS-2 network simulator, the proposed scheme shows a performance elevation of 20% greater than Reno, 150% greater than New Reno, and 450% greater than Westwood, respectively, under heterogeneous networks and that the error rate of the radio link is 1% when the backward network is congested.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.523-541
• /
• 2011

In current IEEE 802.11 wireless LAN, every unicast transmission requires an ACK from the receiver for reliability, though it consumes energy and bandwidth. There have been studies to remove or reduce ACK overhead, especially for energy efficiency. However none of them are practically used now. This paper introduces a noble method of selective unacknowledged transmission, where skipping an ACK is dynamically decided frame by frame. Utilizing the fact that a multicast frame is transmitted without accompanying an ACK in 802.11, the basic unacknowledged transmission is achieved simply by transforming the destination address of a frame to a multicast address. Since removing ACK is inherently more efficient but less strict, its practical profit is dependent on traffic characteristics of a frame as well as network error conditions. To figure out the selective conditions, energy and performance implications of unacknowledged transmission have been explored. Extensive experiments show that energy consumption is almost always reduced, but performance may be dropped especially when TCP exchanges long data with a long distance node through a poor wireless link. An experiment with a well-known traffic model shows that selective unacknowledged transmission gives energy saving with comparable performance.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.311-315
• /
• 2003

Recently, there is asymmetrical transmission in Internet data stream. The asymmetrical transmission has much more downstream than upstream. Owing to this point, it needs to reduce the acknowledgement as element of the obsrtuction in downstream. In this paper, according to simulation's result, we know that Sack has good performance than New Reno in bottleneck environment Comparing two protocols in packet loss rate, NewReno is lower than Sack. And also comparing two protocols in throughput of ack packet, not only NewReno processes ack packet more quickly than Sack, but also NewReno processes more ack packet than Sack protocol during ten seconds in simulation. As a result, NewReno is batter than Sack in throughput of asymmetrical link.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.467-469
• /
• 2006

In wireless network environments, as users' demands on high-speed data communications due to increase of multi-media services, the necessity of new high-speed WLAN technologies has appeared. Nowaday, IEEE is standardizing a new WLAN protocol caned as IEEE 802.11n. To effectively use wireless resources, IEEE 802.11n introduces MAC aggregation function which is similar to that in IEEE 802.11e. In case of transmitting several frames without MAC aggregation, the frames include individual frame header and trailer, and their corresponding acknowledgement frames can appear on wireless link. However, if they are aggregated into single MAC frame, we can reduce the number of used bits due to frame headers/trailers and also remove redundant acknowledgement frames. In this paper, we explain two different MAC frame aggregation methods for IEEE 802.11e and IEEE 802.11n and evaluate their throughput by simulations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.37-43
• /
• 2009

Reliability should be assured to support the stable ubiquitous sensor network services in wireless sensor networks. Data transmission reliability is the most important one in the reliability factors in USN. When we consider the wireless communication environment of sensor networks, data transmission reliability requires the performance improvement. For this, this paper introduces the method that can handle the reliability and the performance together. The proposed scheme uses the self relay signal between sensor nodes to deliver the ACK and the next data is scheduled to be sent on acceptance of this self relay signal. For the evaluation of the performance improvement, the analysis and the simulation have been done.