• Title/Summary/Keyword: packet loss

Search Result 975, Processing Time 0.027 seconds

Performance Improvement of Packet Loss Concealment Algorithm in G.711 Using Adaptive Signal Scale Estimation (적응적 신호 크기 예측을 이용한 G.711 패킷 손실 은닉 알고리즘의 성능향상)

  • Kim, Tae-Ha;Lee, In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.34 no.5
    • /
    • pp.403-409
    • /
    • 2015
  • In this paper, we propose Packet Loss Concealment (PLC) method using adaptive signal scale estimation for performance improvement of G.711 PLC. The conventional method controls a gain using 20 % attenuation factor when continuous loss occurs. However, this method lead to deterioration because that don't consider the change of signal. So, we propose gain control by adaptive signal scale estimation through before and after frame information using Least Mean Square (LMS) predictor. Performance evaluation of proposed algorithm is presented through Perceptual Evaluation of Speech Quality (PESQ) evaulation.

Frame Error Concealment Using Pixel Correlation in Overlapped Motion Compensation Regions

  • Duong, Dinh Trieu;Choi, Byeong-Doo;Hwang, Min-Cheol;Ko, Sung-Jea
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.21-30
    • /
    • 2009
  • In low bit-rate video transmission, the payload of a single packet can often contain a whole coded frame due to the high compression ratio in both spatial and temporal domains of most modern video coders. Thus, the loss of a single packet not only causes the loss of a whole frame, but also produces error propagation into subsequent frames. In this paper, we propose a novel whole frame error concealment algorithm which reconstructs the first of the subsequent frames instead of the current lost frame to suppress the effects of error propagation. In the proposed algorithm, we impose a constraint which uses side match distortion (SMD) and overlapped region difference (ORD) to estimate motion vectors between the target reconstructed frame and its reference frame. SMD measures the spatial smoothness connection between a block and its neighboring blocks. ORD is defined as the difference between the correlated pixels which are predicted from one reference pixel. Experimental results show that the proposed algorithm effectively suppresses error propagation and significantly outperforms other conventional techniques in terms of both peak signal-to-noise ratio performance and subjective visual quality.

  • PDF

Energy efficiency strategy for a general real-time wireless sensor platform

  • Chen, ZhiCong
    • Smart Structures and Systems
    • /
    • v.14 no.4
    • /
    • pp.617-641
    • /
    • 2014
  • The energy constraint is still a common issue for the practical application of wireless sensors, since they are usually powered by batteries which limit their lifetime. In this paper, a practical compound energy efficiency strategy is proposed and realized in the implementation of a real time wireless sensor platform. The platform is intended for wireless structural monitoring applications and consists of three parts, wireless sensing unit, base station and data acquisition and configuration software running in a computer within the Matlab environment. The high energy efficiency of the wireless sensor platform is achieved by a proposed adaptive radio transmission power control algorithm, and some straightforward methods, including adopting low power ICs and high efficient power management circuits, low duty cycle radio polling and switching off radio between two adjacent data packets' transmission. The adaptive transmission power control algorithm is based on the statistical average of the path loss estimations using a moving average filter. The algorithm is implemented in the wireless node and relies on the received signal strength feedback piggybacked in the ACK packet from the base station node to estimate the path loss. Therefore, it does not need any control packet overheads. Several experiments are carried out to investigate the link quality of radio channels, validate and evaluate the proposed adaptive transmission power control algorithm, including static and dynamic experiments.

Performance Improvement of IP Handover by Data Link Trigger (데이터링크 트리거에 의한 IP 핸드오버 성능 개선)

  • Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.55-60
    • /
    • 2016
  • In the traditional wireless LAN model, scan procedure to search a new AP starts when the predefined number of Rx failure of beacon frames are occurred. In this case, lots of data packet loss occur during MN's handover because loss of the relatively longer data packet starts before the small-sized beacon loss. Newly developed scanning mechanism in this paper has the beacon counter that increases when the Rx power level of beacon frame is less than the threshold and the previous rx power level. New scan procedure starts when the counter exceeds the predefined number. Beacon Rx power threshold is verified and performance of the new WLAN model is evaluated under UDP and TCP traffic environment.

Performance Improvement of Wireless Mesh Networks using TCP Congestion Control Algorithm (TCP 혼잡제어 알고리즘을 이용한 무선 메쉬 네트워크의 성능 개선)

  • Lee, Hye-Rim;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.2
    • /
    • pp.253-259
    • /
    • 2010
  • Wireless mesh network is flexible network like Ad hoc network or bluetooth together based on base station. But, wireless mesh network shows high packet loss and when TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. It is existent problem of TCP congestion control algorithm that TCP unfairness and congestion collapse over wireless mesh network. When TCP operation occurs with the packet loss where is not the congestion loss, it brings the performance degradation which is serious. In this paper, in order to improve efficient TCP congestion control algorithm in wireless mesh network, we proposed that TCP can adaptively regulate the congestion window in wireless link.

A priority control algorithm using hop count for streamming mode CLS (스트림 모드 CLS에서 홉 카운터를 이용한 우선 순위 제어 알고리즘)

  • 차현철;강상길;한기준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1840-1850
    • /
    • 1998
  • In this paper, we propose a priority control algorithm using hop count, called HC-PC(Priority Control Algorithm using Hop-Count) for steaming mode CLS, in wide area ATM networks. In our HC-PC algorithm, hop count of packet is increased by one as traverse CLS hop and is used as loss priority when a CLS buffer is congested. That guards packets with higher priority form congestion. The average packet loss probabilities are evaluated via mathematical analysis for HC-PC algorithm case and no priority control case. The simulationresults indicate that our algorithm may offer better performance in terms of loss fairness for pathe length and yield high utilization of newtork resource.

  • PDF

Design and Implementation of an Adaptive Synchronization Algorithm of the MPEG Stream for VOD Services (VOD 서비스를 위한 MPEG 스트림의 적응적 동기화 알고리즘 설계 및 구현)

  • Jo, Dae-Je;Lee, Yeong-Hu;Yoo, Kee-Young
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.5
    • /
    • pp.505-512
    • /
    • 2000
  • In this paper, an adaptive multimedia synchronization scheme for VOD (Video On Demand) services in internet environments is proposed. This scheme considers the characteristics of MPEG (Moving Picture Expert Group) system stream. Consequently, the intra-synchronization is handled at the pack layer, and the inter-synchronization is handled at the packet layer. The proposed scheme can cope adaptively with variation of packet loss, jitter and client's playback capacity. If there are variations of the packet loss or client's playback capacity, the server will change the transmission rate by selective picture skip. The client can then adjust and control the playback time according to the variation of the network jitter. Our experimental results show that the proposed scheme can quickly adapt to the network condition, and can guarantee a better quality of service than the other existing schemes.

  • PDF

A Steady State Analysis of TCP Rate Control Mechanism on Packet loss Environment (전송 에러를 고려한 TCP 트래픽 폭주제어 해석)

  • Kim, Dong-Whee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.1
    • /
    • pp.33-40
    • /
    • 2017
  • In this Paper, Analyse the Steady State Behavior of TCP and TFRC with Packet Error when both TCP and TFRC Flows Co-exist in the Network. First, Model the Network with TCP and TFRC Connections as a Discrete Time System. Second, Calculate Average Round Trip Time of the Packet Between Source and Destination on Packet Loss Environment. Then Derive the Steady State Performance i.e. Throughput of TCP and TFRC, and Average Buffer Size of RED Router Based on the Analytic Network Model. The Throughput of TCP and TFRC Connection Decrease Rapidly with the Growth of Sending Window Size and Their Transmission Rate but Their Declines become Smoothly when the Number of Sending Window Arrives on Threshold Value. The Average Queue Length of RED Router Increases Slowly on Low Transmission Rate but Increases Rapidly on High Transmission Rate.

An Efficient Network Mobility Handoff Scheme Based on Movement Pattern of a Train (이동예측이 가능한 철도차량의 이동성을 기반으로 한 네트워크 이동성 핸드오프 방안)

  • Lee, Il-Ho;Lee, Jun-Ho
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.6
    • /
    • pp.758-765
    • /
    • 2007
  • In this paper, we propose an efficient seamless handoff scheme to minimize packet loss and unnecessary packets on the Internet using the peculiar mobility characteristics of public vehicles such as trains. MR (Mobile Router) in a train visits each AR (Access Router) in the fixed order. As the MR detects reachability to the NAR (Next Access Router) on the new link, the PAR (Previous Access Router) can directly deliver packets from MR's HA (Home Agent) to the NAR according to the HML (Handoff Mobile router List). Then. the NAR buffers them until the MR finishes L3 (Layer 3) handoff procedure with the NAR. Therefore, our scheme can support a seamless handoff without the packet loss and unnecessary packets on the Internet. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance, compared with the NEMO basic support protocol and the Bi-casting protocol.

An Efficient QoS-Aware Bandwidth Re-Provisioning Scheme in a Next Generation Wireless Packet Transport Network (차세대 이동통신 패킷 수송망에서 서비스 품질을 고려한 효율적인 대역폭 재할당 기법)

  • Park, Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1A
    • /
    • pp.30-37
    • /
    • 2006
  • In this paper, we propose a QoS-aware efficient bandwidth re-provisioning scheme in a next generation wireless packet transport network. At the transport network layer, it classifies the traffic of the radio network layer into a real time class and a non-real time class. Using an auto-regressive time-series model and a given packet loss probability, our scheme predicts the needed bandwidth of the non-real time class at every re-provisioning interval. Our scheme increases the system capacity by releasing the unutilized bandwidth of the non-real time traffic class for the real-time traffic class while insuring a controllable upper bound on the packet loss probability of a non-real time traffic class. Through empirical evaluations using the real Internet traffic traces, our scheme is validated that it can increase the bandwidth efficiency while guaranteeing the quality of service requirements of the non-real time traffic class.