Research on a Dynamic Binary Stack Anti-Collision Algorithm

2012 ◽  
Vol 268-270 ◽  
pp. 1426-1431
Author(s):  
Jian Jun Yi ◽  
Fei Luo ◽  
Shao Li Chen ◽  
Bai Yang Ji ◽  
Hai Xu Yan
Keyword(s):  
The Other ◽  
Application System ◽  
Key Technology ◽  
Rfid Systems ◽  
Simulation Results ◽  
Better Than ◽  
Improved Algorithm

RFID anti-collision technology is one of a key technology in RFID application system. Anti-collision algorithms for RFID systems include tag anti-collision algorithms and reader anti-collision algorithms. This paper focused on the impoved binary algorithm and dynamic binary algorithm. An improved algorithm has been proposed, in which the collision bits was put into the stack and they were used as the reader’s request. Based on this mechanism, a novel binary stack algorithm has been proposed. Its simulation was given to analyze the performance of this algorithm. The simulation results showed that the amount of transmitted data in proposed algorithm was obviously less than those in the other two traditional algorithms with the number of tags and their bytes increasing. Consequently, the performance of the proposed algorithm is much better than that of the traditional anti-collision binary algorithm.

Simulation on Effect of Five Kinds of Belt Structures on Tire Performance

2012 ◽  
Vol 501 ◽  
pp. 151-155
Author(s):  
Yong Liu ◽  
Ge Zhang ◽  
Hua Yan ◽  
Yu Mei Ding ◽  
Wei Min Yang
Keyword(s):  
The Other ◽  
Molding Process ◽  
Simulation Results ◽  
Better Than

In this article, three kinds of belt named B, C and D type are invented, then their main performance are compared with the other two kinds of belt structures introduced in previous papers. Simulation results showed that B and D-type belts are better than the other three. Comparatively the latter needs less material, its molding process is easier, and the tire body is lighter than B type tire, so in general it can be considered that D-type belt is the best among the five kinds of belt structures.

A Study on RFID Anti-Collision Algorithm

2012 ◽  
Vol 468-471 ◽  
pp. 256-259
Author(s):  
Bin Miao
Keyword(s):  
Simulation Platform ◽  
Key Technology ◽  
Simulation Results ◽  
Improved Algorithm

Anti-collision technology is a key technology on RFID. This paper investigates some different anti-collision algorithm of RFID. And we establish a simulation platform to achieve the simulation of the anti-collision algorithm. This paper presents an improved algorithm on the DFSA anti-collision , which is based on analysis and comparisons of the simulation results. The improved DFSA algorithm can enhance the efficiency, according to the simulation results.

Performance Evaluation of Different Backoff Algorithms in IEEE 802.15.4 using Double Sensing

2017 ◽  
Vol 5 (2) ◽  
pp. 376
Author(s):  
Md. Mohibur Rahaman ◽  
Mohammad Khairul Islam ◽  
Kazi Ashrafuzzaman ◽  
Mohammad Sanaullah Chowdhury
Keyword(s):  
Performance Evaluation ◽  
Ieee 802.15.4 ◽  
The Other ◽  
Area Network ◽  
Exponential Increase ◽  
Exponential Decrease ◽  
Simulation Results ◽  
Personal Area Network ◽  
Low Rate ◽  
Better Than

<p>The IEEE 802.15.4 is the standard for Low Rate Wireless Personal Area network (LR-WPAN). It is widely used in many application areas. The standard uses Slotted CSMA/CA mechanism in its contention access period (CAP) for the beacon enabled mode. The protocol has two modes - single sensing (SS) and double sensing (DS). The protocol also adopts a binary exponential backoff (BEB) algorithm. In this paper, we explore the saturation throughput, delay and energy consumption of this standard with double sensing (DS) using the existing BEB algorithm. We also investigate three other backoff schemes - exponential increase exponential decrease (EIED), exponential increase linear decrease (EILD) and exponential increase multiplicative decrease (EIMD). From simulation results, it is found that the EIED, EILD, EIMD perform better than the BEB for higher loads. It shows that the EIED, EILD, EIMD have better throughput and lower delay than the BEB. The EIED outperforms the other schemes in terms of throughput, delay and energy for the higher loads.</p>

The Comparison among Three Control Charts for Monitoring the Auto Correlated Processes

2014 ◽  
Vol 490-491 ◽  
pp. 1579-1583
Author(s):  
Ming Jie Yang ◽  
Xue Min Zi
Keyword(s):  
Control Chart ◽  
Control Charts ◽  
The Other ◽  
First Order ◽  
Regressive Model ◽  
Auto Regressive ◽  
The Mean ◽  
Simulation Results ◽  
Auto Regressive Model ◽  
Better Than

We compare the ARL of three charts for monitoring the mean shifts of the first-order auto regressive model to choose a proper control chart. Simulation results show that the REWMA chart has a large superior to the EWMA and T2 the chart when -1<Ø<0, but when Ø>0, the chart is better than the other two charts.

An Optimization Algorithm Based on Brainstorming Process

2013 ◽  
pp. 137-166
Author(s):  
Yuhui Shi
Keyword(s):  
Optimization Algorithm ◽  
Information Entropy ◽  
The Other ◽  
Future Research ◽  
Brain Storm Optimization ◽  
Cluster Distance ◽  
Simulation Results ◽  
Better Than

In this paper, the human brainstorming process is modeled, based on which two versions of Brain Storm Optimization (BSO) algorithm are introduced. Simulation results show that both BSO algorithms perform reasonably well on ten benchmark functions, which validates the effectiveness and usefulness of the proposed BSO algorithms. Simulation results also show that one of the BSO algorithms, BSO-II, performs better than the other BSO algorithm, BSO-I, in general. Furthermore, average inter-cluster distance Dc and inter-cluster diversity De are defined, which can be used to measure and monitor the distribution of cluster centroids and information entropy of the population over iterations. Simulation results illustrate that further improvement could be achieved by taking advantage of information revealed by Dc and/or De, which points at one direction for future research on BSO algorithms.

An Optimization Algorithm Based on Brainstorming Process

2015 ◽  
pp. 1-35 ◽  
Author(s):  
Yuhui Shi
Keyword(s):  
Optimization Algorithm ◽  
Information Entropy ◽  
The Other ◽  
Future Research ◽  
Brain Storm Optimization ◽  
Cluster Distance ◽  
Simulation Results ◽  
Better Than

In this chapter, the human brainstorming process is modeled, based on which two versions of a Brain Storm Optimization (BSO) algorithm are introduced. Simulation results show that both BSO algorithms perform reasonably well on ten benchmark functions, which validates the effectiveness and usefulness of the proposed BSO algorithms. Simulation results also show that one of the BSO algorithms, BSO-II, performs better than the other BSO algorithm, BSO-I, in general. Furthermore, average inter-cluster distance Dc and inter-cluster diversity De are defined, which can be used to measure and monitor the distribution of cluster centroids and information entropy of the population over iterations. Simulation results illustrate that further improvement could be achieved by taking advantage of information revealed by Dc, which points at one direction for future research on BSO algorithms.

An Optimization Algorithm Based on Brainstorming Process

2011 ◽  
Vol 2 (4) ◽  
pp. 35-62 ◽  
Author(s):  
Yuhui Shi
Keyword(s):  
Optimization Algorithm ◽  
Information Entropy ◽  
The Other ◽  
Future Research ◽  
Brain Storm Optimization ◽  
Cluster Distance ◽  
Simulation Results ◽  
Better Than

In this paper, the human brainstorming process is modeled, based on which two versions of Brain Storm Optimization (BSO) algorithm are introduced. Simulation results show that both BSO algorithms perform reasonably well on ten benchmark functions, which validates the effectiveness and usefulness of the proposed BSO algorithms. Simulation results also show that one of the BSO algorithms, BSO-II, performs better than the other BSO algorithm, BSO-I, in general. Furthermore, average inter-cluster distance Dc and inter-cluster diversity De are defined, which can be used to measure and monitor the distribution of cluster centroids and information entropy of the population over iterations. Simulation results illustrate that further improvement could be achieved by taking advantage of information revealed by Dc and/or De, which points at one direction for future research on BSO algorithms.

Flood and Substance Transportation Analysis Using Satellite Elevation Data: A Case Study in Dhaka City, Bangladesh

2018 ◽  
Vol 13 (5) ◽  
pp. 967-977 ◽  
Author(s):  
Masakazu Hashimoto ◽  
Nozomu Yoneyama ◽  
Kenji Kawaike ◽  
Tomonori Deguchi ◽  
Mohammed Abed Hossain ◽  
...  
Keyword(s):  
The Other ◽  
Two Dimensional ◽  
Dhaka City ◽  
Flood Simulation ◽  
Aster Gdem ◽  
Elevation Data ◽  
Vertical Accuracy ◽  
Simulation Results ◽  
Better Than

This study investigated the vertical accuracy of satellite elevation data and its effect on flood and substance transportation analysis by using a two-dimensional flood simulation model. SRTM, AW3D, and ASTER GDEM satellite elevation data for East Dhaka, Bangladesh were used for evaluating the vertical accuracy and conducting numerical analyses. A case study in 2007 was simulated for the flooding analysis. The results showed that AW3D had the highest applicability because its vertical accuracy for low-lying areas was better than that of the other products. According to the differences in the flood extent of each satellite elevation data, the simulation results of the substance transportation analysis showed different spreading conditions. Furthermore, differences in the flood velocity and direction affected the distribution of the deposited substance.

scholarly journals Efficient Missing-Tag Event Detection Protocols to Cope with Unexpected Tags and Detection Error in RFID Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Chuyen T. Nguyen ◽  
Tuyen T. Hoang ◽  
Linh T. Hoang ◽  
Vu X. Phan
Keyword(s):  
Radio Frequency Identification ◽  
Event Detection ◽  
Optimal Parameter ◽  
The Other ◽  
Common Phenomenon ◽  
Detection Error ◽  
Error Performance ◽  
Rfid Systems ◽  
Frequency Identification ◽  
Simulation Results

This paper investigates the issue of missing-tag event detection in practical radio frequency identification (RFID) systems with the presence of not only unexpected tags but also the detection error. Among all the previous works, the recently proposed protocol “RFID monitoring with UNexpected tags (RUN)” is one of the first studies taking the unexpected tags into account. The protocol is proven to outperform conventional ones in terms of achieving a required reliability. Nevertheless, it completely ignores the effect of the so-called detection error, which is a common phenomenon in the literature of RFID, on tag reading. The phenomenon might result in the false-alarm detection of the event and it is believed that RUN is no longer efficient and reliable. We therefore propose two modified versions of the RUN protocol, namely, mRUN1 and mRUN2, as solutions for the issue. Similarly to RUN, the protocols execute multiple Aloha reading rounds to cope with the unexpected tags. On the other hand, they utilize tracking counters supposedly available at the reader to mitigate the effect of the detection error. While mRUN1 requires many counters to monitor the existence of each expected tag (the tag’s identity is already known), mRUN2 uses only one counter to deal with the event caused by either real missing tags or the detection error. Performance analysis will be investigated to find optimal parameter settings for the protocols. Computer simulation results are also provided to validate our analysis as well as to show the merit of the proposed protocols in comparison with the conventional protocols.

Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks

2014 ◽  
Vol 513-517 ◽  
pp. 1160-1164
Author(s):  
Shu Juan Huang ◽  
Yi An Zhu
Keyword(s):  
Scheduling Algorithm ◽  
The Other ◽  
Earliest Deadline First ◽  
Periodic Tasks ◽  
System Utilization ◽  
Simulation Results ◽  
Earliest Deadline ◽  
Better Than ◽  
Mixed Criticality

Nowadays, there are two approach in mixed-criticality scheduling. One is reservations-based approach such as EDF-VD(Earliest Deadline First-Virtual Deadline) and the Other is priority-based scheduling such as OCBP(Own Criticality Based Priority). This paper compared the two mixed-criticality scheduling algorithm from three aspects. The simulation results show that EDF-VD is better than OCBP in completed tasks and the system utilization, but in unmissed deadline ratio the later owns the better.

Sign in / Sign up

Export Citation Format

Share Document