Yaacob, Marizan and Mohd. Daud, Salwani (2012) Novel binary search algorithm for fast tag detection in robust and secure RFID systems. In: Advanced Machine Learning Technologies and Applications: First International Conference, AMLTA 2012, Cairo, Egypt, December 8-10, 2012. Proceedings. Communications in Computer and Information Science, VIII . Springer Berlin Heidelberg, Netherlands, pp. 575-582. ISBN 978-3-642-35325-3
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-35326-0_57
Abstract
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.
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | anti-collision, binary search, fast tag detection, secure RFID systems |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Computer Science and Information System |
| ID Code: | 29721 |
| Deposited By: | Assoc Prof Dr Salwani Mohd Daud |
| Deposited On: | 26 Mar 2013 00:10 |
| Last Modified: | 04 Feb 2017 06:42 |
Repository Staff Only: item control page
