• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.028 seconds

A Heuristic Buffer Management and Retransmission Control Scheme for Tree-Based Reliable Multicast

  • Baek, Jin-Suk;Paris, Jehan-Francois
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.1-12
    • /
    • 2005
  • We propose a heuristic buffer management scheme that uses both positive and negative acknowledgments to provide scalability and reliability. Under our scheme, most receiver nodes only send negative acknowledgments to their repair nodes to request packet retransmissions while some representative nodes also send positive acknowledgments to indicate which packets can be discarded from the repair node's buffer. Our scheme provides scalability because it significantly reduces the number of feedbacks sent by the receiver nodes. In addition, it provides fast recovery of transmission errors since the packets requested from the receiver nodes are almost always available in their buffers. Our scheme also reduces the number of additional retransmissions from the original sender node or upstream repair nodes. These features satisfy the original goal of treebased protocols since most packet retransmissions are performed within a local group.

  • PDF

CAMR: Congestion-Aware Multi-Path Routing Protocol for Wireless Mesh Networks

  • Jang, Seowoo;Kang, Seok-Gu;Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.411-419
    • /
    • 2017
  • The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

Quality of service management for intelligent systems

  • Lee, Sang-Hyun;Jung, Byeong-Soo;Moon, Kyung-Il
    • International journal of advanced smart convergence
    • /
    • v.3 no.2
    • /
    • pp.18-21
    • /
    • 2014
  • A control application requirements currently used is very low, such as packet loss rate, minimum delay on sensor networks with quality of service (QoS) requirements some packet delivery guarantee. This paper is the sampling period at the end of the actuator and sensor data transfer related to the Miss ratio for each source sensor node, use the controller and the internal ANFIS. The proposed scheme has the advantages of simplicity, scalability, and General. Simulation results of the proposed scheme can provide QoS support in WSANs.

Enhancement of SCTP Throughput using Chunk Checksum

  • Lin Cui;Koh Seok J.;Hong Yong-Geun
    • Annual Conference of KIPS
    • /
    • 2006.05a
    • /
    • pp.1147-1150
    • /
    • 2006
  • Stream Control Transmission Protocol (SCTP) uses the 32-bit checksum in the common header, by which a corrupted SCTP packet will be regarded as a lost packet and then discarded. This may result in degradation of SCTP's throughput performance over wireless networks. This paper proposes a new chunk checksum scheme for SCTP, in which each data chunk contains its own checksum field and SACK chunk carry corresponding Transmission Sequence Number (TSN) with timestamp for every corruption event. The proposed chunk checksum scheme is introduced with the following three purposes: 1) to distinguish the chunk corruptions from the chunk losses; 2) to avoid the unnecessary halving of the congestion window (cwnd) in the case of chunk corruption; 3) to avoid the unwanted timeouts which can be induced in conventional SCTP in the case that the retransmitted data chunks are corrupted again in wireless networks. Simulation results show that the proposed chunk checksum scheme could improve the SCTP throughput in the wireless environments with a high bit error rate.

  • PDF

Fairness Measures for Data Communication Networks (데이터 통신망을 위한 공평성 성능 확보 방안)

  • Ju, Un-Gi;Lee, Hyeong-Seop
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.135-138
    • /
    • 2004
  • This paper considers a ring loading problem on RPR(Resilient Packet Ring), where RPR is recommended by IEEE802.17 Resilient Packet Ring working group for data optimized networks without the requirements of provisioning circuits. RPR is well suitable for metropolitan area network with two counter-rotating rings that multiple stations share the bandwidth, where the data and its corresponding control traffic is transmitted to the two opposite directional ring, respectively. One of the major concerns on RPR is to provide fairness among traffic requirements. The paper discusses several fairness measures and analysis ring loading problems for the fairness.

  • PDF

An Adaptive Selection of Congestion Window for TCP over Ad-Hoc Networks

  • Song, Jung-Hoon;Lee, Sang-Don;Han, Ki-Jun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.541-543
    • /
    • 2004
  • TCP does not distinguish between congestion and packet losses due to route change and link failures, which are prevalent in mobile ad hoc networks. So, TCP does not show satisfactory performance in ad hoc networks since it assumes that all packet losses are due to network congestions. In particular, when a route is reestablished it needs to be adaptively determined CWND according to the new route features. In this paper, we proposed CWND adjustment scheme to improve the TCP performance overad hoc networks. TCP sender effectively adjusts CWND by monitoring the network situation using control packets. Simulation results using NS-2 show that the proposed scheme increases TCP throughput compared with those of general TCP.

  • PDF

Adaptive Active Noise Control in a car Using Wavelet Packet Filler Bank (웨이브렛 패킷 필터 뱅크를 이용한 자동차 내부에서의 적응 능동 소음제어)

  • Jang, Jae-Dong;Kim, Young-Joong;Lim, Myo-Taeg
    • Proceedings of the KIEE Conference
    • /
    • 2006.07d
    • /
    • pp.1753-1754
    • /
    • 2006
  • 이 논문에서는 밀폐된 공간 내에서 발생하는 소음을 줄이기 위해 일종의 능동 소음 제어 방법을 발표한다. 제안된 제어방법은 WPFB(Wavelet Packet Filter Bank)를 이용하여 기존의 FXLMS(Filtered-X Least Mean Square) 알고리즘의 단점인, 소음 제어시스템 내에서의 소음전달의 지연으로 인한 불안정성과, 소음의 급작스런 변화에 대한 응답능력부족을 해소하는 방법이다. 이 시스템의 주요 특성은 소음제어 시스템의 이차경로에 WPFB이 삽입되어 FXLMS 알고리즘에 비해 빠른 연산이 수행된다는 것이다. 다른 말로 하면, WPFB는 병렬연산을 수행한다. 그러면, 적응 알고리즘 내에 있는 필터의 웨이트들이 더 빨리 갱신될 것이다. 또한 WPFB는 뛰어난 분해능을 가지고 있어서 아주 미세한 소음까지도 처리해 낼 수가 있다. 이 제어기법의 효율성은 simulation을 통해 증명될 것이다.

  • PDF

Distributed opportunistic packet scheduling for wireless ad-hoc network (무선 에드혹 네트워크에서 분산화된 opportunistic 패킷스케줄링)

  • Park, Hyung-Kun;Yu, Yun-Seop
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.204-206
    • /
    • 2009
  • Opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for ad-hoc network. In the proposed distributed scheduling scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed scheduling using extensive simulation and simulation results show that proposed scheduling obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

  • PDF

Redundancy Management of Brake-by-wire System using a Message Scheduling (메시지 스케줄링을 이용한 Brake-by-wire 시스템의 Redundancy Management)

  • Yune, J. W.;Kim, K. W.;Kim, T. Y.;Kim, J. G.;Lee, S.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.717-720
    • /
    • 2000
  • Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

  • PDF

Design of High-Speed VOQ Management Scheme for High Performance Cell/Packet Switch (고성능 셀/패킷 스위치를 위한 고속 VOQ 관리기 설계)

  • 정갑중;이범철
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.369-372
    • /
    • 2001
  • This paper presents the design of high-speed virtual output queue(VOQ) management scheme for high performance cell/packet switch, which has a serial cross bar structure. The proposed VOQ management scheme has been designed for wire-speed routing with a pipelined buffer management. It provides the tolerance of requests and grants data transmission latency between the VOQ manager and central arbiter using a new request control method that is based on a high-speed shifter. The designed VOQ manager has been implemented in a field programmable gate array chip with a 77MHz operating frequency, a 900-pin fine ball grid array package, and 16$\times$16 switch size.

  • PDF