• Title/Summary/Keyword: Collision Efficiency

Search Result 333, Processing Time 0.027 seconds

Estimation for the Number of Tags in the Slotted-ALOHA based RFID Systems

  • Quan, Chang-Hao;Mo, Hee-Sook;Choi, Gil-Young
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.203-206
    • /
    • 2005
  • Recently, the RFID(Radio Frequency Identification) technology has gained significant attention. One of the performance issues in RFID systems is to resolve the tag collision among responses from RFID tags. In this paper, we proposed a new scheme for estimation of the number of tags in the reader filed. The scheme is used by anti-collision algorithm to identify multiple tags efficiently. And we also present the simulation result that shows the proposed scheme to estimate tags efficiently and also to improve the systems efficiency.

  • PDF

Numerical Study of Particle Collection and Entrainment in Electrostatic Precipitator (집진기내 입자 포집과 비산 문제에 대한 수치적 연구)

  • Kim, Ju-Hyeon;Kweon, Soon-Cheol;Kwon, Ki-Hwan;Lee, Sang-Hwan;Lee, Ju-Hee
    • The KSFM Journal of Fluid Machinery
    • /
    • v.15 no.1
    • /
    • pp.27-35
    • /
    • 2012
  • A numerical simulation for particle collection efficiency in a wire-plate electrostatic precipitator (ESP) has been performed. Method of characteristics and finite differencing method (MOC-FDM) were employed to obtain electric field and space charge density, and lattice boltzmann method (LBM) was used to predict the Electrohydrodynamic (EHD) flow according to the ion convection. Large eddy simulation (LES) was considered for turbulent flow and particle simulation was performed by discrete element method (DEM) which considered field charging, electric force, drag force and wall-collision. One way coupling from FDM to LBM was used with small and low density particle assumption. When the charged particle collided with the collecting plate, particle-wall collision was calculated for re-entertainment effect and the effect of gravity force was considered.

A Revised Timing-sync Protocol for Sensor Networks by a Polling Method

  • Bae, Shi-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.8
    • /
    • pp.23-28
    • /
    • 2015
  • TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol for WSN(wireless sensor networks), was developed to provide higher synchronization accuracy and energy efficiency. So, TPSN's approach has been referenced by so many other WSN synchronization schemes till now. However, TPSN has a collision problem due to simultaneous transmission among competing nodes, which causes more network convergence delay for a network-wide synchronization. A Polling-based scheme for TPSN is proposed in this paper. The proposed scheme not only shortens network-wide synchronization time of TPSN, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

Fluid Dynamic Efficiency of an Anatomically Correct Total Cavopulmonary Connection: Flow Visualizations and Computational Fluid Dynamic Studies

  • Yun, S.H.;Kim, S.Y.;Kim, Y.H.
    • International Journal of Vascular Biomedical Engineering
    • /
    • v.2 no.1
    • /
    • pp.11-16
    • /
    • 2004
  • Both flow visualizations and computational fluid dynamics were performed to determine hemodynamics in a total cavopulmonary connection (TCPC) model for surgically correcting congenital heart defects. From magnetic resonance images, an anatomically correct glass model was fabricated to visualize steady flow. The total flow rates were 4, 6 and 8L/min and flow rates from SVC and IVC were 40:60. The flow split ratio between LPA and RPA was varied by 70:30, 60:40 and 50:50. A pressure-based finite-volume software was used to solve steady flow dynamics in TCPC models. Results showed that superior vena cava(SVC) and inferior vena cava(IVC) flow merged directly to the intra-atrial conduit, creating two large vortices. Significant swirl motions were observed in the intra-atrial conduit and pulmonary arteries. Flow collision or swirling flow resulted in energy loss in TCPC models. In addition, a large intra-atrial channel or a sharp bend in TCPC geometries could influence on energy losses. Energy conservation was efficient when flow rates in pulmonary branches were balanced. In order to increase energy efficiency in Fontan operations, it is necessary to remove a flow collision in the intra-atrial channel and a sharp bend in the pulmonary bifurcation.

  • PDF

Security Evaluation Against Collision-based Power Analysis on RSA Algorithm Adopted Exponent Splitting Method (지수 분할 기법이 적용된 RSA 알고리듬에 대한 충돌 전력 분석 공격 안전성 평가)

  • Ha, Jaecheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.5
    • /
    • pp.985-991
    • /
    • 2015
  • The user's secret key can be retrieved by various side channel leakage informations occurred during the execution of cryptographic RSA exponentiation algorithm which is embedded on a security device. The collision-based power analysis attack known as a serious side channel threat can be accomplished by finding some collision pairs on a RSA power consumption trace. Recently, an RSA exponentiation algorithm was proposed as a countermeasure which is based on the window method adopted combination of message blinding and exponent splitting. In this paper, we show that this countermeasure provides approximately $2^{53}$ attack complexity, much lower than $2^{98}$ insisted in the original article, when the window size is two.

Enhanced Anti-Collision Protocol for Identification Systems: Binary Slotted Query Tree Algorithm

  • Le, Nam-Tuan;Choi, Sun-Woong;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9B
    • /
    • pp.1092-1097
    • /
    • 2011
  • An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

A Stack Bit-by-Bit Algorithm for RFID Multi-Tag Identification (RFID 다중 태그 인식을 위한 스택 Bit-By-Bit 알고리즘)

  • Lee, Jae-Ku;Yoo, Dae-Suk;Choi, Seung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8A
    • /
    • pp.847-857
    • /
    • 2007
  • For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. A Bit-by-Bit algorithm is defined by Auto ID Class 0. In this paper, we propose a SBBB(Stack Bit-by-Bit) algorithm. The SBBB algorithm save the collision position and makes a query using the saved data. SBBB improve the efficiency of collision resolution. We show the performance of the SBBB algorithm by simulation. The performance of the proposed algorithm is higher than that of BBB algorithm. Especially, the more each tag bit streams are the duplicate, the higher performance is.

A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System (RFID시스템에서 슬롯의 혼잡도를 이용한 DFS-ALOHA 알고리즘)

  • Lee, Jae-Ku;Choi, Seung-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.267-274
    • /
    • 2009
  • For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.

Analysis of Controlling the Size of Microbubble in DAF (DAF에서 기포의 크기제어 및 영향분석)

  • Dockko, Seok;Kwak, Dong-Heui;Kim, Young-Hwan
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.18 no.2
    • /
    • pp.235-241
    • /
    • 2004
  • The dissolved air flotation (DAF) process has been widely used for removing suspended solids with low density in water. It has been known as measuring the size of microbubbles precisely which move upward rapidly in contact zone is difficult. In this study particle counter monitoring (PCM) method is used to measure the rising microbubble after injection from a nozzle. Size and distribution curve of microbubbles are evaluated at different conditions such as pressure drop at intermediate valve, length of pipeline between saturation tank and nozzle and low pressure. And the efficiency is also checked when it collides with different size floc. The experimental results show the following fact. As the final pressure drop occurred closer to a nozzle, the bubble size became smaller. And small bubble collides with large floc as well as small one because of its physical characteristic. However large bubble collides well with large floc rather than small one since hydrodynamic flow in streamline interferes to collide between two. With performing computational process by mathematical model we have analyzed and verified the size effect between bubble and floc. Collision efficiency is the highest when P/B ratio shows in the range of 0.75 < P/B ratio ($R_{particle/Rbubble}$) < 2.0.

A Study on Anti-collision Algorithm in Gen2 Protocol Based RFID Systems (Gen2기반 RFID시스템에서의 충돌방지 알고리즘에 관한 연구)

  • Quan Cheng-Hao;Mo Hee-Sook;Choi Gil-Young;Pyo Cheol-Sig;Chae Jong-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6B
    • /
    • pp.561-571
    • /
    • 2006
  • RFID technology, as one contact-less identification technology with using electronic tag, is the field where its multiple researches have been studied. Especially, in the field of supply chain management, when it is necessary to identify a lot of objects by real-time, performance of anti-collision algorithm for multiple tag identification has an effect on performance of entire system. GEN2 is global, open, interoperability protocol for UHF RFID system, the active researches and developments are processed about it. In this paper, we introduce an anti-collision algorithm based on Slotted-ALOHA for GEN2 protocol, focus on estimating number of tags and setting number of slots and review the previous works. We propose new scheme that can estimate number of tags efficiently, and define system efficiency newly when it's used in setting number of slots. We also present result of compare and analysis with previous scheme through simulation. The proposed scheme of estimating number of tags is easy to implement, number of tags which is less than 4 times of number of slots can estimate tags efficiently, we also proved that identification efficiency based on weighted-slot distinguished with definition of previous slot efficiency can improve system efficiency.