• Title/Summary/Keyword: Adaptive CA Algorithm

Search Result 12, Processing Time 0.023 seconds

Performance Evaluation of an Adaptive Collision Avoidance Algorithm for IEEE 802.15.4 (IEEE 802.15.4에서 적응적 충돌 회피 알고리즘의 성능분석)

  • Noh, Ki-Chul;Lee, Seung-Yeon;Shin, Youn-Soon;Ahn, Jong-Suk;Lee, Kang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3A
    • /
    • pp.267-277
    • /
    • 2011
  • Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

Flaw Detection of Ultrasonic NDT in Heat Treated Environment Using WLMS Adaptive Filter (열처리 환경에서 웨이브렛 적응 필터를 이용한 초음파 비파괴 검사의 결함 검출)

  • 임내묵;전창익;김성환
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.7
    • /
    • pp.45-55
    • /
    • 1999
  • In this paper, we used the WLMS(Wavelet domain Least Mean Square) adaptive filter based on the wavelet transform to cancel grain noise. Usually, grain noise occurs in changes of the crystalline structure of metals in high temperature environment. It makes the detection of flaw difficult. The WLMS adaptive filtering algorithm establishes the faster convergence rate by orthogonalizaing the input vector of adaptive filter as compared with that of LMS adaptive filtering algorithm in time domain. We implemented the WLMS adaptive filter by using the delayed version of the primary input vector as the reference input vector and then implemented the CA-CFAR(Cell Averaging- Constant False Alarm Rate) threshold estimator. CA-CFAR threshold estimator enables to detect the flaw and back echo signals automatically. Here, we used the output signals of adaptive filter as its input signal. To Cow the statistical characteristic of ultrasonic signals corrupted by grain noise, we performed run test. The results showed that ultrasonic signals are nonstationary signal, that is, signals whose statistical properties vary with time. The performance of each filter is appreciated by the signal-to-noise ratio. After LMS adaptive filtering in time domain, SNR improves to about 2-3㏈ but after WLMS adaptive filtering in wavelet domain, SNR improves to about 4-6㏈.

  • PDF

A force-Guided Control with Adaptive Accommodation Bor Complex Assembly

  • Sungchul Kang;Kim, Munsang;Lee, Chong W.;Lee, Kyo-Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.14-19
    • /
    • 1998
  • In this paper, a target approachable force-guided control with adaptive accommodation for the complex assembly is presented. The complex assembly (CA) is defined as a task which deals with complex shaped parts including concavity or whose environment is so complex that unexpected contacts occur frequently during insertion. CA tasks are encountered frequently in the field of the manufacturing automation and various robot applications. To make CA successful, both the bounded wrench condition and the target approachability condition should be satisfied simultaneously during insertion. By applying the convex optimization technique, an optimum target approaching twist can be determined at each instantaneous contact state as a global minimum solution. Incorporated with an admissible perturbation method, a new CA algorithm using only the sensed resultant wrench and the target twist is developed without motion planning nor contact analysis which requires the geometry of the part and the environment. Finally, a VME-bus based real-time control system is built to experiment various CA task. T-insertion task as a planar CA and double-peg assembly task as a spacial assembly were successfully executed by implementing the new force-guided control with adaptive accommodation.

  • PDF

An Adaptive Back-off Algorithm in Beacon-Enabled LR-WPAN (비콘 기반 저속 WPAN에서의 적응적 백오프 알고리즘)

  • Park, Sung-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.8
    • /
    • pp.735-742
    • /
    • 2016
  • The Low-Rate WPAN is a short range wireless networking technology characterized by low-rate, low-power, low complexity and low-cost. The LR-WPAN controls wireless channel access among network devices based on the contention-based CSMA/CA algorithm. Therefore, frame collisions may take place at any time, leading to the severe degradation of network performance. This paper proposes a new algorithm that changes back-off periods adaptively in the CSMA/CA process depending on network conditions, resulting in the reduction of frame collisions. Throughout extensive simulations, it turns out that varying the back-off periods dynamically shows better performance than maintaining the fixed back-off periods.

Distributed Carrier Aggregation in Small Cell Networks: A Game-theoretic Approach

  • Zhang, Yuanhui;Kan, Chunrong;Xu, Kun;Xu, Yuhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4799-4818
    • /
    • 2015
  • In this paper, we investigate the problem of achieving global optimization for distributed carrier aggregation (CA) in small cell networks, using a game theoretic solution. To cope with the local interference and the distinct cost of intra-band and inter-band CA, we propose a non-cooperation game which is proved as an exact potential game. Furthermore, we propose a spatial adaptive play learning algorithm with heterogeneous learning parameters to converge towards NE of the game. In this algorithm, heterogeneous learning parameters are introduced to accelerate the convergence speed. It is shown that with the proposed game-theoretic approach, global optimization is achieved with local information exchange. Simulation results validate the effectivity of the proposed game-theoretic CA approach.

Design of a Full-range Adaptive Cruise Control Algorithm with Collision Avoidance (전구간 주행 및 충돌회피 제어 알고리즘 설계)

  • Moon, Seung-Wuk;Yi, Kyong-Su
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.849-854
    • /
    • 2007
  • This paper describes design and tuning of a full-range Adaptive Cruise Control (ACC) with collision avoidance. The control scheme is designed to control the vehicle so that it would feel natural to the human driver and passengers during normal safe driving situations and to avoid rear-end collision in vehicle following situations. In this study, driving situations are determined using a non-dimensional warning index and time-to-collision (TTC). A confusion matrix method based on natural driving data sets was used to tune control parameters in the proposed ACC System. An ECU-Brake Hardware-in-the-loop Simulation (HiLS) was developed and used for an evaluation of ACC System. The ECU-Brake HiLS results for alternative driving situation are compared to manual driving data measured on actual traffic way. The ACC/CA control logic implemented in an ECU was tested using the ECU-Brake HiLS in a real vehicle environment.

  • PDF

MDA-SMAC: An Energy-Efficient Improved SMAC Protocol for Wireless Sensor Networks

  • Xu, Donghong;Wang, Ke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4754-4773
    • /
    • 2018
  • In sensor medium access control (SMAC) protocol, sensor nodes can only access the channel in the scheduling and listening period. However, this fixed working method may generate data latency and high conflict. To solve those problems, scheduling duty in the original SMAC protocol is divided into multiple small scheduling duties (micro duty MD). By applying different micro-dispersed contention channel, sensor nodes can reduce the collision probability of the data and thereby save energy. Based on the given micro-duty, this paper presents an adaptive duty cycle (DC) and back-off algorithm, aiming at detecting the fixed duty cycle in SMAC protocol. According to the given buffer queue length, sensor nodes dynamically change the duty cycle. In the context of low duty cycle and low flow, fair binary exponential back-off (F-BEB) algorithm is applied to reduce data latency. In the context of high duty cycle and high flow, capture avoidance binary exponential back-off (CA-BEB) algorithm is used to further reduce the conflict probability for saving energy consumption. Based on the above two contexts, we propose an improved SMAC protocol, micro duty adaptive SMAC protocol (MDA-SMAC). Comparing the performance between MDA-SMAC protocol and SMAC protocol on the NS-2 simulation platform, the results show that, MDA-SMAC protocol performs better in terms of energy consumption, latency and effective throughput than SMAC protocol, especially in the condition of more crowded network traffic and more sensor nodes.

Analysis of the Generalized Order Statistics Constant False Alarm Rate Detector

  • Kim, Chang-Joo;Lee, Hwang-Soo
    • ETRI Journal
    • /
    • v.16 no.1
    • /
    • pp.17-34
    • /
    • 1994
  • In this paper, we present an architecture of the constant false alarm rate (CFAR) detector called the generalized order statistics (GOS) CFAR detector, which covers various order statistics (OS) and cell-averaging (CA) CFAR detectors as special cases. For the proposed GOS CFAR detector, we obtain unified formulas for the false alarm and detection probabilities. By properly choosing coefficients of the GOS CFAR detector, one can utilize any combination of ordered samples to estimate the background noise level. Thus, if we use a reference window of size N, we can realize $(2^N-1)$ kinds of CFAR processors and obtain their performances from the unified formulas. Some examples are the CA, the OS, the censored mean level, and the trimmed mean CFAR detectors. As an application of the GOS CFAR detector to multiple target detection, we propose an algorithm called the adaptive mean level detector, which censors adaptively the interfering target returns in a reference window.

  • PDF

The IEEE 802.15.4e based Distributed Scheduling Mechanism for the Energy Efficiency of Industrial Wireless Sensor Networks (IEEE 802.15.4e DSME 기반 산업용 무선 센서 네트워크에서의 전력소모 절감을 위한 분산 스케줄링 기법 연구)

  • Lee, Yun-Sung;Chung, Sang-Hwa
    • Journal of KIISE
    • /
    • v.44 no.2
    • /
    • pp.213-222
    • /
    • 2017
  • The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.

Performance Evaluation of the Tumor Tracking Method Using Beam on/off Interface for the Treatment of Irregular Breathing (호흡이 불규칙한 환자의 치료를 위한 Beam on/off Interface를 이용한 종양 추적 치료 방법의 성능 평가)

  • Lee, Minsik
    • Journal of the Korean Society of Radiology
    • /
    • v.12 no.3
    • /
    • pp.343-349
    • /
    • 2018
  • Dose rate regulated tracking is known to be an efficient method which adaptively delivers tracking treatments when patient breathing is irregular. The Motion Management Interface (MMI, Varian Medical System, CA), which provides beam on/off switching during treatment is available for clinic. Study is to test if delivering the adaptive tumor tracking is feasible for irregular breathing using beam switching with MMI. 55 free breathing RPM traces acquired from lung cancer patients are used. The first day RPM traces of the patients are utilized to design preprogrammed tracking MLC patterns, of which periods are intentionally reduced by 20% in order to catch up the variation of patient breathing irregularity in the treatment day. Eligibility criteria for this technique are the variation of amplitude and period less than 20%. An algorithm which determines beam on/off every 100 ms by considering the preprogrammed (MLC) positions and current breathing positions is developed. Tracking error and delivery efficacy are calculated by simulating the beam-switching adaptive tracking from the RPM traces. Breathing patterns of 38 patients (70%) met the eligibility criteria. Tracking errors of all of the cases who meet the criteria are less than 2 mm (average 1.4 mm) and the average delivery efficacy was 71%. Those of rest of the cases are 1.9 mm and 48%. Adaptive tracking with beam switching is feasible if patient selection is based on the eligibility criteria.