Modelling and Control of Liquid Level System

Control system modelling is difficult and delicate process. In most cases, the model cannot be obtained directly from the plant due to the complexity of the system components or the internal structure of the system is not sufficiently understood to allow analytical formulation of equations. On the other hand, the model can be proposed by investigating the dynamic characteristics of the system experimentally. In this study, a model of a liquid level system is to be derived. The experimental data was obtained by applying a step input and measuring the output response of the system. A transfer function was estimated by using curve fitting technique. This estimated model has been refined by tuning the parameters e.g. gain, time constant, natural frequency and damping ratio. Control design has also been carried out based on the model obtained through simulation. PD control has found to be superior compared to PID. The same parameter settings of the controllers was applied to the real plant and performance of the system under PD control was satisfactory. This also proved that the model derived was a good estimate of the real plant and it can be used for further control design

Novel binary search algorithm for fast tag detection in robust and secure RFID systems

Novel binary search algorithm for fast tag detection (BSF1) and (BSF2) in robust and secure RFID systems is presented in this paper. These algorithms introduce fast tag detection with the new method of inquiry. Tags were grouped in two groups and tag collisions of each group were solved by implementing dynamic searching and backtracking procedure. By grouping the tags, time for solving collision was reduced. It performed fast detection in a robust situation, a group of tags with all possibilities of ID arrangements. Tags attached to the products of different manufacturers may considerably have robust ID. For the security of RFID system, the number of bit (n) will be increased to provide allocation of 2n unique ID. The increasing number of bit and the uniqueness of ID will increase the security of the system from counterfeiting. However it will also increase time identification, but our algorithms will provide fast detection in the situation of high security

A review of deterministic anti collision algorithm of passive RFID systems

Radio frequency identification (RFID) are used widely in many industries, manufacturing companies, material flow systems, etc. Collisions are divided into reader collisions and tag collisions. When the reader sends out a signal which supplies power and instructions to a tag, the tag transmits its ID to the reader and the reader link to an external database with the received ID recognizes the object. The tag collisions occur in the situation when more than one tag reflects their data at the same time, which make it difficult for the reader to search and identify all tags in interrogation zone. In Passive RFID system, tags’ collision are the main issue of multi-tag identification. A various anti-collision techniques and mechanism had been researched for a better collision resolution hence improving system efficiency. Researchers had proposed and improved deterministic and probabilistic of TDMA based anti-collision algorithm. However the complexity of the algorithm is the issue in implementation for passive RFID systems. Limitation of the power and the computational capability of the tags are the constraint of passive RFID system in implementing the anti-collision algorithm. This paper provides a reviews of anti-collision algorithm, an insight of collision resolution techniques, a tag and a reader specification of deterministic algorithm of passive RFID systems. These can give an overview of anti-collision algorithm with system complexity tolerance

Group Collision Tracking Tree for Passive Multi-Tags RFID Systems

The Radio Frequency Identification (RFID) system is gaining widespread adoption, gradually replacing the traditional barcode system. Multi-tag RFID systems are commonly used and rely on passive RFID tags, which are battery-free and powered by electromagnetic waves emitted by the reader. These passive tags are cost-effective compared to active tags with batteries. However, a significant challenge in multi-tag RFID systems is tag collisions, where multiple tags respond simultaneously when the reader queries them. This paper proposes a novel group collision resolution technique of tree-based algorithm. The algorithm categorizes tags into two groups based on the Most Significant Bit (MSB) of their identification (ID). The first group comprises tags with an ID starting with 0X, while the second group consists of tags with an ID starting with 1X. The algorithm utilizes Manchester coding to track the collision bit strategically. This method of grouping is effective, as it rapidly separates tags into segmented groups, reducing the likelihood of tag collisions. The proposed algorithm group-collision tracking tree (GCTT) outperforms existing collision-tracking (CT), and bi-response collision tree (BCT) tree-based algorithms in terms of response time in reading all tags. In summary, the grouping and collision tracking offers promising advancements in the field of tag sorting and enhancing the overall efficiency of multi-tag RFID systems