• Title/Summary/Keyword: 전송주기

Search Result 852, Processing Time 0.027 seconds

Vibration Test for PCB/Connector Assembly (인쇄회로기판 진동이 커넥터에 미치는 영향)

  • 허남일;김성철;송규섭
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.160-164
    • /
    • 1995
  • 정보통신 시스템의 고속/고밀도화 요구에 따라 개발되고 있는 ATM(Asynchronous Transfer Mode) 교환기 시스템은 팬을 이용한 강제대류냉각 방식의 채택과 시스템이 설치되는 장소에 따른 여러 환경조건에 의한 진동 문제가 발생될 수 있다. 시스템의 진동으로 인한 피해중 커넥터 접촉부에서 전기적 특성의 변화는 고속으로 전송되는 신호의 왜곡을 유발시킬 수 있어 시스템 개발시 이에 대한 충분한 연구 및 시험이 요구되고 있다. 진동환경에서 커넥터 접촉부는 접촉면의 상대운동으로 인한 접촉저항의 증가와 순간적인 신호전달 중단을 가져오게 되며, 특히 PCB/Connector Assembly에서 커넥터 접촉부는 PCB(Printed Circuit Board)의 장착 조건 및 동적 거동에 따라 전기적 특성이 변할 수 있다. 시스템에서 커넥터의 동적 거동을 이해하기 위해서는 PCB를 포함하는 시스템내 여러 요소의 동적 특성 이해와 복잡한 해석과정이 요구되며, 시스템 개발자는 진동 환경에서 이것의 시험 결과에 따라 커넥터의 사용을 결정해야 할 것이다. 커넥터의 전기적 특성 시험법은 IEC, EIA드 여러 국제 규격에 제시되어 있으며, 본 연구의 대상이 된 ATM교환기 시스템에서 PCB/Connector Assembly의 진동환경에서 접촉저항 측정과 관련된 접촉저항 임계치 및 측정법은 IEEE 규격 및 Bellcore 규격에 규정되어 있다. Bellcore에는 주어진 진동시험주기 전후에 IEC 규격의 LLCR(Low Level Contact Resistance) 측정회로를 이용한 측정법이 규정되어 있고, 냉각팬 및 주위 환경진동이 가해지는 동안의 영향에 대한 시험법은 규정되어 있지 않다. 본 연구에서는 한국통신의 전자장비 운용환경시험 조건의 진동에서 ATM 교환기 시스템에 사용되는 PCB/Connector Assembly 커넥터 접촉부의 접촉저항 변화와 PCB 진동에 의한 영향을 시험하였다.proach)등이 제시되었고 평면파 영역에 한하여 해서되어져 왔다. 본 논문에서는 분할 접근 방법(Segmentation Approach)을 이용하여 다공 요소로 이루어진 소음기를 해석하는데 적용하였다.로 성능 및 안정도에 영향을 미치므로 주의 깊게 선정해야 한다. 방법의 실질적인 적용에는 어려움이 있다. 본 연구에서는 기존의 방법들의 단점을 극복할 수 있는 새로운 회귀적 모우드 변수 규명 방법을 개발하였다. 이는 Fassois와 Lee가 ARMAX모델의 계수를 효율적으로 추정하기 위하여 개발한 뱉치방법인 Suboptimum Maximum Likelihood 방법[5]를 기초로 하여 개발하였다. 개발된 방법의 장점은 응답 신호에 유색잡음이 존재하여도 모우드 변수들을 항상 정확하게 구할 수 있으며, 또한 알고리즘의 안정성이 보장된 것이다.. 여기서는 실험실 수준의 평 판모델을 제작하고 실제 현장에서 이루어질 수 있는 진동제어 구조물에 대 한 동적실험 및 FRS를 수행하는 과정과 동일하게 따름으로써 실제 발생할 수 있는 오차나 error를 실험실내의 차원에서 파악하여 진동원을 있는 구조 물에 대한 진동제어기술을 보유하고자 한다. 이용한 해마의 부피측정은 해마경화증 환자의 진단에 있어 육안적인 MR 진단이 어려운 제한된 경우에만 실제적 도움을 줄 수 있는 보조적인 방법으로 생각된다.ofile whereas relaxivity at high field is not affected by τS. On the other hand, the change in τV does not affect low field profile but strongly in fluences on both inflection fie이 and the maximum relaxivity value. The results shows a fluences on both inflection field and the maximum relaxivity v

  • PDF

Energy-Efficient Data-Aware Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 데이터 인지 라우팅 프로토콜)

  • Lee, Sung-Hyup;Kum, Dong-Won;Lee, Kang-Won;Cho, You-Ze
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.122-130
    • /
    • 2008
  • In many applications of wireless sensor networks, sensed data can be classified either normal or urgent data according to its time criticalness. Normal data such as periodic monitoring is loss and delay tolerant, but urgent data such as fire alarm is time critical and should be transferred to a sink with reliable. In this paper, by exploiting these data characteristics, we propose a novel energy-efficient data-aware routing protocol for wireless sensor networks, which provides a high reliability for urgent data and energy efficiency for normal data. In the proposed scheme, in order to enhance network survivability and reliability for urgent data, each sensor node forwards only urgent data when its residual battery level is below than a threshold. Also, the proposed scheme uses different data delivery mechanisms depending on the data type. The normal data is delivered to the sink using a single-path-based data forwarding mechanism to improve the energy-efficiency. Meanwhile, the urgent data is transmitted to the sink using a directional flooding mechanism to guarantee high reliability. Simulation results demonstrate that the proposed scheme could significantly improve the network lifetime, along with high reliability for urgent data delivery.

An Improvement of Implementation Method for Multi-Layer AHB BusMatrix (ML-AHB 버스 매트릭스 구현 방법의 개선)

  • Hwang Soo-Yun;Jhang Kyoung-Sun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.629-638
    • /
    • 2005
  • In the System on a Chip design, the on chip bus is one of the critical factors that decides the overall system performance. Especially, in the case or reusing the IPs such as processors, DSPs and multimedia IPs that requires higher bandwidth, the bandwidth problems of on chip bus are getting more serious. Recently ARM proposes the Multi-Layer AHB BusMatrix that is a highly efficient on chip bus to solve the bandwidth problems. The Multi-Layer AHB BusMatrix allows parallel access paths between multiple masters and slaves in a system. This is achieved by using a more complex interconnection matrix and gives the benefit of increased overall bus bandwidth, and a more flexible system architecture. However, there is one clock cycle delay for each master in existing Multi-Layer AHB BusMatrix whenever the master starts new transactions or changes the slave layers because of the Input Stage and arbitration logic realized with Moore type. In this paper, we improved the existing Multi-Layer AHB BusMatrix architecture to solve the one clock cycle delay problems and to reduce the area overhead of the Input Stage. With the elimination of the Input Stage and some restrictions on the arbitration scheme, we tan take away the one clock cycle delay and reduce the area overhead. Experimental results show that the end time of total bus transaction and the average latency time of improved Multi-Layer AHB BusMatrix are improved by $20\%\;and\;24\%$ respectively. in ease of executing a number of transactions by 4-beat incrementing burst type. Besides the total area and the clock period are reduced by $22\%\;and\;29\%$ respectively, compared with existing Multi-layer AHB BusMatrix.

A Content-Aware toad Balancing Technique Based on Histogram Transformation in a Cluster Web Server (클러스터 웹 서버 상에서 히스토그램 변환을 이용한 내용 기반 부하 분산 기법)

  • Hong Gi Ho;Kwon Chun Ja;Choi Hwang Kyu
    • Journal of Internet Computing and Services
    • /
    • v.6 no.2
    • /
    • pp.69-84
    • /
    • 2005
  • As the Internet users are increasing rapidly, a cluster web server system is attracted by many researchers and Internet service providers. The cluster web server has been developed to efficiently support a larger number of users as well as to provide high scalable and available system. In order to provide the high performance in the cluster web server, efficient load distribution is important, and recently many content-aware request distribution techniques have been proposed. In this paper, we propose a new content-aware load balancing technique that can evenly distribute the workload to each node in the cluster web server. The proposed technique is based on the hash histogram transformation, in which each URL entry of the web log file is hashed, and the access frequency and file size are accumulated as a histogram. Each user request is assigned into a node by mapping of (hashed value-server node) in the histogram transformation. In the proposed technique, the histogram is updated periodically and then the even distribution of user requests can be maintained continuously. In addition to the load balancing, our technique can exploit the cache effect to improve the performance. The simulation results show that the performance of our technique is quite better than that of the traditional round-robin method and we can improve the performance more than $10\%$ compared with the existing workload-aware load balancing(WARD) method.

  • PDF

On the Performance Analysis of Coherent Bandwidth in Underwater Channel Environments Using Beamforming Technologies Based on the Use of Measurement Data (측정 데이터를 이용한 빔형성기의 적용에 의한 수중 채널 환경에서의 상관 대역폭 분석)

  • Kim, Min-Sang;Cho, Dae-Young;Kim, Kye-Won;Lee, Tae-Seok;Park, Jong-Won;Lim, Yong-Gon;Ko, Hak-Lim
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.162-168
    • /
    • 2014
  • The OFDM system have been widely studied for the purpose of increasing data rate with more reliable communications in underwater channel environments. And it is possible only when the sub-carrier's bandwidth is smaller than the coherence bandwidth of channel in the underwater OFDM communication system. However, the size of the FFT for the OFDM system will be increased because the coherence bandwidth is as small as several tens of Hz in real underwater channel environments. Also, It is necessary to add a CP having a length longer than the rms delay spread of a channel. So the complexity of the system is increased and the data efficiency is reduced. Therefore, in this paper, we have studied the increase of the coherence bandwidth by adapting the beamforming technologies. To do this, we have collected data from real underwater channel environments and analyzed the coherence bandwidth when adapting the beamforming technologies. Analyzing the experimental data show that the coherence bandwidth by the beamforming technologies in underwater channel environments was greatly increased compared to that of a single sensor.

Epicenter Estimation Using Real-Time Event Packet of Quanterra digitizer (Quanterra 기록계의 실시간 이벤트 패킷을 이용한 진앙 추정)

  • Lim, In-Seub;Sheen, Dong-Hoon;Shin, Jin-Soo;Jung, Soon-Key
    • Geophysics and Geophysical Exploration
    • /
    • v.12 no.4
    • /
    • pp.316-327
    • /
    • 2009
  • A standard for national seismological observatory was proposed on 1999. Since then, Quanterra digitizer has been installed and is operating on almost all of seismic stations which belong to major seismic monitoring organizations. Quanterra digitizer produce and transmit real-time event packet and data packet. Characteristics of event packet and arrival time of each channel's data packet on data center were investigated. Packet selection criteria using signal to noise ratio (hereafter SNR) and signal period from real-time event packet based on 100 samples per second (hereafter sps) velocity data were developed. Estimation of epicenter using time information of the selected event packet were performed and tested. A series of experiment show that event packets were received approximately 3~4 second earlier than data packets and the number of event packet was only 0.3% compare to data packets. Just about 5% against all of event packets were selected as event packet were related P wave of real earthquake. Using the selected event packets we can estimate an epicenter with misfit less than 10 km within 20 sec for local earthquake over magnitude 2.5.

A Novel Transmitter and Receiver Design of CDSK-Based Chaos Communication System (CDSK 방식의 카오스 통신 시스템의 새로운 송·수신기 설계)

  • Lee, Jun-Hyun;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.24 no.10
    • /
    • pp.987-993
    • /
    • 2013
  • Chaos communication system has characteristics of non-periodic, non-predictability, broadband signal and easy implementation. Also, chaos communication system is sensitive to the initial value, because completely another signal is generated when initial value of chaos equation is changed subtly. By these characteristics, security of chaos communication system is generally evaluated better than other digital communication systems. However, BER(Bit Error Rate) performance is worse than other digital communication systems, because transmitter and receiver of existing chaos communication system are strongly influenced by reference signal and noise. So, studies in order to improve the BER performance of chaos communication system is continuously performed. In this paper, We will propose a new CDSK (Correlation Delay Shift Keying) receiver in order to improve the BER performance. After we compare to the performance of existing receiver and proposed receiver, BER performance of proposed receiver evaluate. A novel receiver has characteristic that BER performance is better than existing receiver. However, if existing transmitter is used, existing receiver is possible to recover information bits even though BER performance is bad. Therefore, we propose a novel CDSK transmitter in order to improve the security of proposed receiver. When information bits are transmitted by using proposed transmitter, existing receiver is impossible to recover information bits, and proposed receiver is possible to recover information bits.

Time Synchronization Algorithm using the Clock Drift Rate and Reference Signals Between Two Sensor Nodes (클럭 표류율과 기준 신호를 이용한 두 센서 노드간 시간 동기 알고리즘)

  • Kim, Hyoun-Soo;Jeon, Joong-Nam
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.51-56
    • /
    • 2009
  • Time synchronization algorithm in wireless sensor networks is essential to various applications such as object tracking, data encryption, duplicate detection, and precise TDMA scheduling. This paper describes CDRS that is a time synchronization algorithm using the Clock Drift rate and Reference Signals between two sensor nodes. CDRS is composed of two steps. At first step, the time correction is calculated using offset and the clock drift rate between the two nodes based on the LTS method. Two nodes become a synchronized state and the time variance can be compensated by the clock drift rate. At second step, the synchronization node transmits reference signals periodically. This reference signals are used to calculate the time difference between nodes. When this value exceeds the maximum error tolerance, the first step is performed again for resynchronization. The simulation results on the performance analysis show that the time accuracy of the proposed algorithm is improved, and the energy consumption is reduced 2.5 times compared to the time synchronization algorithm with only LTS, because CDRS reduces the number of message about 50% compared to LTS and reference signals do not use the data space for timestamp.

A Study for Hybrid Honeypot Systems (하이브리드 허니팟 시스템에 대한 연구)

  • Lee, Moon-Goo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.11
    • /
    • pp.127-133
    • /
    • 2014
  • In order to protect information asset from various malicious code, Honeypot system is implemented. Honeypot system is designed to elicit attacks so that internal system is not attacked or it is designed to collect malicious code information. However, existing honeypot system is designed for the purpose of collecting information, so it is designed to induce inflows of attackers positively by establishing disguised server or disguised client server and by providing disguised contents. In case of establishing disguised server, it should reinstall hardware in a cycle of one year because of frequent disk input and output. In case of establishing disguised client server, it has operating problem such as procuring professional labor force because it has a limit to automize the analysis of acquired information. To solve and supplement operating problem and previous problem of honeypot's hardware, this thesis suggested hybrid honeypot. Suggested hybrid honeypot has honeywall, analyzed server and combined console and it processes by categorizing attacking types into two types. It is designed that disguise (inducement) and false response (emulation) are connected to common switch area to operate high level interaction server, which is type 1 and low level interaction server, which is type 2. This hybrid honeypot operates low level honeypot and high level honeypot. Analysis server converts hacking types into hash value and separates it into correlation analysis algorithm and sends it to honeywall. Integrated monitoring console implements continuous monitoring, so it is expected that not only analyzing information about recent hacking method and attacking tool but also it provides effects of anticipative security response.

A New Presence Lists Service in SIP Environment (SIP 환경에서의 새로운 프레즌스 리스트 서비스)

  • Jang, Choon-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.12
    • /
    • pp.67-73
    • /
    • 2010
  • In SIP(Session Initiation Protocol) environment, the presence event notification operation makes presence service user to recognize presence information status changes of the other party. In conventional method, the user should send each SIP SUBSCRIBE message containing the address of the other party to the presence server. Furthermore each presence subscription requires refresh messages, and the amount of notification messages from the other party becomes large. These facts increases network traffic and the load of presence server. In this paper, to solve these problems a new presence list service has been suggested. It uses a presence list consists of URI of the other party and make it possible to subscribe by using one SUBSCRIBE message. So this method decreases the amount of SUBSCRIBE messages and refresh messages, and it also decreases the amount processing event notification messages from the subscribed the other party. And to increase the efficiency, a presence filtering method which enables to include some parts of selected presence information into the notification message body has been also suggested. The implemented system can reduce SIP message related network traffic and message processing time of the presence server. The performance of this proposed system has been evaluated by experiments, and the results showed decreasing of server processing time.