• Title/Summary/Keyword: Acknowledgement Control

Search Result 62, Processing Time 0.031 seconds

QoS with Delayed Negative Acknowledge in MAC Layer of IEEE 802.15.3 (IEEE 802.15.3 MAC Layer에서의 Delayed Negative Acknowledge를 이용한 QoS)

  • Hong Jinwoo;Sung Hyun-Ah;Bae Dae-kyu
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.107-110
    • /
    • 2004
  • IEEE 802.15.3 is wireless Medium Access Control(MAC) and Physical Layer(PHY) specification for high rate WPAN (Wireless Personal Area Network). IEEE 802.15.3 MAC Layer provides Qos with three kinds of acknowledgements; No acknowledgement, Immediate acknowledgement, and Delayed acknowledgement. This paper presents how to improve QoS with new acknowledgement method called Delayed Negative acknowledgement. This paper describes the method of using Delayed Negative acknowledgement and presents the calculation of QoS improvement by using Delayed Negative acknowledgement.

  • PDF

MA : Multiple Acknowledgement Mechanism for UWSN (UnderWater Sensor Network)

  • Shin, Soo-Young;Lee, Seung-Joo;Park, Soo-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.12
    • /
    • pp.1769-1777
    • /
    • 2009
  • With the advent of the ubiquitous technology age, the progress of network technology has enabled a robust sensor communication, not just in cities, but also in poor surroundings such as deserts, polar regions, or underwater environments. In this paper, we propose a Multiple Acknowledgement (MA) technique to replace the conventional Automatic Repeat request (ARQ) technique. The MA mechanism is to send an Ack to many receivers simultaneously. The CH (master, coordinator) of the unit cluster broadcasts a Beacon frame where Ack information of the previously transmitted data is included. This technique can reduce the number of transmissions and overhead significantly. The proposed technique is a scheme improving the efficiency of an underwater sensor network where the uplink data transmission is the mainstream. The Performance of the ARQ, Block Ack, Pervasive Block Ack and the proposed method were compared with one another and analyzed. The proposed method showed significant performance improvement as compared with the ARQ, BA, and PBA in its channel efficiency.

  • PDF

Performance Improvement Method of TCP Protocol using Splitting Acknowledgement Packet in Integrated Wired-Wireless Network (유무선 복합망에서 Acknowledgement 패킷의 분할을 통한 프로토콜의 성능향상 기법)

  • Jin, Gyo-Hong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.39-44
    • /
    • 2002
  • In this paper, in order to improve the performance of TCP short traffic application services in wireless Internet environments, the Split-ACKs (SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless lints results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end Performance degradation of TCP. In this paper, to alleviate the TCP Performance, the SPACK method, split acknowledgement Packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analysed and shows better performance than traditional TCP Protocol.

Enhancing TCP Performance to Persistent Packet Reordering

  • Leung Ka-Cheong;Ma Changming
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.385-393
    • /
    • 2005
  • In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

PDAODMRP: An Extended PoolODMRP Based on Passive Data Acknowledgement

  • Cai, Shaobin;Yang, Xiaozong;Wang, Ling
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.362-375
    • /
    • 2004
  • An ad hoc network is a multi-hop wireless network. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple, and energy conserving. We have proposed PoolODMRP to reduce its control overhead greatly by its one-hop local route maintenance. However, PoolODMRP still has some shortcomings. In this paper, we propose PDAODMRP (passive data acknowledgement ODMRP) to extend PoolODMRP. Compared with PoolODMRP, PDAODMRP has the following contributions: (1) It knows the status of its downstream forwarding nodes by route information collected from data packets instead of BEACON signal of MAC layer; (2) it max simplifies the route information collected from data packets by pool nodes; (3) it adopts a dynamic local route maintenance to enforce its local route maintenance; (4) it adopts the route evaluation policy of NSMP (neighbor supporting multicast protocol). Compared with PoolODMRP, PDAODMRP has lower control overhead, lower data delivery delay, and lower data overhead.

SACK TCP with Probing Device

  • Liang, Bing;Hong, Choong Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1355-1358
    • /
    • 2004
  • This paper describes a modification to the SACK (Selective Acknowledgement) Transmission Control Protocol's (TCP), called SACK TCP with Probing Device, SACK works in conjunction with Probing Device, for improving SACK TCP performance when more than half a window of data lost that is typical in handoff as well as unreliable media. It shows that by slightly modifying the congestion control mechanism of the SACK TCP, it can be made to better performance to multiple packets lost from one window of data.

  • PDF

Modeling TCP Loss Recovery Latency for the Number of Retransmissions (재전송 개수를 고려한 TCP 손실 복구 과정의 지연 모델링 및 분석)

  • 김동민;김범준;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12B
    • /
    • pp.1106-1114
    • /
    • 2003
  • Several analytic models describe transmission control protocol (TCP) performance such as steady-state throughput as an averaged ratio of number of transmissions to latency. For more detailed analysis of TCP latency, the latency during packet losses are recovered should be considered. In this paper, we derive the expected duration of loss recovery latency considering the number of packet losses recovered by retransmissions. Based on the numerical results verified by simulations, TCP using selective acknowledgement (SACK) option is more effective than TCP NewReno from the aspect of loss recovery latency.

Implementation of TCP Retransmitted Packet Loss Recovery using ns-2 Simulator (ns-2 시뮬레이터를 이용한 TCP 재전송 손실 복구 알고리듬의 구현)

  • Kim, Beom-Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.741-746
    • /
    • 2012
  • Transmission control protocol(TCP) widely used as a transport protocol in the Internet includes a loss recovery function that detects and recovers packet losses by retransmissions. The loss recovery function consists of the two algorithms; fast retransmit and fast recovery. There have been researches to avoid nonnecessary retransmission timeouts (RTOs), which leads to selective acknowledgement (SACK) option and limited transmit scheme that are standardized by IETF (Internet Engineering Task Force). Recently, a method that covers the case in which a retransmitted packet is lost again has been propsed. The method, however, is not proved in terms of the additive increase multiplicative decrease (AIMD) principle of TCP congestion control. In this paper, therefore, we analyzed the method in terms of the principle by ns-simulations.

TCP Acknowledgement Compression for Fairness Among Uplink TCP Flows in IEEE 802.11n WLANs (IEEE 802.11n 무선랜에서 상향링크 TCP 플로우간 형평상 향상을 위한 TCP ACK 압축기법)

  • Kim, Minho;Park, Eun-Chan;Kim, Woongsup
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.7
    • /
    • pp.653-660
    • /
    • 2013
  • This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

Robust Acknowledgement Transmission for Long Range Internet of Things (장거리 사물 인터넷 기기를 위한 간섭에 강인한 ACK 기술)

  • Lee, Il-Gu
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.9
    • /
    • pp.47-52
    • /
    • 2018
  • Wi-Fi enabled Internet of Things (IoTs) had a substantial impact on society, economy and industry. However wireless connectivity technologies in unlicensed band such as Wi-Fi are vulnerable to interferences. They also face difficulty providing wireless connectivity over long range in dense networks due to the dynamically changed interference effect and asymmetric interference conditions. In this paper, robust acknowledgement transmission scheme is proposed for long range IoTs. According to the proposed scheme, it is possible to control the transmission rate of the transmission success rate of the response frame by adjusting the transmission rate of the response frame when the interference is present asymmetrically. It is also possible to use higher data rate when high quality link is guaranteed. The evaluation results demonstrated the proposed scheme improves the aggregate throughput by at most 9 Mbps when 20 MHz bandwidth transmission mode was adopted.