• Title/Summary/Keyword: delay metric

Search Result 93, Processing Time 0.034 seconds

Chaotic evaluation of material degradation time series signals of SA 508 Steel considering the hyperspace (초공간을 고려한 SA 508강의 재질열화 시계열 신호의 카오스성 평가)

  • 고준빈;윤인식;오상균;이영호
    • Journal of Welding and Joining
    • /
    • v.16 no.6
    • /
    • pp.86-96
    • /
    • 1998
  • This study proposes the analysis method of time series ultrasonic signal using the chaotic feature extraction for degradation extent evaluation. Features extracted from time series data using the chaotic time series signal analyze quantitatively degradation extent. For this purpose, analysis objective in this study is fractal dimension, lyapunov exponent, strange attractor on hyperspace. The lyapunov exponent is a measure of the rate at which nearby trajectories in phase space diverge. Chaotic trajectories have at least one positive lyapunov exponent. The fractal dimension appears as a metric space such as the phase space trajectory of a dynamical system. In experiment, fractal correlation) dimensions, lyapunov exponents, energy variation showed values of 2.217∼2.411, 0.097∼ 0.146, 1.601∼1.476 voltage according to degardation extent. The proposed chaotic feature extraction in this study can enhances precision ate of degradation extent evaluation from degradation extent results of the degraded materials (SA508 CL.3)

  • PDF

High Throughput Radix-4 SISO Decoding Architecture with Reduced Memory Requirement

  • Byun, Wooseok;Kim, Hyeji;Kim, Ji-Hoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.14 no.4
    • /
    • pp.407-418
    • /
    • 2014
  • As the high-throughput requirement in the next generation communication system increases, it becomes essential to implement high-throughput SISO (Soft-Input Soft-Output) decoder with minimal hardware resources. In this paper, we present the comparison results between cascaded radix-4 ACS (Add-Compare-Select) and LUT (Look-Up Table)-based radix-4 ACS in terms of delay, area, and power consumption. The hardware overhead incurred from the retiming technique used for high speed radix-4 ACS operation is also analyzed. According to the various analysis results, high-throughput radix-4 SISO decoding architecture based on simple path metric recovery circuit is proposed to minimize the hardware resources. The proposed architecture is implemented in 65 nm CMOS process and memory requirement and power consumption can be reduced up to 78% and 32%, respectively, while achieving high-throughput requirement.

A Design of Turbo Decoder for 3GPP using Log-MAP Algorithm (Log-MAP을 사용한 3GPP용 터보 복호기의 설계)

  • Kang, Heyng-Goo;Jeon, Heung-Woo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.533-536
    • /
    • 2005
  • MAP algorithm is known for optimal decoding algorithm of Turbo codes, but it has very large computational complexity and delay. Generally log-MAP algorithm is used in order to overcome the defect. In this paper we propose modified scheme of the state metric calculation block which can improve the computation speed in log-MAP decoder and simple linear offset unit without using LUT. The simulation results show that the operation speed of the proposed scheme is improved as compared with that of the past scheme.

  • PDF

An Improved Kademlia Protocol considering Available Bandwidth and Physical Distance in the Real-Time Environment (실시간 환경에서 가용 대역폭과 거리를 고려한 개선된 Kademlia 프로토콜)

  • Park, Jae-Wan;Maeng, Ju-Hyun;Lee, Dong-Hyuk;Joe, In-Whee
    • Annual Conference of KIPS
    • /
    • 2019.05a
    • /
    • pp.56-59
    • /
    • 2019
  • 분산 해시 테이블은 {Key-Value} 형태의 해시 테이블을 시스템 내 노드들이 나누어 가지는 분산 시스템이다. 분산 해시 테이블 중 Kademlia는 Binary Tree 구조를 통해 노드 확장성을 가지고 XOR Metric을 이용하여 빠른 노드 탐색으로 다양한 분야에서 활용되고 있다. 하지만 노드 탐색 시 실제 상황을 배제하고 논리적인 거리만을 고려하여 라우팅 경로를 설정한다는 문제점을 가진다. 본 연구에서는 이 문제를 해결하기 위해 노드 탐색 시 노드 간의 대역폭과 물리적 거리를 고려하여 라우팅 테이블을 생성하는 Kademlia의 효율적인 노드 탐색 기법을 제안한다. 기존의 Kademlia와 유사한 수치의 Lookup Success Ratio와 Lookup Overhead Rates를 보이지만, End-to-End Delay가 감소한 것을 시뮬레이션을 통해 확인하였다.

An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication (차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법)

  • Kim, Tae-Hwan;Kim, Hie-Cheol;Hong, Won-Kee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.571-582
    • /
    • 2007
  • Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

Trajectory Information-based Routing Protocol for Mobile Mesh Router in Wireless Mesh Networks (무선 메쉬 네트워크에서 이동 메쉬 라우터의 이동 경로 정보를 고려한 라우팅 프로토콜)

  • Cho, Yong-Jin;Jeong, Hong-Jong;Kim, Dong-Kyun;Ryu, Kwan-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.912-923
    • /
    • 2011
  • In this paper, we propose a routing protocol for WMNs to provide passengers in public transportation vehicles (e.g., bus and tram) with Internet access service. In order to support end users with a reliable Internet connection despite the mobility of vehicles, we assume that mesh router, called mobile mesh router (MMR), is installed in a vehicle and manages a route to Internet Gateway (IGW). We therefore propose an efficient routing protocol and its routing metric, called ETT-TR, considering trajectory information of vehicle as well as link quality in order to find a route between them. Using NS-2 simulations, we observe that our proposed routing protocol reduces the end-to-end delay and improves throughput performance.

User-Oriented Energy- and Spectral-Efficiency Tradeoff for Wireless Networks

  • Zhang, Yueying;Long, Hang;Peng, Yuexing;Zheng, Kan;Wang, Wenbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.216-233
    • /
    • 2013
  • Conventional optimization designs of wireless networks mainly focus on spectral efficiency (SE) as a performance metric. However, as diverse media services are emerging, a green wireless network, which not only meets the quality of experience (QoE) requirements for users and also improves energy efficiency (EE), is the most appropriate solution. In this paper, we firstly propose the unit QoE per Watt, which is termed QoE efficiency (QEE), as a user-oriented metric to evaluate EE for wireless networks. We then analyze which is the kind of wireless resource given priority to use under different scenarios to obtain an acceptable QEE. Particularly, power, delay and data-rate related to QoE are separately addressed for several typical services, such as file download, video stream and web browsing services. Next, the fundamental tradeoffs are investigated between QEE and SE for wireless networks. Our analytical results are helpful for network design and optimization to strike a good balance between the users perceived QoE and energy consumption.

TAILWIND: Mobility information based Routing for Delay Tolerant Network (이동 방향 정보를 이용한 DTN 라우팅: TAILWIND)

  • Cho, Seoik;Kim, Sunhyun;Moon, Soohoon;Han, Seungjae
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.408-412
    • /
    • 2015
  • In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

A Domain-based Reactive Routing Protocol for the Hybrid WMN (하이브리드 WMN을 위한 가상 도메인 기반의 반응형 라우팅 프로토콜)

  • Kim, Ho-Cheal
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.59-70
    • /
    • 2014
  • This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.

A Prediction Model on Freeway Accident Duration using AFT Survival Analysis (AFT 생존분석 기법을 이용한 고속도로 교통사고 지속시간 예측모형)

  • Jeong, Yeon-Sik;Song, Sang-Gyu;Choe, Gi-Ju
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.5
    • /
    • pp.135-148
    • /
    • 2007
  • Understanding the relation between characteristics of an accident and its duration is crucial for the efficient response of accidents and the reduction of total delay caused by accidents. Thus the objective of this study is to model accident duration using an AFT metric model. Although the log-logistic and log-normal AFT models were selected based on the previous studies and statistical theory, the log-logistic model was better fitted. Since the AFT model is commonly used for the purpose of prediction, the estimated model can be also used for the prediction of duration on freeways as soon as the base accident information is reported. Therefore, the predicted information will be directly useful to make some decisions regarding the resources needed to clear accident and dispatch crews as well as will lead to less traffic congestion and much saving the injured.