• Title/Summary/Keyword: traffic adaptive

Search Result 504, Processing Time 0.029 seconds

An Adaptive Dead Reckoning Algorithm using Update Lifetime (유효갱신기간에 기반한 가변 데드레코닝 알고리즘)

  • 유석종;정혜원;최윤철
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2000.04a
    • /
    • pp.449-452
    • /
    • 2000
  • This paper proposes a new, adaptive Dead Reckoning model, called Dynamic Dead Reckoning , for Distributed Interactive Simulation and humanoid avatar systems. The proposed model can overcome the weak points of traditional Dead Reckoning caused by a fixed threshold and strong dependency on rotation event. This paper introduces new criteria for update message filtering , named as Update lifetime. The Dynamic Dead Reckoning keeps the balance between extrapolation fidelity and filtering performance by two component models, Variable Threshold Mechanism and Rotation Event model. The experimental results show that the proposed model can lower the increment rate of update traffic to the increase of rotation frequency without any significant loss of accuracy.

  • PDF

Adaptive Bandwidth Allocation for QoS Guaranteed VLC Based WPAN

  • Saha, Nirzhar;Mondal, Ratan Kumar;Jang, Yeong Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.8
    • /
    • pp.719-724
    • /
    • 2013
  • Visible light communication based wireless personal area network (WPAN) has recently remained in the center of attention, as it shows a lot of promise to a be a perfect replacement for the contemporary Radio frequency (RF) communication at least in the indoor environment. A commercially deployable VLC based WPAN must support diverse traffic requirement for different kinds of service. In this paper, we have proposed an innovative bandwidth allocation scheme for VLC based WPAN. We wish to allocate bandwidth adaptively for users in a network where bandwidth for each user is allocated scalably. Our aim is to allow maximum number of users in a VLC based WPAN where each user is guaranteed their required QoS. The simulation results justify that the proposed scheme is better than the conventional scheme.

Safety Evaluation of the Adaptive Cruise Control System (감응순항제어장치(ACC)의 안전성 평가)

  • Yong, Boo-Joong;Shim, So-Jung;Yoon, Kyong-Han
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.15 no.2
    • /
    • pp.159-164
    • /
    • 2007
  • The Advanced Safety Vehicle (ASV) allows drivers not only convenience and safety, but also many useful services provided by the Telematics technology. Since ASV is expected to be widely used in the near future, it is necessary to ensure the safety of ASV systems. Among several aspects of ASV, this paper investigates the safety of the Adaptive Cruise Control (ACC) system. Field tests are carried out under the domestic roadway and traffic conditions, according to International Standard Organization (ISO) requirements for ACC. The test data are analyzed whether the requirements are adequate for domestic circumstances, and the suggestions for findings are given.

On the Carrier Spacing for Mobile Multimedia Systems

  • Hong Een-Kee;Yun Sang-Hyuck;Kim Jeong-Geun
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.182-186
    • /
    • 2006
  • Previous approaches to sizing the carrier spacing for voice-oriented cellular systems have been based on the outage requirement. However, such a design paradigm needs to be changed as the performance of most upcoming cellular systems employing adaptive modulation and coding (AMC) techniques is more sensitive to throughput than outage. In this paper, we propose a novel approach to determining the carrier spacing which is based on a throughput criterion. The proposed method reflects well the characteristics of throughput-sensitive cellular systems that transport multimedia traffic. Numerical results show that our approach requires less carrier spacing, thus leading to more efficient spectrum utilization.

Performance Analysis of Adaptive Link-Selection Scheme considering Buffer and Channel State Information (버퍼와 채널 상태를 고려한 적응형 링크선택 방안의 성능 분석)

  • Kim, Hyujun;Chung, Young-uk
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.402-407
    • /
    • 2018
  • Link selection strategy has been an important technical issues of relay network. In this paper, we introduce a link selection scheme in the bidirectional, buffer-aided relay network. Three kinds of information such as the states of the queue at the relay buffer, the qualities of the links, and the states of the queues at the user buffer are considered. Throughput and delay performance is evaluated under three cases with different available information.

Adaptive Nonlinear RED Algorithm for TCP Congestion Control

  • Park, Kyung-Joon;Park, Eun-Chan;Lim, Hyuk;Cho, Chong-Ho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.121.1-121
    • /
    • 2001
  • Congestion control is a critical issue in TCP networks, Recently, active queue management (AQM) was proposed for congestion control at routers. The random early detection RED algorithm is widely known in the AQM algorithms, We present an adaptive nonlinear RED (NRED) algorithm, which has nonlinear drop probability profile. The proposed algorithm enhanced the performance of the RED algorithm by the self-parameterization based on the traffic load Furthermore, the proposed algorithm can effectively adapt itself between he RED and the drop-tail queue management by adopting proper nonlinearity in the drop probability profile. Through simulation, we show the effectiveness of the proposed algorithm comparing with the drop-tail and the original RED algorithm.

  • PDF

New Adaptive Compandor for LTE Signal Compression Based on Spline Approximations

  • Velimirovic, Lazar Zoran;Maric, Svetislav
    • ETRI Journal
    • /
    • v.38 no.3
    • /
    • pp.463-468
    • /
    • 2016
  • With the constant increase in network traffic, wireless operators are finding it more challenging to keep network hardware costs to a minimum. At the same time, the energy cost associated with operating a network has increased proportionally. Therefore, the search for higher network capacity is simultaneously accompanied by the search for a cost-efficient network deployment. In this paper, we show that a saving in transmitted signal energy can be achieved at the signal design level by deploying very specific signal processing techniques. Using an orthogonal frequency-division multiplexing signal for Long-Term Evolution networks as an example, we utilize a novel non-uniform companding quantizer to save a transmitted signal energy. Our results show that by using non-uniform quantization it is possible to further optimize 4G wireless networks.

A Study on the Adaptive Erasure Node Algorithm for the DQDB Metropolitan Area Network (DQDB MAN을 위한 적응 소거노드 알고리듬에 관한 연구)

  • 김덕환;한치문;김대영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.5
    • /
    • pp.1-15
    • /
    • 1993
  • In DQDB networks, the bandwidth can be increased considerably be using the EN(Erasure Node) algorithms and DR(Destination Release) algorithms. However, the important issue in implementing them is using method of extra capacity fairly. To improve it, this paper proposes AEN(Adaptive Erasure Node) algorithm which erasure function is activated by network traffic load. Its functional architecture consists of SESM, RCSM, LMSM in addition to the basic DQDB state machines (DQSM, RQM). The SESM and RCSM state machines are placed in front of the DQSM and RQM state machines in order for the node to take advantage of the newly cleared slots. This paper also presents some simulation results showing the effect of AEN algorithm on access delay, throughput and segment erasing ratio in the single and multiple priority networks. The results show that the AEN algorithm offer the better performance characteristics than existing algorithms under overload conditions.

  • PDF

A Novel Adaptive Routing Scheme for the QoS-Based Multimedia Services in Mobile Ad-Hoc Networks

  • Lee, Chang-Bum;Kim, Young-Woong;Soh, Surng-Ryurl;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.4 no.2 s.7
    • /
    • pp.281-287
    • /
    • 2000
  • A mobile ad-hoc network is composed of only mobile nodes, which are distributed dynamically, without any wired backbone or centralized entities. Since the existing works on ad-hoc routing protocol are mostly biased toward a military application, we need a new routing scheme for a support of multimedia services in mobile ad-hoc networks. Therefore, we propose a novel scheme that can support a variety of traffic attributes and can be applicable to high-speed and multimedia data services in mobile ad-hoc networks by using adaptive transmission power level. As a result of simulation, the proposed scheme has better performance than conventional method, which is performed with uniform transmission power level, in view of route query delay time.

  • PDF

Adaptive GTS allocation scheme with applications for real-time Wireless Body Area Sensor Networks

  • Zhang, Xiaoli;Jin, Yongnu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1733-1751
    • /
    • 2015
  • The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.