• Title/Summary/Keyword: Random delay

Search Result 294, Processing Time 0.026 seconds

Mobile Sink Based Energy Efficient Path Setup Method for Wireless Sensor Networks (무선 센서 네트워크 환경에서 모바일 싱크를 이용한 에너지 효율적 경로 설정 방법)

  • Yang, Seung-Hyun;Lee, Soong-Yeol;Rho, Hai-Hwan;Son, Won-Kee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.11
    • /
    • pp.1068-1077
    • /
    • 2014
  • In this paper, we propose a novel method for path setup that optimizes energy consumptions for wireless sensor network. Existing studies usually generate paths according to Random way point approach so that it requires unnecessary energy consumptions for estimating location of the mobile sink node and transmission paths of packets. To address this problem, we propose a method that creates paths for mobile sink node using the Hilbert curve. Moreover, our method adjusts the path of the mobile sink node according to the density of sensor nodes to minimize data transmission delay. In our experiments, the proposed method outperforms existing work such as TTDD and CBPER by up to 50 times in terms of energy efficiency.

Optimized QCA SRAM cell and array in nanoscale based on multiplexer with energy and cost analysis

  • Moein Kianpour;Reza Sabbaghi-Nadooshan;Majid Mohammadi;Behzad Ebrahimi
    • Advances in nano research
    • /
    • v.15 no.6
    • /
    • pp.521-531
    • /
    • 2023
  • Quantum-dot cellular automata (QCA) has shown great potential in the nanoscale regime as a replacement for CMOS technology. This work presents a specific approach to static random-access memory (SRAM) cell based on 2:1 multiplexer, 4-bit SRAM array, and 32-bit SRAM array in QCA. By utilizing the proposed SRAM array, a single-layer 16×32-bit SRAM with the read/write capability is presented using an optimized signal distribution network (SDN) crossover technique. In the present study, an extremely-optimized 2:1 multiplexer is proposed, which is used to implement an extremely-optimized SRAM cell. The results of simulation show the superiority of the proposed 2:1 multiplexer and SRAM cell. This study also provides a more efficient and accurate method for calculating QCA costs. The proposed extremely-optimized SRAM cell and SRAM arrays are advantageous in terms of complexity, delay, area, and QCA cost parameters in comparison with previous designs in QCA, CMOS, and FinFET technologies. Moreover, compared to previous designs in QCA and FinFET technologies, the proposed structure saves total energy consisting of overall energy consumption, switching energy dissipation, and leakage energy dissipation. The energy and structural analyses of the proposed scheme are performed in QCAPro and QCADesigner 2.0.3 tools. According to the simulation results and comparison with previous high-quality studies based on QCA and FinFET design approaches, the proposed SRAM reduces the overall energy consumption by 25%, occupies 33% smaller area, and requires 15% fewer cells. Moreover, the QCA cost is reduced by 35% compared to outstanding designs in the literature.

Achieving Relative Loss Differentiation using D-VQSDDP with Differential Drop Probability (차별적이니 드랍-확률을 갖는 동적-VQSDDP를 이용한 상대적 손실차별화의 달성)

  • Kyung-Rae Cho;Ja-Whan Koo;Jin-Wook Chung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1332-1335
    • /
    • 2008
  • In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (maxth, minth, maxp) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static maxp parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore maxp parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

Blockchain-based Important Information Management Techniques for IoT Environment (IoT 환경을 위한 블록체인 기반의 중요 정보 관리 기법)

  • Yoon-Su Jeong
    • Advanced Industrial SCIence
    • /
    • v.3 no.1
    • /
    • pp.30-36
    • /
    • 2024
  • Recently, the Internet of Things (IoT), which has been applied to various industrial fields, is constantly evolving in the process of automation and digitization. However, in the network where IoT devices are built, research on IoT critical information-related data sharing, personal information protection, and data integrity among intermediate nodes is still being actively studied. In this study, we propose a blockchain-based IoT critical information management technique that is easy to implement without burdening the intermediate node in the network environment where IoT is built. The proposed technique allocates a random value of a random size to the IoT critical information arriving at the intermediate node and manages it to become a decentralized P2P blockchain. In addition, the proposed technique makes it easier to manage IoT critical data by creating licenses such as time limit and device limitation according to the weight condition of IoT critical information. Performance evaluation and proposed techniques have improved delay time and processing time by 7.6% and 10.1% on average compared to existing techniques.

Study on a Neural UPC by a Multiplexer Information in ATM (ATM 망에서 다중화기 정보에 의한 Neural UPC에 관한 연구)

  • Kim, Young-Chul;Pyun, Jae-Young;Seo, Hyun-Seung
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.7
    • /
    • pp.36-45
    • /
    • 1999
  • In order to control the flow of traffics in ATM networks and optimize the usage of network resources, an efficient control mechanism is necessary to cope with congestion and prevent the degradation of network performance caused by congestion. In this paper, Buffered Leaky Bucket which applies the same control scheme to a variety of traffics requiring the different QoS(Quality of Service) and Neural Networks lead to the effective buffer utilization and QoS enhancement in aspects of cell loss rate and mean transfer delay. And the cell scheduling algorithms such as DWRR and DWEDF for multiplexing the incoming traffics are enhanced to get the better fair delay. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate and buffer threshold are changed by the predicted values. The prediction of traffic loss rate by neural networks can enhance efficiency in controlling the cell loss rate and cell transfer delay of next incoming cells and also be applied for other traffic controlling schemes. Computer simulation results performed for random cell generation and traffic prediction show that QoSs of the various kinds of traffcis are increased.

  • PDF

A Shortest Path Algorithm Considering Directional Delays at Signalized Intersection (신호교차로에서 방향별 지체를 고려한 최적경로탐색 연구)

  • Min, Keun-Hong;Jo, Mi-Jeong;Kho, Seung-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.3
    • /
    • pp.12-19
    • /
    • 2010
  • In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

Introduction to Chaos Analysis Method of Time Series Signal: With Priority Given to Oceanic Underwater Ambient Noise Signal (시계열 신호의 흔돈분석 기법 소개: 해양 수중소음 신호를 중심으로)

  • Choi, Bok-Kyoung;Kim, Bong-Chae;Shin, Chang-Woong
    • Ocean and Polar Research
    • /
    • v.28 no.4
    • /
    • pp.459-465
    • /
    • 2006
  • Ambient noise as a background noise in the ocean has been well known for its the various and irregular signal characteristics. Generally, these signals we treated as noise and they are analyzed through stochastical level if they don't include definite sinusoidal signals. This study is to see how ocean ambient noise can be analyzed by the chaotic analysis technique. The chaotic analysis is carried out with underwater ambient noise obtained in areas near the Korean Peninsula. The calculated physical parameters of time series signal are as follows: histogram, self-correlation coefficient, delay time, frequency spectrum, sonogram, return map, embedding dimension, correlation dimension, Lyapunov exponent, etc. We investigate the chaotic pattern of noises from these parameters. From the embedding dimensions of underwater noises, the assesment of underwater noise by chaotic analysis shows similar results if they don't include a definite sinusoidal signal. However, the values of Lyapunov exponent (divergence exponent) are smaller than that of random noise signal. As a result we confirm the possibility of classification of underwater noise using Lyapunov analysis.

A Study on 2-Dimensional Sound Source Tracking System III - mainly on digital signal processing - (2차원적 음원추적에 관한 연구III - 디지털 신호처리를 중심으로 -)

  • 문성배;전승환
    • Journal of the Korean Institute of Navigation
    • /
    • v.24 no.5
    • /
    • pp.443-450
    • /
    • 2000
  • Before some experiments were carried out with analog bandpass filter which used for filtering the noise included in sound source signal. And this filter was constituted by condenser, register and operational amplifier. Hut these elements made the phase characteristics to differentiate in each sensing channel and cause a little of measurement error. We made new measurement system that was substituted digital filter for the analog filter in order to develop the optimal system which could find the time delay between each sensors with high accuracy. This paper describes the new system's constitution and the function of each parts. Specially three digital filters were designed and applied to the digital signal processing Part. And a series of experiments were carried out with the source's distance 9.53meters and the random bearing interval within the limits of $0^{\circ}$ ~ $180^{\circ}$. As a result, we have recognized that the accuracy of measurements were differentiated by the methods what kind of digital filter were adopted. And we have confirmed the facts that IIR LPF was suitable for sound source's bearing measurement and FIR LPF reduced the range measurement error.

  • PDF

Evoked Potential Estimation using the Iterated Bispectrum and Correlation Analysis (Bispectrum 및 Correlation 을 이용한 뇌유발전위 검출)

  • Han, S.W.;Ahn, C.B.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1994 no.12
    • /
    • pp.113-116
    • /
    • 1994
  • Estimation of the evoked potential using the iterated bispectrum and cross-correlation (IBC) has been tried for both simulation and real clinical data. Conventional time average (TA) method suffers from synchronization error when the latency time of the evoked potential is random, which results in poor SNR distortion in the estimation of EP waveform. Instead of EP signal average in time domain, bispectrum is used which is insensitive to time delay. The EP signal is recovered by the inverse transform of the Fourier amplitude and phase obtained from the bispectrum. The distribution of the latency time is calculated using cross-correlation between EP signal estimated by the bispectrum and the acquired signal. For the simulation. EEG noise was added to the known EP signal and the EP signal was estimated by both the conventional technique and bispectrum technique. The proposed bispectrum technique estimates EP signal more accurately than the conventional technique with respect to the maximum amplitude of a signal, full width at half maximum(FWHM). signal-to-noise-ratio, and the position of maximum peak. When applied to the real visual evoked potential(VEP) signal. bispectrum technique was able to estimate EP signal more distinctively. The distribution of the latency time may play an important role in medical diagonosis.

  • PDF

The Performance Analysis of the DDFS to drive PLL (PLL을 구동하기 위한 DDFS의 성능분석)

  • 손종원;박창규;김수욱
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.8
    • /
    • pp.1283-1291
    • /
    • 2002
  • In this paper, the PLL driven by the DDFS is designed on the schematic using the Q-logic cell based library and is implemented using FPGA QL32 x16B. The measurement results of the frequency synthesizer switching speed were agreement with a register. The simulated results show that the clock delay was generated after eleven clock and if input is random, It has influence on output DA converter has to be very extensive. Therefore, the DDFS used noise shaper to drive PLL by regular interval for input state. Also the bandwidth of DA converter very extensive, the simulation shows that the variation of small input control word is better than the switching speed of PLL.